Distributed Computing

, Volume 5, Issue 1, pp 1–6

Bounds on evacuation time for deflection routing

  • B. Hajek
Article

DOI: 10.1007/BF02311228

Cite this article as:
Hajek, B. Distrib Comput (1991) 5: 1. doi:10.1007/BF02311228

Summary

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 words

Adattive routingHot potato routingDeflection routingMisroutingHypercube network

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • B. Hajek
    • 1
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of Illinois at Urbana-ChampaignUrbanaUSA
  2. 2.Coordinated Science LaboratoryUniversity of Illinois at Urbana-ChampaignUrbanaUSA