Fair Scheduling in Internet Routers

Input buffered switch architecture has become attractive for implementing high performance routers and expanding use of the Internet sees an increasing need for quality of service. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative fair scheduling (IFS) scheme for input buffered switches that supports fair bandwidth distribution among the flows and achieves asymptotically 100 percent throughput. The IFS is evaluated both under synthetic workload and with Web traces from the Internet. Compared to the commonly used synthetic input, our simulation results reveal significant difference in performance when the real network traffic is employed. We then consider fair scheduling under various buffer management mechanisms and analyze their impact on the fairness in bandwidth allocation. Our studies indicate that early packet discard in anticipation of congestion is necessary and per-flow based buffering is effective for protecting benign users from being adversely affected by misbehaving traffic. Buffer allocation according to bandwidth reservation is especially helpful when the input traffic is highly bursty.

[1]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[2]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[3]  Laxmi N. Bhuyan,et al.  Exploring the switch design space in a CC-NUMA multiprocessor environment , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[4]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Panayotis Antoniadis,et al.  FIRM: a class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[7]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

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

[9]  Ge Nong,et al.  On the provision of quality-of-service guarantees for input queued switches , 2000 .

[10]  Srinivasan Keshav,et al.  Issues and trends in router design , 1998, IEEE Commun. Mag..

[11]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[12]  Nick McKeown,et al.  The Tiny Tera: A Packet Switch Core , 1998, IEEE Micro.

[13]  Carey L. Williamson,et al.  Internet Web servers: workload characterization and performance implications , 1997, TNET.

[14]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1997, TNET.

[15]  Hui Zhang,et al.  Implementing distributed packet fair queueing in a scalable switch architecture , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[17]  M. Saksena,et al.  Designing buffer management policies at an IP/ATM gateway , 1998, 1998 IEEE ATM Workshop Proceedings. 'Meeting the Challenges of Deploying the Global Broadband Network Infrastructure' (Cat. No.98EX164).

[18]  Christopher Metz.  IP Routers: New Tool for Gigabit Networking , 1998, IEEE Internet Comput..

[19]  Sally Floyd,et al.  Dynamics of TCP traffic over ATM networks , 1994 .

[20]  Nirwan Ansari,et al.  Input-queued switching with QoS guarantees , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[21]  Nick McKeown,et al.  Designing and implementing a fast crossbar scheduler , 1999, IEEE Micro.

[22]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

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

[24]  Sally Floyd,et al.  Dynamics of TCP Traffic over ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[25]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[26]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[27]  Anujan Varma,et al.  Providing bandwidth guarantees in an input-buffered crossbar switch , 1995, Proceedings of INFOCOM'95.

[28]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[29]  Bruce S. Davie,et al.  Computer Networks: A System Approach , 1998, IEEE Communications Magazine.

[30]  Laxmi N. Bhuyan,et al.  Evaluation of multi-queue buffered multistage interconnection networks under uniform and non-uniform traffic patterns , 1997, Int. J. Syst. Sci..

[31]  Satish Rao,et al.  Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[32]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[33]  K.M. Adams,et al.  Packet reassembly during cell loss , 1993, IEEE Network.

[34]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[35]  Daniel Mossé,et al.  A simulation study of packet forwarding methods over ATM: SBR evaluation , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[36]  David Waitzman,et al.  A 50-Gb/s IP router , 1998, TNET.

[37]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[38]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[39]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[40]  Anirban Mahanti,et al.  Traffic analysis of a Web proxy caching hierarchy , 2000 .

[41]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[42]  Roch Guérin,et al.  Optimal Buffer Sharing , 1995, IEEE J. Sel. Areas Commun..