DocumentCode
3452703
Title
A self-routing algorithm for the spiral computer network topology
Author
Mitchell, Tony L. ; Nilsson, Arne A.
Author_Institution
Dept. of Math. Sci., US Air Force, Colorado Springs, CO, USA
fYear
1988
fDate
28 Nov-1 Dec 1988
Firstpage
420
Abstract
The authors describe the routing algorithm for an easily expandable, highly fault tolerant, self-routing computer network topology. This computer connectivity scheme is named the spiral topology because the architecture is built around modules of four computer nodes each, connected by top and bottom spirals. Examples of how the routing algorithm operates are provided
Keywords
computer networks; fault tolerant computing; computer connectivity; computer nodes; fault tolerant computing; self-routing algorithm; spiral computer network topology; Computer architecture; Computer networks; Exponential distribution; ISDN; Joining processes; Network topology; Routing; Spirals; Telecommunication traffic; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1988, and Exhibition. 'Communications for the Information Age.' Conference Record, GLOBECOM '88., IEEE
Conference_Location
Hollywood, FL
Type
conf
DOI
10.1109/GLOCOM.1988.25875
Filename
25875
Link To Document