Continuous Routing in Packet Switches

Considering continuous routing, we analyze the transient behavior of n×n routers with input buffering, split input buffering, output buffering, and central buffering with dedicated virtual circuits, one for each source-destination pair in a network. Assuming similar buffer space requirements, output buffering has the highest throughput. Split input buffering and central buffering have comparable performance; split input buffering slightly outperforms central buffering for large switches. Input buffering is known to saturate at packet generating rates above 0.586. By extending these models, two 1024-node, unique-path multistage networks configured with (approximately-modeled) input buffered STC104 32×32 switches, or central buffered Telegraphos 4×4 switches (Telegraphos I version) are compared. Surprisingly, the network configured with smaller switches performs better. This is due to the higher peak bandwidth of the Telegraphos switch and saturation of the input buffered STC104 switch.

[1]  Costas Courcoubetis,et al.  Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..

[2]  Barry Wilkinson.  Cascaded Rhombic Crossbar Interconnection Networks , 1990, J. Parallel Distributed Comput..

[3]  Suresh Chalasani,et al.  A Framework for Designing Deadlock-Free Wormhole Routing Algorithms , 1996, IEEE Trans. Parallel Distributed Syst..

[4]  Suresh Chalasani,et al.  Evaluation of Two Traffic Distribution Strategies for a Dual-Network Multiprocessor System , 1992, IEEE Trans. Parallel Distributed Syst..

[5]  Manolis Katevenis.  Telegraphos: high-speed communications architecture for parallel and distributed computer systems , 1994 .

[6]  Allan Gottlieb,et al.  Networks and algorithms for very-large-scale parallel computation , 2011, Computer.

[7]  P. H. Welch,et al.  Networks, Routers and Transputers: Function, Performance and Applications , 1993 .

[8]  Peter W. Thompson,et al.  The STC104 Packet Routing Chip , 1995, VLSI Design.

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

[10]  Miltos D. Grammatikakis,et al.  Simulations of Crossbar Switches for Parallel Systems , 1995, EUROSIM.

[11]  M. D. Grammatikakis,et al.  Multicasting control and communications on multihop stack-ring OPS networks , 1997, Proceedings of the Fourth International Conference on Massively Parallel Processing Using Optical Interconnections.

[12]  Evangelos P. Markatos,et al.  Telegraphos: A Substrate for High-Performance Computing on Workstation Clusters , 1997, J. Parallel Distributed Comput..

[13]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[14]  Nina A. H. Madsen,et al.  The Macramé 1024 Node Switching Network , 1997, HPCN Europe.

[15]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[16]  Laxmi N. Bhuyan,et al.  Finite Buffer Analysis of Multistage Interconnection Networks , 1994, IEEE Trans. Computers.

[17]  Rami G. Melhem,et al.  Short Circuits in Buffered Multi-Stage Interconnection Networks , 1990, Comput. J..

[18]  David T. Harper,et al.  Evaluation of Reduced Bandwidth Multistage Networks , 1990, J. Parallel Distributed Comput..