Title :
A load-balanced switch with an arbitrary number of linecards
Author :
Keslassy, Isaac ; Chuang, Shang-Tse ; McKeown, Nick
Author_Institution :
Comput. Syst. Lab., Stanford Univ., CA
Abstract :
The load-balanced switch architecture is a predicting way to scale router capacity. It requires no centralized scheduler, requires no memory operating faster than the line-rate which can be built using a fixed, optical mesh. In a recent paper it is explained how to prevent packet missequencing and provide 100% throughput for all traffic patterns, and described the design of 100 Tb/s router using technology available within three year there is one major problem with the load-balanced switching makes the basic mesh architecture impractical: Because the optical mesh must be uniform, the switch does not work when one or more linecards is missing or has failed. Instead we can use the passive optical switch architecture with MEMS switches the reconfigured only when linecards are added and deleted, all the router to function when any subset of linecards is presently working. In this paper we derive an expression for the number of MEMS switches that are needed, and describe an algorithm to configure them. We prove that the algorithm will be a always correct configuration in polynomial time, and show example of its running time
Keywords :
mesh generation; microswitches; optical switches; packet switching; polynomials; resource allocation; telecommunication network routing; telecommunication traffic; 100 Tbit/s; MEMS switch; linecard; load-balanced switch architecture; optical mesh architecture; packet missequencing; passive optical switch architecture; polynomial time; router capacity; router design; traffic pattern; Computer architecture; Fabrics; Microswitches; Optical buffering; Optical interconnections; Optical packet switching; Optical switches; Throughput; Traffic control; Wavelength division multiplexing;
Conference_Titel :
INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies
Print_ISBN :
0-7803-8355-9
DOI :
10.1109/INFCOM.2004.1354609