Stability degree of switches with finite buffers and non-negligible round-trip time

Abstract We answer the question on how much memory a packet switch/router needs; more specifically, we propose a systematic method that is simple, rigorous and general for determining the absolute lower bound of packet buffering required by practical switching systems. Accordingly, we introduce a deterministic traffic scenario that stresses the global stability property of finite output queues and demonstrate its usefulness by dimensioning the internal buffer capacity of two popular CIOQ switches.

[1]  Dimitrios N. Serpanos,et al.  Switching fabrics with internal backpressure using the ATLAS I single-chip ATM switch , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[2]  A TerabitMulti-ServiceSwitchWith,et al.  A Terabit Multi-service Switch with Quality of Service Support , 2000 .

[3]  Cyriel Minkenberg,et al.  Stability of CIOQ switches with finite buffers and non-negligible round-trip time , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[4]  Cyriel Minkenberg,et al.  A four-terabit single-stage packet switch with large round-trip time support , 2002, Proceedings 10th Symposium on High Performance Interconnects.

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

[6]  Cyriel Minkenberg,et al.  Current issues in packet switch design , 2003, CCRV.

[7]  Manolis Katevenis.  Buffer requirements of credit-based flow control when a minimum draining rate is guaranteed , 1997, The Fourth IEEE Workshop on High-Performance Communication Systems.

[8]  Eiji Oki,et al.  CIXOB-k: combined input-crosspoint-output buffered packet switch , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[9]  A. Charny,et al.  Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[10]  Balaji Prabhakar,et al.  Matching Output Queueing with Combined Input and Output Queueing , 1999 .

[11]  N. D. Georganas,et al.  Analysis of a packet switch with input and output buffers and speed constraints , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[12]  Andrea Francini,et al.  A distributed scheduling architecture for scalable packet switches , 2000, IEEE Journal on Selected Areas in Communications.

[13]  Achille Pattavina,et al.  Analysis of input and output queueing for nonblocking ATM switches , 1993, TNET.

[14]  Tara Javidi,et al.  A high-throughput scheduling algorithm for a buffered crossbar switch fabric , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[15]  H. Suzuki,et al.  Expandable ATOM switch architecture (XATOM) for ATM LANs , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[16]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[17]  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).

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

[19]  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).

[20]  C. Minkenberg,et al.  A combined input and output queued packet switched system based on PRIZMA switch on a chip technology , 2000, IEEE Communications Magazine.

[21]  Sally Floyd,et al.  Difficulties in simulating the internet , 2001, TNET.

[22]  Masayuki Murata,et al.  Effect of speedup in nonblocking packet switch , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[23]  Wolfgang E. Denzel,et al.  Analysis of packet switches with input and output queuing , 1993, IEEE Trans. Commun..

[24]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[25]  Cyriel Minkenberg.  Work-conservingness of CIOQ packet switches with limited output buffers , 2002, IEEE Communications Letters.

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