Design, Analysis and Implementation of a Novel Multiple Resource Scheduler

Over the past decade, the problem of achieving fair bandwidth allocation on a link shared by multiple traffic flows has been extensively researched. However, as these flows traverse a computer network, they share many different kinds of resources, such as links, buffers, and router CPU. The ultimate goal should hence be overall fairness in the allocation of multiple resources rather than a single specific resource such as link bandwidth. In this paper, we present a novel scheduler, called prediction-based composite fair queuing (PCFQ), which jointly allocates the fair share of the link bandwidth and processing resources to all competing flows. We derive the worst-case delay bound, the work complexity, and the relative fairness bound for the PCFQ scheduler and show that it outperforms a system consisting of separate bandwidth and CPU schedulers. We further present simulation results which illustrate the improved performance characteristics achieved by PCFQ. We also demonstrate that our composite scheduler can be easily implemented on an off-the-shelf network processor such as the Intel IXP 2400. Experimental results from the IXP 2400 implementation highlight the effectiveness and high performance of this algorithm in a real-world system.

[1]  Zhiyong Xu,et al.  Scheduling real-time multimedia tasks in network processors , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[2]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[3]  David K. Y. Yau,et al.  Resource management in software-programmable router operating systems , 2001, IEEE J. Sel. Areas Commun..

[4]  D. Stiliadis,et al.  Rate-proportional servers: a design methodology for fair queueing algorithms , 1998, TNET.

[5]  J. Duane Northcutt,et al.  SVR4UNIX Scheduler Unacceptable for Multimedia Applications , 1993, NOSSDAV.

[6]  Frank A. Cowell,et al.  Measuring inequality : techniques for the social sciences , 1977 .

[7]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1998, TNET.

[8]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[9]  Hui Zhang,et al.  Implementing scheduling algorithms in high-speed networks , 1999, IEEE J. Sel. Areas Commun..

[10]  Tilman Wolf,et al.  Scheduling processing resources in programmable routers , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Yitzchak M. Gottlieb,et al.  Building a robust software-based router using network processors , 2001, SOSP.

[12]  Shueng-Han Gary Chan,et al.  Fair resource allocation in active networks , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[13]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[14]  Salil S. Kanhere,et al.  An evaluation of fair packet schedulers using a novel measure of instantaneous fairness , 2005, Comput. Commun..

[15]  Raj Yavatkar,et al.  Integrated CPU and network-I/O QoS management in an endsystem , 1998, Comput. Commun..

[16]  Sanjay Jha,et al.  Scheduling resources in programmable and active networks based on adaptive estimations , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[17]  Karsten Schwan,et al.  Efficient Implementation of Packet Scheduling Algorithm on High-Speed Programmable Network Processors , 2002, MMNS.

[18]  Albert G. Greenberg,et al.  How fair is fair queuing , 1992, JACM.

[19]  Stephen F. Bush,et al.  Predicting and controlling resource usage in a heterogeneous active network , 2001, Proceedings Third Annual International Workshop on Active Middleware Services.

[20]  Peter Druschel,et al.  Resource containers: a new facility for resource management in server systems , 1999, OSDI '99.

[21]  Clifford W. Mercer.  Operating system support for multimedia applications , 1994, MULTIMEDIA '94.

[22]  Sanjay Jha,et al.  A composite scheduling algorithm for programmable networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[23]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[24]  Luca Fanucci,et al.  A QoS Internet protocol scheduler on the IXP1200 network platform , 2003, The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, 2003. Proceedings..

[25]  John P. Lehoczky,et al.  Integrated resource management and scheduling with multi-resource constraints , 2004, 25th IEEE International Real-Time Systems Symposium.

[26]  Stefan Savage,et al.  Processor capacity reserves: operating system support for multimedia applications , 1994, 1994 Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[27]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[28]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1997, TNET.

[29]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[30]  David K. Y. Yau,et al.  Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles , 2005, IEEE/ACM Transactions on Networking.

[31]  Kang G. Shin,et al.  Adaptive-weighted packet scheduling for premium service , 2001, ICC.