Water-filling technique-based proportionally fair scheduling algorithm for SC-FDMA

2016 ◽  
Vol 27 (12) ◽  
pp. 1664-1671 ◽  
Author(s):  
Jaheon Gu ◽  
Tae-Jin Lee ◽  
Min Young Chung
Keyword(s):  
Scheduling Algorithm ◽  
Fair Scheduling ◽  
Water Filling

Fair scheduling algorithm in IEEE 802.16e system

2009 ◽  
Vol 29 (5) ◽  
pp. 1204-1207
Author(s):  
Hong-xia ZHANG ◽  
Ju-feng DAI
Keyword(s):  
Scheduling Algorithm ◽  
Ieee 802.16E ◽  
Fair Scheduling

A Multi-Tier Architecture for the Management of Supply Chain of Cloud Resources in a Virtualized Cloud Environment

2021 ◽  
Vol 14 (3) ◽  
pp. 1-17
Author(s):  
Muhammad Aliyu ◽  
Murali M. ◽  
Abdulsalam Y. Gital ◽  
Souley Boukari ◽  
Rumana Kabir ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Supply Chain ◽  
Spanning Tree ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Chain Management ◽  
Fair Scheduling ◽  
The Core ◽  
Cloud Resource ◽  
Core Function

As cloud resource demand grows, supply chain management (SCM), which is the core function of cloud computing, faces serious challenges. Quite a number of techniques have been proposed by many researchers for such a challenge. As such, numerous proposed strategies are still under reckoning and modification so as to enhance its potential. An optimized dynamic scheme that combined several algorithms' characteristics was proposed to map out such a challenge. The hybridized proposed scheme involved the meta-heuristic swarm mechanism of ant colony optimization (ACO) and deterministic spanning tree (SPT) algorithm as it obtained faster convergence chain, ensured resource utilization in least time and cost. Extensive experiments conducted in cloudsim simulator provided an efficient result in terms of minimized makespan time and throughput as compared to SPT, round robin (RR), and pre-emptive fair scheduling algorithm (PFSA) as it significantly improves performance.

A Dynamic Round-Robin Packet Scheduling Algorithm

2013 ◽  
Vol 347-350 ◽  
pp. 2203-2207 ◽  
Author(s):  
Yong He ◽  
Lei Gao ◽  
Gui Kai Liu ◽  
Yu Zhen Liu
Keyword(s):  
Time Complexity ◽  
High Efficiency ◽  
Packet Scheduling ◽  
Simulation Analysis ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Good Time ◽  
Performance Simulation ◽  
Fair Scheduling ◽  
Packet Scheduling Algorithm

This paper puts forward a new dynamic round-robin (DYRR) packet scheduling algorithm with high efficiency and good fairness. DYRR algorithm introduces dynamic round-robin concept, that is, the allowance given to each of the flows in a given round is not fixed, but is related with the number of bytes sent of this and other flows of the last round scheduling. The time complexity of the DYRR algorithm is O(1). Results from performance simulation analysis shows that DYRR algorithm can effectively smooth output burst, realize fair scheduling, and have a good time delay characteristic.

Sign in / Sign up

Export Citation Format

Share Document