On the provision of quality-of-service guarantees for input queued switches

While the Internet has quietly served as a research and education vehicle for more than two decades, the last few years have witnessed its tremendous growth and its great potential for providing a wide variety of services. As a result, input-queued switching architectures, because of their distinguished advantage in building scalable switches, are currently receiving a lot of attention from both academia and industry as an attractive alternative for developing future-generation ATM/IP switches/routers. However, the problem of designing scheduling algorithms with QoS guarantees for input-queued switches has always been known to be a very challenging problem. We give an overview of the efforts in designing scheduling algorithms capable of providing QoS guarantees for input-queued switches. These algorithms are classified under three categories: those based on slot time assignment, those based on maximal matching, and those based on stable matching. We also present some open problems on this topic as future research directions in this area.

[1]  Hui Zhang,et al.  Exact emulation of an output queueing switch by a combined input output queueing switch , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[2]  Nick McKeown,et al.  ATM input-buffered switches with the guaranteed-rate property , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[3]  Ge Nong,et al.  Analysis of nonblocking ATM switches with multiple input queues , 1999, TNET.

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

[5]  H. T. Mouftah,et al.  Survey of ATM Switch Architectures , 1995, Comput. Networks ISDN Syst..

[6]  Ge Nong,et al.  Analysis of non-blocking ATM switches with multiple input queues , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[7]  Nick McKeown,et al.  Matching output queueing with a combined input output queued switch , 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).

[8]  Bruce E. Hajek,et al.  Scheduling nonuniform traffic in a packet switching system with small propagation delay , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[9]  Nick McKeown,et al.  Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..

[10]  Nick McKeown,et al.  A Quantitative Comparison of Iterative Scheduling Algorithms for Input-Queued Switches , 1998, Comput. Networks.

[11]  Anna Charny,et al.  On the speedup required for work-conserving crossbar switches , 1999, IEEE J. Sel. Areas Commun..

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

[13]  Nick McKeown,et al.  On the speedup required for combined input- and output-queued switching , 1999, Autom..

[14]  Kai-Yeung Siu,et al.  Linear-complexity algorithms for QoS support in input-queued switches with no speedup , 1999, IEEE J. Sel. Areas Commun..

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

[16]  Bruce Hajek,et al.  Scheduling nonuniform traffic in a packet-switching system with small propagation delay , 1997, TNET.

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