MULTISTAGE SHUFFLE NETWORKS WITH SHORTEST-PATH AND DEFLECTION ROUTINGFOR HIGH-PERFORMANCE ATM SWITCHING - THE OPEN-LOOP SHUFFLEOUT

Citation
S. Bassi et al., MULTISTAGE SHUFFLE NETWORKS WITH SHORTEST-PATH AND DEFLECTION ROUTINGFOR HIGH-PERFORMANCE ATM SWITCHING - THE OPEN-LOOP SHUFFLEOUT, IEEE transactions on communications, 42(10), 1994, pp. 2881-2889
Citations number
18
Categorie Soggetti
Telecommunications,"Engineering, Eletrical & Electronic
ISSN journal
00906778
Volume
42
Issue
10
Year of publication
1994
Pages
2881 - 2889
Database
ISI
SICI code
0090-6778(1994)42:10<2881:MSNWSA>2.0.ZU;2-L
Abstract
A new class of switching architectures for broadband packet networks, called Shuffleout, is described and analyzed in this paper. Shuffleout is basically an output-queued architecture with a multistage intercon nection network built out of unbuffered b X 2b switching elements. Its structure is such that the number of cells that can be concurrently s witched from the inlets to each output queue equals the number of stag es in the interconnection network. The switching element operates the cell self-routing adopting a shortest path algorithm which, in case of conflict for interstage links, is coupled with deflection routing. Th is paper presents the basic Shuffleout architecture, called Open-Loop Shuffleout, in which the cells that cross the whole interconnection ne twork without entering the addressed output queues are lost. A differe nt version of this architecture, called Closed-Loop Shuffleout, in whi ch cells are allowed to cross the interconnection network several time s before entering the appropriate output queue, is described in a comp anion paper [1]. The key target of the proposed architecture is coupli ng the implementation feasibility of a self-routing switch with the de sirable traffic performance typical of output queueing.