Hot-potato routing on multi-dimensional tori

  • Friedhelm Meyer
  • Matthias Westermann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1017)

Abstract

We consider the hot-potato routing problem. The striking feature of this form of packet routing is that there are no buffers at the nodes. Thus packets are always moving.

A probabilistic hot-potato routing protocol is presented that routes random functions on the (n, d)-torus. If at most d/88 nd packets, evenly distributed among the processors, have to be routed, they all have reached their destinations in dn+O(d3log n) steps, with high probability, if 3≤d=O(nɛ) with ɛ ε (0, 1/2). This improves upon previous results where similar time bounds are only obtained for constant d and nd packets.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AS92]
    A. Acampora and S. Shah: Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. IEEE Transactions on Communications 40 (1992) 1082–1090Google Scholar
  2. [FR92]
    U. Feige and P. Raghavan: Exact analysis of hot-potato routing. Proceedings of the 33rd Symposium on Foundation of Computer Science (1992) 553–562Google Scholar
  3. [GG93]
    J. Goodman and A. Greenberg: Sharp approximate models of deflection routing in mesh networks. IEEE Transactions on Communications 41 (1993) 210–223Google Scholar
  4. [GH92]
    A. Greenberg and B. Hajek: Deflection routing in hypercube networks. IEEE Transaction on Communications 40 (1992) 1070–1081Google Scholar
  5. [H91]
    B. Hajek: Bounds on evacuation time for deflection routing. Distributed Computing 5 (1991) 1–6Google Scholar
  6. [HK90]
    B. Hajek and A. Krishna: Performance of shuffle-like switching networks with deflections. Proceedings of the IEEE INFOCOM (1990) 473–480Google Scholar
  7. [KKR93]
    C. Kaklamanis, D. Krizanc and S. Rao: Hot-potato routing on processor arrays. Proceedings of the 5th Symposium on Parallel Algorithms and Architectures (1993) 273–282Google Scholar
  8. [M89]
    N. Maxemchuk: Comparison of deflection and store-and-forward techniques in the manhattan street and shuffle-exchange networks. Proceedings of the IEEE INFOCOM (1989) 800–809Google Scholar
  9. [S90]
    T. Szymanski: An analysis of “hot-potato”; routing in a fiber optic packet switched hypercube. Proceedings of the IEEE INFOCOM (1990) 918–925Google Scholar
  10. [W95]
    M. Westermann: Hot-potato routing. Diplomarbeit, University of Paderborn (1995)Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Friedhelm Meyer
    • 1
  • Matthias Westermann
    • 1
  1. 1.Department for Mathematics and Computer Science and Heinz Nixdorf InstituteUniversity of PaderbornPaderbornGermany

Personalised recommendations