Skip to main content
SpringerLink
Log in

Universal Bufferless Routing

  • Conference paper
Book cover Approximation and Online Algorithms (WAOA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3351))

Included in the following conference series:

Abstract

Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time close to the lower bound Ω(C + D)). Our main result is a new deterministic technique that constructs a universal bufferless algorithm by emulating a universal buffered algorithm. The heart of the emulation is to replace packet buffering with packet circulation on regions of the network. The cost of the emulation on the routing time is proportional to the square of the node buffer size used by the buffered algorithm. We apply this emulation to a simple randomized buffered algorithm to obtain a distributed, universal bufferless algorithm with routing time O((C + D) · log3(n + N)), which is within poly-logarithmic factors from the optimal, where n is the size of the network and N is the number of packets. The bufferless competitive ratio is the ratio of the best achievable bufferless routing time, to the best achievable buffered routing time. We give the first non-trivial bound of O(log3(n + N)) for the bufferless competitive ratio for arbitrary routing problems.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Adler, M., Khanna, S., Rajaraman, R., Rosen, A.: Time-constrained scheduling of weighted packets on trees and meshes. In: Proceedings of 11th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1–12 (1999)

    Google Scholar 

  2. Alon, N., Chung, F.R.K., Graham, R.L.: Routing permutations on graphs via matching. SIAM Journal on Discrete Mathematics 7(3), 513–530 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Direct routing on trees. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 342–349 (1998)

    Google Scholar 

  4. Bar-Noy, A., Raghavan, P., Schieber, B., Tamaki, H.: Fast deflection routing for packets and worms. In: Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, Ithaca, New York, USA, August 1993, pp. 75–86 (1993)

    Google Scholar 

  5. Baran, P.: On distributed communications networks. IEEE Transactions on Communications, 1–9 (1964)

    Google Scholar 

  6. Ben-Dor, A., Halevi, S., Schuster, A.: Potential function analysis of greedy hot-potato routing. Theory of Computing Systems 31(1), 41–61 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Berenbrink, P., Scheideler, C.: Locally efficient on-line strategies for routing packets along fixed paths. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, January  17–19, pp. 112–121. ACM-SIAM, New York (1999)

    Google Scholar 

  8. Bhatt, S.N., Bilardi, G., Pucci, G., Ranade, A.G., Rosenberg, A.L., Schwabe, E.J.: On bufferless routing of variable-length message in leveled networks. IEEE Trans. Comput. 45, 714–729 (1996)

    Article  MATH  Google Scholar 

  9. Brassil, J.T., Cruz, R.L.: Bounds on maximum delay in networks with deflection routing. IEEE Transactions on Parallel and Distributed Systems 6(7), 724–732 (1995)

    Article  Google Scholar 

  10. Broder, A., Upfal, E.: Dynamic deflection routing on arrays. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, May 1996, pp. 348–358 (1996)

    Google Scholar 

  11. Busch, C.: Õ(Congestion + Dilation) hot-potato routing on leveled networks. In: Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures, August 2002, pp. 20–29 (2002)

    Google Scholar 

  12. Busch, C., Herlihy, M., Wattenhofer, R.: Hard-potato routing. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, May 2000, pp. 278–285 (2000)

    Google Scholar 

  13. Busch, C., Magdon-Ismail, M., Mavronicolas, M., Spirakis, P.: In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221. Springer, Heidelberg (2004)

    Google Scholar 

  14. Busch, C., Magdon-Ismail, M., Mavronicolas, M., Wattenhofer, R.: Near-optimal hot-potato routing on trees. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol. 3149, pp. 820–827. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Cypher, R., auf der Heide, F.M., Scheideler, C., Vöcking, B.: Universal algorithms for store-and-forward and wormhole routing. In: Proceedings of the 28th ACM Symp. on Theory of Computing (STOC), pp. 356–365 (1996)

    Google Scholar 

  16. Feige, U., Raghavan, P.: Exact analysis of hot-potato routing. In: IEEE (ed.) Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PN, October 1992, pp. 553–562 (1992)

    Google Scholar 

  17. Greenberg, R.I., Oh, H.-C.: Universal wormhole routing. IEEE Transactions on Parallel and Distributed Systems 8(3), 254–262 (1997)

    Article  Google Scholar 

  18. Hajek, B.: Bounds on evacutation time for deflection routing. Distributed Computing 1, 1–6 (1991)

    Article  Google Scholar 

  19. Kaklamanis, Ch., Krizanc, D., Rao, S.: Hot-potato routing on processor arrays. In: Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, Velen, Germany, June 30–July 2, pp. 273–282 (1993)

    Google Scholar 

  20. Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-scheduling in O(congestion+dilation) steps. Combinatorica 14, 167–186 (1994); (preliminary version appears in FOCS 1988)

    Article  MATH  MathSciNet  Google Scholar 

  21. auf der Heide, F.M., Scheideler, C.: Routing with bounded buffers and hot-potato routing in vertex-symmetric networks. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 341–354. Springer, Heidelberg (1995)

    Google Scholar 

  22. auf der Heide, F.M., Vöcking, B.: Shortest-path routing in arbitrary networks. Journal of Algorithms 31(1), 105–131 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  23. Ostrovsky, R., Rabani, Y.: Universal O(congestion+dilation+log1 + ε N) local control packet switching algorithms. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, New York, May 1997, pp. 644–653 (1997)

    Google Scholar 

  24. Rabani, Y., Tardos, É.: Distributed packet switching in arbitrary networks. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, May 22–24, pp. 366–375 (1996)

    Google Scholar 

  25. Roberts, A., Symvonis, A., Wood, D.R.: Lower bounds for hot-potato permutation routing on trees. In: Proceedings of the 7th Int. Coll. Structural Information and Communication Complexity, SIROCCO, June 20–22, pp. 281–295 (2000)

    Google Scholar 

  26. Zhang, L.: Optimal bounds for matching routing on trees. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 445–453 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, 12180, USA

    Costas Busch & Malik Magdon-Ismail

  2. Department of Computer Science, University of Cyprus, Nicosia, CY-1678, Cyprus

    Marios Mavronicolas

Authors
  1. Costas Busch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Malik Magdon-Ismail
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marios Mavronicolas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica ed Applicazioni, Università di Salerno, 84084, Fisciano, (SA), Italy

    Giuseppe Persiano

  2. Department of Computer Science, The University of Western Ontario, London, Canada

    Roberto Solis-Oba

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Busch, C., Magdon-Ismail, M., Mavronicolas, M. (2005). Universal Bufferless Routing. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31833-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24574-2

  • Online ISBN: 978-3-540-31833-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation