DocumentCode
2427513
Title
Analytical results for the error free spiral computer network topology
Author
Mitchell, Tony L. ; Nilsson, Arne A.
Author_Institution
Dept. of Math. Sci., US Air Force Acad., Colorado Springs, CO, USA
fYear
1989
fDate
22-24 March 1989
Firstpage
219
Lastpage
223
Abstract
Spiral is an easily expandable, high fault-tolerant self-routing computer network topology. The architecture is built around modules of four fully connected computer nodes each, connected by top and bottom spirals. Six theorems (without proof) and analytical results based on those theorems are reported. The theorems concern disjoint paths, maximum path length, traffic between source-destination pairs, expected average link traffic, total one-way link traffic, and mean path length.<>
Keywords
computer networks; fault tolerant computing; modules; average link traffic; disjoint paths; error free spiral computer network topology; fault-tolerant self-routing; maximum path length; mean path length; modules; total one-way link traffic; Computer architecture; Computer errors; Computer networks; Fault tolerance; Heart; Joining processes; Network topology; Partitioning algorithms; Spirals; Springs;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 1989. Conference Proceedings., Eighth Annual International Phoenix Conference on
Conference_Location
Scottsdale, AZ, USA
Print_ISBN
0-8186-1918-x
Type
conf
DOI
10.1109/PCCC.1989.37390
Filename
37390
Link To Document