Lambda scheduling algorithm for file transfers on high-speed optical circuits

2004 ◽  
Author(s):  
H. Lee ◽  
M. Veeraraghavan ◽  
H. Li ◽  
E.K.P. Chong
Keyword(s):  
High Speed ◽  
Scheduling Algorithm ◽  
File Transfers ◽  
Optical Circuits

scholarly journals Scheduling and Transport for File Transfers on High-Speed Optical Circuits

2003 ◽  
Vol 1 (4) ◽  
pp. 395-405 ◽  
Author(s):  
Malathi Veeraraghavan ◽  
Xuan Zheng ◽  
Wu-chun Feng ◽  
Hojun Lee ◽  
Edwin K.P. Chong ◽  
...  
Keyword(s):  
High Speed ◽  
File Transfers ◽  
Optical Circuits

scholarly journals Randomized scheduling algorithm for virtual output queuing switch at the presence of non-uniform traffic

2019 ◽  
Vol 8 (1) ◽  
pp. 50
Author(s):  
Ali Ghiasian ◽  
Majid Jamali
Keyword(s):  
Randomized Algorithms ◽  
High Speed ◽  
Time Slot ◽  
Scheduling Algorithm ◽  
Superior Performance ◽  
High Complexity ◽  
Maximum Weight ◽  
Switch Architecture ◽  
Simulation Results ◽  
Maximum Weight Matching

<span>Virtual Output Queuing (VOQ) is a well-known queuing discipline in data switch architecture that eliminates Head Of Line (HOL) blocking issue. In VOQ scheme, for each output port, a separate FIFO is maintained by each input port. Consequently, a scheduling algorithm is required to determine the order of service to virtual queues at each time slot. Maximum Weight Matching (MWM) is a well-known scheduling algorithm that achieves the entire throughput region. Despite of outstanding attainable throughput, high complexity of MWM makes it an impractical algorithm for implementation in high-speed switches. To overcome this challenge, a number of randomized algorithms have been proposed in the literature. But they commonly perform poorly when input traffic does not uniformly select output ports. In this paper, we propose two randomized algorithms that outperform the well-known formerly proposed solutions. We exploit a method to keep a parametric number of heavy edges from the last time matching and mix it by randomly generated matching to produce a new schedule. Simulation results confirm the superior performance of the proposed algorithms.</span>

A Modified Proportional Fair Scheduling Algorithm for the Electric Power Wireless Private Network

2012 ◽  
Vol 614-615 ◽  
pp. 1749-1753
Author(s):  
Jin Ping Cao ◽  
Jian Ming Liu ◽  
Shao Min Zhu ◽  
De Quan Gao
Keyword(s):  
Electric Power ◽  
High Speed ◽  
Scheduling Algorithm ◽  
Distribution Networks ◽  
Communication Performance ◽  
Proportional Fair ◽  
Wireless Communication Network ◽  
Radio Resources ◽  
Proportional Fair Scheduling ◽  
Private Network

With the development of smart grid, the requirements of high speed, low delay and better coverage have motivated a electric power wireless network that bridge the communication gaps between the transmission system and the load. In this paper, we introduce a new electric power wireless communication network, and give a general overview of studies on the major characters of communication such as wide coverage, a lot of measurement points in distribution networks as well. In order to improve the communication performance, the paper proposes a modified proportional fair algorithm, which allocates the radio resources by introducing a Quality-of-Service (QoS) scale factor. By comparing with the proportional fair algorithm, we get the conclusion that the modified algorithm is more suitable for the electric power wireless private network.

Sign in / Sign up

Export Citation Format

Share Document