A Priority Load-Aware Scheduling Algorithm for Wireless Broadband Networks

Author(s):  
Aminu Mohammed ◽  
Ibrahim Saidu ◽  
Abdulhakeem Abdulazeez
Author(s):  
Aminu Mohammed ◽  
Abdulhakeem Abdulazeez ◽  
Ahmed Tambuwal Yusuf

WiMAX, one of the emerging wireless broadband networks, was designed to support traffic from applications with diverse QoS requirements. In WiMAX, an efficient resource management technique such as scheduling is required for the proper allocation of network resources to these data streams. This article proposes an enhanced priority load-aware scheduling (EPLAS) algorithm to improve the performance of WiMAX networks. The proposed scheme adaptively determines the weight of each queue based on the queue load. It also introduces a packet drop control mechanism that reduces the packet drop rate and increases the average throughput of the network by prioritizing packets with the earliest deadlines within each queue. The performance of EPLAS was evaluated against other benchmark schemes using several simulation experiments. The results revealed that EPLAS performed significantly better than the benchmark algorithms in terms of average delay, average packet drop ratio, and average throughput.


1998 ◽  
Vol 36 (2) ◽  
pp. 112-117 ◽  
Author(s):  
J. Mikkonen ◽  
C. Corrado ◽  
C. Evci ◽  
M. Progler

Author(s):  
Shaohua Teng ◽  
Wei Zhang ◽  
Haibin Zhu ◽  
Xiufen Fu ◽  
Jiangyi Su ◽  
...  

The LLF (Least Laxity First) scheduling algorithm assigns a priority to a task according to its executing urgency. The smaller the laxity value of a task is, the sooner it needs to be executed. When two or more tasks have same or approximate laxity values, LLF scheduling algorithm leads to frequent switches among tasks, causes extra overhead in a system, and therefore, restricts its application. The least switch and laxity first scheduling algorithm is proposed in this paper by searching out an appropriate common divisor in order to improve the LLF algorithm for periodic tasks.


Author(s):  
Sang-Hyuk Yun ◽  
Hyo-Sung Ahn ◽  
Sun-Ju Park ◽  
Ok-Chul Jung ◽  
Dae-Won Chung

In this paper, we address the optimal ground antenna scheduling problem for multiple satellites when multiple satellites have visibility conflicts at a ground station. Visibility conflict occurs when multiple satellites have either overlapping visibilities at a ground station or difference with time of loss of signal (LOS) of a satellite and time of acquisition of signal (AOS) of another satellite is less than reconfiguration time of ground station. Each satellite has a priority value that is a weight function with various factors. Multi-antenna scheduling (MAS) algorithm 1 and Multi-antenna scheduling (MAS) algorithm 2 are proposed to find the optimal schedule of multi-antenna at a ground station using pre-assigned priority values of satellites. We use the depth first search (DFS) method to search the optimal schedule in MAS algorithm 1 and MAS algorithm 2. Through the simulations, we confirm the efficiency of these algorithms by comparing with greedy algorithm.


Author(s):  
Dorothy Okello ◽  
Wilson Wasswa ◽  
Peter Mukasa ◽  
Derrick Sebbaale ◽  
Mark Kagarura

Sign in / Sign up

Export Citation Format

Share Document