Referenced Items are not available for this document.
The authors discuss the development and performance of a series of distributed routing algorithms for a synchronous circuit-switched hypercube and enhanced hypercube. Several centralized routing algorithms were developed. All the routing algorithms developed were derived from a single high-level concept of how routing can be accomplished in a circuit-switched hypercube. The routing algorithms were derived from the corresponding packet switching routing algorithm. The routing algorithms have different strengths and weaknesses when compared with one another, and these are considered. It is shown that the highest performing algorithm has an extremely low probability of blocking for the enhanced hypercube and the standard hypercube.<
Published in:
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Date of Conference: 1-3 April 1992
- Page(s):
- 15 - 22
- Meeting Date :
- 01 Apr 1992-03 Apr 1992
- Print ISBN:
- 0-7803-0605-8
- INSPEC Accession Number:
- 4358860
- Conference Location :
- Scottsdale, AZ, USA
- Digital Object Identifier :
- 10.1109/PCCC.1992.200533
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
