A Dynamic Round-Robin Packet Scheduling Algorithm

Yong He; Lei Gao; Gui Kai Liu; Yu Zhen Liu

doi:10.4028/www.scientific.net/AMM.347-350.2203

Paper Titles

Research on Underwater Polarization Image Segmentation Inspired by Biological Optic Nerve
p.2178

Research the Key Technologies of the Mongolian Full-Text Retrieval Based on Lucene
p.2185

Identification of the D-S Evidence Conflict Based on Multi-Source Information
p.2191

An Introduction to Viewpoint Selection in Volume Visualization
p.2197

A Dynamic Round-Robin Packet Scheduling Algorithm
p.2203

An Algorithm of Plus-Closures of Loop-Nonnegative Matrices over Idempotent Semirings and its Applications
p.2208

Digital Watermarking Algorithm Based on Wavelet Analysis
p.2214

A Partitioning Image Retrieval Method Based on Regional Division and Polymerization
p.2218

Study on Mobile Learning Platform Based on Wireless Communication
p.2223

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 347-350A Dynamic Round-Robin Packet Scheduling Algorithm

A Dynamic Round-Robin Packet Scheduling Algorithm

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 347-350)

Pages:

2203-2207

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.347-350.2203

Citation:

Cite this paper

Online since:

August 2013

Authors:

Yong He, Lei Gao, Gui Kai Liu, Yu Zhen Liu

Keywords:

Burs, Dynamic, Fairness, Round-Robin, Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Hongchao Hu, Peng Yi, Yunfei Guo, Yufeng Li. A Fair Service and Dynamic Rond Robin Scheduling Algorithm [J]. Journal of Software, 2008, 19(7): 1856-1864.

DOI: 10.3724/sp.j.1001.2008.01856

Google Scholar

[2] Xiaodong Li, Lemin Li. LL-DRR: An Efficient Scheduling Algorithm for Packet Networks [J]. Journal of Electronics and Technology, 2002, 24(3).

Google Scholar

[3] Xiang Wu, Hongwei Kong, Weizhang Wang, Ning Ge. An Improvement of DRR Packet Scheduling Algorithm [J]. Journal of Electronics and Technology, 2003, 25(5).

Google Scholar

[4] Fei Gao, Yuan Zhang. An Improved Algorithm of DRR Combining with traffic shaper [A]. 2010 Third Pacific-Asia Conference on Web Mining and Web-Based Application [C]. (2010).

Google Scholar

[5] Xiancheng Xu. Survey of Qos Scheduling Algorithms [J]. Journal of Henan University of Science and Technology, 2003, 24(4).

Google Scholar

[6] SHREEDHA M, VARGHESE G. Efficient fair queuing using deficit round robin [J]. IEEE/ACM Transaction on Networking, 1996, 4(3): 375- 385.

DOI: 10.1109/90.502236

Google Scholar

[7] Linhuan Zhong, Zhimei Wu, Zhong Zheng, Xianlei Wang, He Jiang. Research of Novel Packet Fair Scheduling Algorithm [J]. Application Research of Computers, 2008, 25(4).

Google Scholar