Browse > Article

Non-Work Conserving Round Robin Schedulers  

Joung, Ji-Noo (상명대학교 소프트웨어학부)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.9, no.8, 2005 , pp. 1663-1668 More about this Journal
Abstract
There have been numerous researches regarding the QoS guarantee in packet switching networks. IntServs, based on a signaling mechanism and scheduling algorithms, suggesting promising solutions, yet has the crucial complexity problem so that not enough real implementations has been witnessed. Flow aggregation is suggested recently to overcome this issue. In order to aggregated flows fairly so that the latency of the aggregated flows is bound, however, a non-work conserving scheduler is necessary, which is not very popular because of its another inherent complexity. We suggest a non-work conserving scheduler, the Round Robin with Virtual Flow (RRVF), which is a variation of the popular Deficit Round Robin (DRR). We study the latency of the RRVF, and observe that the non-work conserving nature of the RRVF yields a slight disadvantage in terms of the latency, but after the aggregation the latency is greatly reduced, so that e combined latency is reduced. We conclude that the flow aggregation through RRVF can actually reduce the complexity of the bandwidth allocation as well as the overall latency within a network.
Keywords
QoS; Scheduling; DRR; Flow Aggregation; Latency;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Demers, S. Keshav, and S. Shenker, 'Analysis and Simulation of a Fair Queuing Algorithm,' in ACM SIGCOMM, pp. 1-12, Sep. 1989
2 M. Shreedhar and G. Varghese, 'Efficient fair queueing using deficit round-robin,' IEEE/ACM Trans. Networking, vol. 4, no. 3, pp. 375 - 385, June 1996   DOI   ScienceOn
3 A. K. Parekh and R. G. Gallager, 'A generalized processor sharing approach to flow control in integrated services networks: The singlenode case,' IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344 - 357, June 1993   DOI   ScienceOn
4 S. Golestani, 'A Self-clocked Fair Queueing Scheme for Broadband Applications', in IEEE INFOCOM'94, 1994
5 I. Stoica and H. Zhang, 'Providing guaranteed services without per flow management,' in Proc. ACM SIGCOMM, pp. 81 - 94, Aug. 1999
6 L. Lenzini, E. Mingozzi, and G. Shea, 'Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers,' lEEE/ACM Trans. Networking, vol. 12, no. 4, pp. 681 - 693, Aug. 2004   DOI   ScienceOn
7 J. A. Cobb, 'Preserving Quality of Service guarantees in spite of flow aggregation', IEEE/ACM Trans. Networking, vol. 10, no. 1, Feb. 2002
8 S. S. Kanhere and H. Sethu, 'On the latency bound of deficit round robin', in Proceedings of the ICCCN, Miami, Oct. 2002
9 D. Stiliadis and A. Varma, 'Latency-Rate servers: A general model for analysis of traffic scheduling algorithms', IEEE/ACM Trans. Networking, vol. 6, no. 5 Oct. 1998