DocumentCode
3277585
Title
Efficient routing and conflict resolution in F and IADM networks
Author
Anand, K.C. ; Agrawal, Dharma P. ; Kini, Nita M.
Author_Institution
Comput. Syst. & Commun. Group, Tata Inst. of Fundamental Res., Bombay, India
fYear
1990
fDate
9-13 Dec 1990
Firstpage
556
Lastpage
559
Abstract
The paper introduces a novel routing technique and a way to realize passable permutations in F and IADM redundant multistage interconnection networks. The simplicity of selecting alternate routes for a given source-destination pair is demonstrated by two examples. The concept of cycles is introduced and is used to develop an algorithm to realize conflict free permutations in these networks
Keywords
fault tolerant computing; multiprocessor interconnection networks; network topology; redundancy; F networks; IADM networks; conflict resolution; cycles; fault tolerance; multistage interconnection networks; network topology; passable permutations; redundant networks; routing; Broadcasting; Computer networks; Fault tolerance; Intelligent networks; Law; Multiprocessor interconnection networks; Network topology; Redundancy; Routing; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-2087-0
Type
conf
DOI
10.1109/SPDP.1990.143604
Filename
143604
Link To Document