A Dynamic Round-robin Packet Scheduling Algorithm
Yong He, Lei Gao, Guikai Liu, Yuzhen Liu
Available Online March 2013.
- https://doi.org/10.2991/iccsee.2013.675How to use a DOI?
- scheduling, dynamic, round-robin, fairness, burs
- 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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Yong He AU - Lei Gao AU - Guikai Liu AU - Yuzhen Liu PY - 2013/03 DA - 2013/03 TI - A Dynamic Round-robin Packet Scheduling Algorithm BT - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013) PB - Atlantis Press SP - 2708 EP - 2711 SN - 1951-6851 UR - https://doi.org/10.2991/iccsee.2013.675 DO - https://doi.org/10.2991/iccsee.2013.675 ID - He2013/03 ER -