DocumentCode :
1910154
Title :
Reduction of crosspoints in one-sided crosspoint switching networks
Author :
Varma, Anujan ; Chalasani, Suresh
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear :
1989
fDate :
23-27 Apr 1989
Firstpage :
943
Abstract :
The authors establish upper and lower bounds for the number of crosspoints required in a one-sided crosspoint switching network to provide a given level of connectivity. Two modes of operation are considered, namely, nonblocking and rearrangeable. A complete nonblocking switch matrix with N ports has N2 /2 crosspoints. The authors show that this number can be reduced by at most N/2-1 crosspoints for nonblocking operation. If rearrangeable operation is allowed, however, as many as 25% of the crosspoints can be removed. An analysis is made of the relationship between the number of crosspoints removed and the maximum number of rearrangements of connections needed. Also introduced are algorithms for rearrangement of connections in both single-chip and partitioned implementations with reduced numbers of crosspoints
Keywords :
switching networks; crosspoints reduction; lower bounds; nonblocking; one-sided crosspoint switching networks; rearrangeable; switch matrix; upper bounds; Assembly; Communication switching; Computer networks; Fault tolerance; Intelligent networks; Partitioning algorithms; Switches; Turning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM '89. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging, IEEE
Conference_Location :
Ottawa, Ont.
Print_ISBN :
0-8186-1920-1
Type :
conf
DOI :
10.1109/INFCOM.1989.101545
Filename :
101545
Link To Document :
بازگشت