PWBA: A Novel Multicast Scheduling Algorithm for Wideband Multimedia Satellite Communications

2012 ◽  
Vol 195-196 ◽  
pp. 895-900
Author(s):  
Zhen Yong Wang ◽  
Xiao Wei Liu ◽  
Xue Mai Gu
Keyword(s):  
Scheduling Algorithm ◽  
Satellite Communications ◽  
Satellite Networks ◽  
Multimedia Services ◽  
Multicast Service ◽  
Multicast Scheduling ◽  
Satellite Scheduling ◽  
Balance Trade ◽  
Multicast Services

Satellite multicast service expands the application of wideband multimedia satellite. Scheduling plays an important role to guarantee Quality of Service (QoS) for wideband multimedia multicast services. In this paper, considering various properties of QoS requirements of latency, throughput and priority, a PWBA multicast scheduling algorithm is proposed to balance trade-off between throughput and latency in order to providing better multimedia services in satellite networks. Comparing with the WBA and PGMF multicast scheduling policies, the proposed PWBA has better performances in both latency and throughput.

scholarly journals Optimal approach for building scheduling algorithm in satellite communication

2018 ◽  
Vol 7 (2.28) ◽  
pp. 181
Author(s):  
Ali M. Al-Saegh
Keyword(s):  
Quality Of Service ◽  
Communication Networks ◽  
Satellite Communication ◽  
Scheduling Algorithm ◽  
Satellite Communications ◽  
Satellite Networks ◽  
Communication Links ◽  
Optimal Approach ◽  
Proper Solutions

Building scheduling algorithms in satellite communication links became a necessity according to the typical problems that satellite networks suffers from, such as congestions, jamming, mobility, atmospheric impairment, and achieving the quality of service (QoS) requirements. However, building efficient algorithms needs several considerations that should be taken into account. Such as satellite and earth station node(s), link parameters and specifications, along with the service requirements and limitations. This paper presents efficient approach for accumulating the effective considerations that the designer should employ as a framework for building proper and efficient scheduling algorithm. The proposed approach provides proper solutions to the satellite communications impairments and satisfies the quality of service requirements in satellite communication networks.  

Broadband Satellite Multimedia Networks

2010 ◽  
pp. 377-397 ◽  
Author(s):  
Paolo Chini ◽  
Giovanni Giambene ◽  
Snezana Hadzic
Keyword(s):  
Resource Management ◽  
Satellite System ◽  
Satellite Networks ◽  
Multimedia Networks ◽  
Multimedia Services ◽  
Management Schemes ◽  
To Receive ◽  
Suitable Case

Nowadays there is an increasing need of broadband communication anytime, anywhere for users that expect to receive multimedia services with support of quality of service. In such a scenario, the aim of this chapter is to present the possibility of the satellite option that is particular attracting to bridge the digital divide in those areas where terrestrial solutions are unfeasible or too expensive. This chapter provides first a survey of the ETSI standardization framework for satellite networks. Then, resource management schemes for both forward and return link are described. Finally a suitable case study is provided for the integration of a DVB-S/DVB-RCS satellite system interconnected with a WiFi segment for local coverage; examples and results permit to understand different resource management implications.

scholarly journals Link Scheduling Algorithm to Mitigate Worst-Case Interference Problems for LTE-A

2021 ◽  
Vol 10 (3) ◽  
pp. 1832-1836
Keyword(s):  
Scheduling Algorithm ◽  
Link Scheduling ◽  
Transmission Performance ◽  
Multimedia Services ◽  
Worst Case ◽  
Real Time Traffic ◽  
Scheduling Method ◽  
Simulation Results ◽  
Interference Problems

As the number of apps increases, the traffic of multimedia services in wireless networks grows exponentially. Because of the proportional fair algorithm's shortcomings in terms of achieving Quality of Service (QoS) requirements such as delay and packet loss, it is not extensively employed in modern wireless communication. This study provides a scheduling method based on the QoS utility function, with a parameter added to improve the priority mechanism in order to overcome such flaws. Our scheduling algorithm can match the QoS criteria of real-time traffic, according to simulation results, and the overall system transmission performance has increased significantly.

A Bandwidth and Energy Aware QoS Routing Protocol for Enhanced Performance in Ad-hoc Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 203-213
Author(s):  
Priyanka Bharadwaj ◽  
Surjeet Balhara
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Qos Routing ◽  
Delivery Ratio ◽  
Energy Aware ◽  
Multimedia Services ◽  
Average Delay ◽  
Hoc Networks

Background & Objective: There are some challenging issues such as providing Quality of Service (QoS), restricted usage of channels and shared bandwidth pertaining to ad-hoc networks in a dynamic topology. Hence, there is a requirement to support QoS for the application environment and multimedia services in ad-hoc networks with the fast growing and emerging development of information technology. Eventually, bandwidth is one of the key elements to be considered. Methods: Energy aware QoS routing protocol in an ad-hoc network is presented in this article. Results and Conclusion: The simulation results indicate that the improved protocol outperforms Adhoc On-Demand Distance Vector (AODV) routing protocol in terms of QoS metric such as throughput, packet delivery ratio, loss rate and average delay.

Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

2020 ◽  
Vol 13 ◽  
Author(s):  
Ge Weiqing ◽  
Cui Yanru
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Task Completion ◽  
Improved Genetic Algorithm ◽  
Fitness Functions ◽  
Task Scheduling Algorithm ◽  
Simulation Results

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

scholarly journals On the Design of Efficient Hierarchic Architecture for Software Defined Vehicular Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1400
Author(s):  
Muhammad Adnan ◽  
Jawaid Iqbal ◽  
Abdul Waheed ◽  
Noor Ul Amin ◽  
Mahdi Zareei ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Quality Of Service ◽  
Traffic Management ◽  
Vehicular Networks ◽  
Scheduling Algorithm ◽  
Main Research ◽  
First Come First Serve ◽  
Computing Framework ◽  
Simulation Results

Modern vehicles are equipped with various sensors, onboard units, and devices such as Application Unit (AU) that support routing and communication. In VANETs, traffic management and Quality of Service (QoS) are the main research dimensions to be considered while designing VANETs architectures. To cope with the issues of QoS faced by the VANETs, we design an efficient SDN-based architecture where we focus on the QoS of VANETs. In this paper, QoS is achieved by a priority-based scheduling algorithm in which we prioritize traffic flow messages in the safety queue and non-safety queue. In the safety queue, the messages are prioritized based on deadline and size using the New Deadline and Size of data method (NDS) with constrained location and deadline. In contrast, the non-safety queue is prioritized based on First Come First Serve (FCFS) method. For the simulation of our proposed scheduling algorithm, we use a well-known cloud computing framework CloudSim toolkit. The simulation results of safety messages show better performance than non-safety messages in terms of execution time.

Sign in / Sign up

Export Citation Format

Share Document