Skip to main content
SpringerLink
Log in

Bounds on evacuation time for deflection routing

  • Published:
Distributed Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Baran P: On distributed communication networks. IEEE Trans Commun Syst 12:1–9 (1964)

    Google Scholar 

  2. Borodin A, Hopcroft JE: Routing, merging and sorting on parallel models of computation. J Comput Syst Sci 30:130–145 (1985)

    MathSciNet  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–270

    Google Scholar 

  4. Greenberg AG, Hajek B: Average case performance of deflection routing in a hypercube. Preprint 1989

  5. Hillis D: The connection machine. Boston: MIT Press 1985

    Google Scholar 

  6. Lawrie D: Access and alignment of data on an array processor. IEEE Trans Comput 24:1145–1155 (1975)

    MATH  MathSciNet  Google 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 Press

  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–9

  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–248

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, 61801, Urbana, IL, USA

    B. Hajek

  2. Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 61801, Urbana, IL, USA

    B. Hajek

Authors
  1. B. Hajek
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Bruce Hajek received a B.S. in Mathematics and an M.S. in Electrical Engineering from the University of Illinois and a Ph.D. in Electrical Engineering from the University of California at Berkeley. He is a Professor in the Coordinated Science Laboratory and the Department of Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign, where he has been since August, 1979. His research interests include communication and computer network algorithms, information theory, random processes, and combinatorial optimization.

Supported by the National Science Foundation under contract NSF ECS 83 52030 with matching funds provided by AT&T. Postal address: CSL, 1101 W. Springfield, Urbana IL 61801, USA.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hajek, B. Bounds on evacuation time for deflection routing. Distrib Comput 5, 1–6 (1991). https://doi.org/10.1007/BF02311228

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02311228

Key words

Search

Navigation