Flow Aggregation of Rate Controlled Round-Robin Scheduler

ETRI Journal

关键词: QoS;    DiffServ;    IntServ;    rate control;    flow aggregation;    Packet scheduler;   

Others  :  1185133
DOI  :  10.4218/etrij.04.0103.0142

【 摘 要 】

Flow aggregation is a scalable method to provide qualityof service (QoS) guarantees to a large number of flowseconomically. A round-robin scheduler is an efficientscheduling algorithm. We investigate flow aggregationusing a round-robin scheduler and propose the use ofperiodic timer interrupts for rate control of the roundrobinscheduler. The proposed flow aggregator is a singlestagescheduler compared to Cobb’s two-stage flowaggregator consisting of an aggregator and nonaggregatingscheduler. It is possible to implement flowaggregation in the existing routers with only a softwareupgrade. We also present a simulation study showing thedelay behaviors of the proposed algorithm.

   

【 参考文献 】

• [1]John B. Nagle, "On Packet Switches with Infinite Storage," IEEE Trans. on Comm., 1994, pp. 435-438.
• [2]Lixia Zhang, "VirtualClock: A New Traffic Control Algorithm for Packet Switching Network," ACM SIGCOMM, 1990, pp. 19-29.
• [3]Abhay K. Parekh and Robert G. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case," IEEE/ACM Trans. on Networking, vol.1, no.3, 1993, pp. 344-357.
• [4]S. Jamaloddin Golestani, "A Self-Clocked Fair Queuing Scheme for Broadband Applications," IEEE INFOCOM, 1994, pp. 636-646.
• [5]Norival R. Figueira and Joseph Pasquale, "An Upper Bound on Delay for the VirtualClock Service Discipline," IEEE/ACM Trans. on Networking, vol.3, no.4, 1995.
• [6]M. Shreedhar and G. Varghese, "Efficient Fair Queuing Using Deficit Round Robin," ACM SIGCOMM, 1995, pp. 231-242.
• [7]Jon C. R. Bennett and Hui Zhang, "WF2Q: Worst-case Fair Weighted Fair Queuing," IEEE INFOCOM, 1996, pp. 120-128.
• [8]Kicheon Kim and David Hutchison, "Flowmeter for QoS Provision in Packet Switched Network," IEE Electronics Lett., vol.34, no.1, 1998, pp. 21-22.
• [9]Salil S. Kanhere and Harish Sethu, "Fair, Efficient and Scalable Scheduling Without Per-Flow State," IEEE Int’l Conf. on Performance, Computing, and Comm., 2001, pp. 181-187.
• [10]Jorge Arturo Cobb, "Preserving Quality of Service Guarantees in Spite of Flow Aggregation," IEEE/ACM Trans. on Networking, vol.10, no.1, 2002, pp. 43-53.
• [11]Michael G. Hluchyj and Mark J. Karol, "Queuing in High-Performance Packet Switching," IEEE J. on Selected Areas in Comm., vol.6, no.9, 1988, pp. 1587-1597.
• [12]S. Moon, J. Rexford and K. Shin, "Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches," IEEE Trans. on Computer, vol.49, no.11, 2000, pp. 1215-1227.
• [13]P. Kuacharoen, M. Shalan, and V. Mooney, "A Configurable Hardware Scheduler for Real-Time Systems," Int’l Conf. on Eng. of Reconfigurable Systems and Algorithms (ERSA’03), 2003, pp. 96-101.
• [14]Shun Y. Cheung and Corneliu S. Pencea, "BSFQ: Bin Sort Fair Queuing," IEEE INFOCOM, 2002, pp. 1640-1649.
• [15]Huirong Fu and Edward W. Knightly, "A Simple Model of Real-Time Flow Aggregation," IEEE/ACM Trans. on Networking, vol.11, no.3, 2003, pp. 422-435.