Bounds on evacuation time for deflection routing
- 58 Downloads
Upper bounds are given on the timeT needed to evacuatek packets from a synchronous packet network using deflection routing, whereby all packets that arrive at a node during one time slot leave the node during the next slot. For example,T≤n+2(k−1) for a binaryn-cube network when priority is given to packets closer to their destination, and for a single destination networkT is less than or equal to the network diameter plusk−1 times the network deflection index. Deflection routing for one pass through an omega network is also considered.
Key wordsAdattive routing Hot potato routing Deflection routing Misrouting Hypercube network
Unable to display preview. Download preview PDF.
- 1.Baran P: On distributed communication networks. IEEE Trans Commun Syst 12:1–9 (1964)Google Scholar
- 3.Greenberg AG, Goodman J: Sharp approximate models of adaptive routing in mesh networks. In: Boxma OJ, Cohen JW, Tijms JC (eds) Teletraffic analysis and computer performance evaluation. Amsterdam: Elsevier 1986, pp 255–270Google Scholar
- 4.Greenberg AG, Hajek B: Average case performance of deflection routing in a hypercube. Preprint 1989Google Scholar
- 5.Hillis D: The connection machine. Boston: MIT Press 1985Google Scholar
- 7.Lawrie DH, Padua DA: Analysis of message switching with single-exchanges in multiprocessors. Proc IEEE Workshop on Interconnection Networks for Parallel and Distributed Computing 1980, pp 116–127. Also in: Wu, Feng (eds) Interconnection networks. Silverspring: IEEE Comput Soc PressGoogle Scholar
- 8.Ngai JY, Seitz CL: A framework for adaptive routing in multicomputer networks. Proc ACM Sympon Parallel Algorithms and Architecture, Santa Fe, New Mexico 1989, pp 1–9Google Scholar
- 9.Smith B: Architecture and applications of the HEP multiprocessor computer system. In: Tao TF (ed) Real-time signal processing IV—Proc SPIE 298. Soc Photo-Optical Eng 1981, pp 241–248Google Scholar