DocumentCode
2853011
Title
Cyclic routing in wormhole networks
Author
Blight, David C. ; McLeod, Robert D.
Author_Institution
TR Labs., Winnipeg, Alta., Canada
fYear
1995
fDate
17-19 May 1995
Firstpage
481
Lastpage
484
Abstract
This paper discusses deadlock free routing algorithms for wormhole routing in which there are cycles in the channel dependency graph (CDG). Wormhole routing is designed to offer the best characteristics of both circuit switched and packet switched networks. Messages can be routed between channels which introduce cycles in the CDG as long as messages do not wait for these channels. These results have applications in implementing adaptive routing algorithms
Keywords
graph theory; message switching; switching networks; telecommunication channels; telecommunication network routing; adaptive routing algorithms; channel dependency graph; circuit switched networks; cyclic routing; deadlock free routing algorithms; message routing; packet switched networks; wormhole networks; Circuit topology; Communication switching; Intelligent networks; Magnetic force microscopy; Multicast algorithms; Network topology; Packet switching; Routing; Switching circuits; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Computers, and Signal Processing, 1995. Proceedings., IEEE Pacific Rim Conference on
Conference_Location
Victoria, BC
Print_ISBN
0-7803-2553-2
Type
conf
DOI
10.1109/PACRIM.1995.519574
Filename
519574
Link To Document