Skip to main content
SpringerLink
Log in

Bounds and Analysis Techniques for Greedy Hot-Potato Routing

  • Chapter
Optical Interconnections and Parallel Processing: Trends at the Interface

Abstract

In this chapter we consider a type of packet routing known as hot-potato routing. In hot-potato routing there is no intermediate storage for the packets (messages) that are on their way to their destinations, which is an important feature for communication networks that are based on optical hardware and for which the messages are composed of beams of light. In particular we consider a “practical” mode of routing, known as greedy routing. In greedy routing, unless some local congestion forbids it, an intermediate network node always attempts to send packets towards their destinations. We present several algorithms and analysis methods that were recently suggested by the author and his colleagues for greedy routing, along with some negative results by means of a general lowerbound.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. S. Acampora and S. I. A. Shah. Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. In INFOCOM, pages 10–19. IEEE, 1991.

    Google Scholar 

  2. H. G. Badr and S. Podar. An optimal shortest-path routing policy for network computers with regular mesh-connected topologies. IEEE Transactions on Computers, 38 (10): 1362–1371, Oct. 1989.

    Article  MathSciNet  Google Scholar 

  3. A. Bar-Noy, P. Raghavan, B. Schieber, and H. Tamaki. Fast deflection routing for packets and worms. In Proceedings 12th Symposium on Principles of Distributed Computing, pages 75–86. ACM, 1993.

    Google Scholar 

  4. P. Baran. On distributed communications networks. IEEE Transactions on Communications, 12: 1–9, 1964.

    Article  Google Scholar 

  5. I. Ben-Aroya. Algorithms and bounds for deflection routing. Master’s thesis (In Hebrew), Technion, Computer Science Department, Apr. 1994.

    Google Scholar 

  6. I. Ben-Aroya, D. D. Chinn, and A. Schuster. A lower bound for nearly minimal adaptive and hot potato algorithms. In 4th European Symposium on Algorithms, pages 471–485, Barcelona, Sept. 1996.

    Google Scholar 

  7. I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single target hot potato routing. Journal of Algorithms, 23:101–120, 1997. Preliminary version in Proceedings of the 3rd Israeli Symposium on Theory of Computing and Systems, January 1995, pages 20–29.

    Google Scholar 

  8. I. Ben-Aroya, E. Tamar, and A. Schuster. Greedy hot-potato routing on the two-dimensional mesh. Distributed Computing, 9(1):3–19, 1995. (Also in Proceedings of the 2nd European Symposium on Algorithms, Utrecht, 1994).

    Google Scholar 

  9. A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. To appear in Mathematical Systems Theory, 1997. Preliminary version in Proceedings of the 13th Symposium on Principles of Distributed Computing, Los Angeles 1994, pages 225–234.

    Google Scholar 

  10. A. Borodin and J. Hoperoft. Routing, merging, and sorting on parallel models of computation. Journal of Computer and System Sciences, 30: 130–145, 1985.

    Article  MATH  Google Scholar 

  11. A. Borodin, Y. Rabani, and B. Schieber. Deterministic many-to-many hot potato routing. Technical Report RC 20107, IBM Watson Research Report, 1995.

    Google Scholar 

  12. J. T. Brassil and R. L. Cruz. Bounds on maximum delay in networks with deflection routing. In Proceedings of the 29th Allerton Conference on Communication, Control and Computing, pages 571–580, 1991.

    Google Scholar 

  13. D. D. Chinn, T. Leighton, and M. Tompa. Minimal adaptive routing on the mesh with bounded queue size. Journal of Parallel and Distributed Computing, 34(2):154–170, 1996. Preliminary version in Proceedings of the 6th Symposium on Parallel Algorithms and Architectures, June 1994, pages 354–363.

    Google Scholar 

  14. U. Feige. Observations on hot potato routing. In Proceedings of the 3rd Israeli Symposium on Theory of Computing and Systems, pages 30–39, Jan. 1995.

    Chapter  Google Scholar 

  15. U. Feige and P. Raghavan. Exact analysis of hot-potato routing. In Proceedings of the 33rd Symposium on Foundations of Computer Science, pages 553–562. IEEE, Nov. 1992.

    Chapter  Google Scholar 

  16. A. G. Greenberg and J. Goodman. Sharp approximate models of adaptive routing in mesh networks. In O. J. Boxma, J. W. Cohen, and H. C. Tijms, editors, Teletraffic Analysis and Computer Performance Evaluation, pages 255–270. Elsevier, Amsterdam, 1986.

    Google Scholar 

  17. A. G. Greenberg and B. Hajek. Deflection routing in hypercube networks. IEEE Transactions on Communications, June 1992.

    Google Scholar 

  18. B. Hajek. Bounds on evacuation time for deflection routing. Distributed Computing, 5: 1–6, 1991.

    Article  MATH  Google Scholar 

  19. S. Halevi. On greedy hot potato routing. Master’s thesis (In Hebrew), Technion, Computer Science Department, July 1993.

    Google Scholar 

  20. C. Kaklamanis, D. Krizanc, and S. Rao. Hot-potato routing on processor arrays. In Proceedings of the 5th Symposium on Parallel Algorithms and Architectures, pages 273–282. ACM, 1993.

    Google Scholar 

  21. M. Kaufmann, H. Lauer, and H. Schröder. Fast deterministic hot-potato routing on meshes. In Proceedings of the 5th International Symposium on Algorithms and Computation (ISAAC), volume 834 of Lecture Notes in Computer Science, pages 333–341. Springer-Verlag, 1994.

    Google Scholar 

  22. F. T. Leighton. Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann Publishers, 1991.

    Google Scholar 

  23. Y. Mansour and B. Patt-Shamir. Many-to-one packet routing on grids. In Proceedings of the 27th Symposium on Theory of Computer Science, pages 258267, Las-Vegas, Nevada, 1995. ACM.

    Google Scholar 

  24. N. F. Maxemchuk. Comparison of deflection and store and forward techniques in the manhattan street and shuffle exchange networks. In IEEE INFOCOM, pages 800–809, 1989.

    Google Scholar 

  25. F. Meyer auf der Heide and C. Scheideler. Routing with bounded buffers and hot-potato routing in vertex-symmetric networks. In Proceedings of the 3rd European Symposium on Algorithms, pages 341–354, Corfu, Greece, Sept. 1995.

    Google Scholar 

  26. I. Newman and A. Schuster. Hot-potato algorithms for permutation routing. IEEE Transactions on Parallel and Distributed Systems, 6 (11): 1168–1176, Nov. 1995.

    Article  Google Scholar 

  27. I. Newman and A. Schuster. Hot-potato worm routing via store-and-forward packet routing. Journal of Parallel and Distributed Computing, 30: 76–84, 1995.

    Article  Google Scholar 

  28. J. Y. Ngai and C. L. Seitz. A framework for adaptive routing in multicomputer networks. In Proceedings of the Ist Symposium on Parallel Algorithms and Architectures, pages 1–9. ACM, 1989.

    Google Scholar 

  29. R. Prager. An algorithm for routing in hypercube networks. Master’s thesis, University of Toronto, Computer Science Department, 1986.

    Google Scholar 

  30. C. Seitz. The Caltech Mosaic C: an experimental, fine-grain multicomputer. In Proceedings of the 4th Symposium on Parallel Algorithms and Architectures, San Diego, June 1992. ACM. Keynote Speech.

    Google Scholar 

  31. B. Smith. Architecture and applications of the HEP multiprocessor computer system. In Proceedings of (SPIE) Real Time Signal Processing IV, pages 241–248, 1981.

    Google Scholar 

  32. T. Szymanski. An analysis of hot potato routing in a fiber optic packet switched hypercube. In IEEE INFOCOM, pages 918–926, 1990.

    Google Scholar 

  33. Z. Zhang and A. S. Acampora. Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities. In IEEE INFOCOM, pages 1012–1021, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Technion, Haifa, Israel, 32000

    Assaf Schuster

Authors
  1. Assaf Schuster
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LRI, Université Paris XI, 91405, Orsay Cedex, France

    Pascal Berthomé

  2. CNRS, LIP, ENS-Lyon, 46, allée d’Italie, 69364, Lyon Cedex 07, France

    Afonso Ferreira

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Schuster, A. (1998). Bounds and Analysis Techniques for Greedy Hot-Potato Routing. In: Berthomé, P., Ferreira, A. (eds) Optical Interconnections and Parallel Processing: Trends at the Interface. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2791-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2791-3_11

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4782-6

  • Online ISBN: 978-1-4757-2791-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation