DocumentCode
1385709
Title
A modification to a decomposition algorithm of Gordon and Srikanthan
Author
Hwang, F.K.
Author_Institution
AT&T Bell Labs., Murray Hill, NJ, USA
Volume
46
Issue
8
fYear
1997
fDate
8/1/1997 12:00:00 AM
Firstpage
958
Lastpage
960
Abstract
Recently, J. Gordon and S. Srikanthan (1990) gave a new approach to route a rearrangeable three-stage Clos network. However, their algorithm was suspected to be incomplete by Y.K. Chiu and W.C. Siu (1991), and by H.Y. Lee and J.D. Carpinelli (1994). We show that a modification of their algorithm assures a correct routing
Keywords
graph colouring; hypercube networks; telecommunication network routing; decomposition algorithm; graph coloring; permutation matrix; rearrangeable three-stage Clos network; Iterative algorithms; Matrix decomposition; Routing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.609284
Filename
609284
Link To Document