Skip to main content
SpringerLink
Log in

Dynamic tree routing under the “matching with consumption” model

  • Session 7b: Invited Presentation
  • Conference paper
  • First Online:
Book cover Algorithms and Computation (ISAAC 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1178))

Included in the following conference series:

  • 148 Accesses

Abstract

In this paper we present an extensive study of dynamic routing on trees under the “matching with consumption” routing model. We present an asymptotically optimal on-line algorithm which routes k packets to their destination within d(k−1) + d · dist routing steps, where d is the degree of tree T on which the routing takes place and dist is the maximum distance any packet has to travel. We also present an off-line algorithm that solves the same problem within 2(k−1) + dist steps. The analysis of our algorithms is based on the establishment of a close relationship between the matching and the hot-potato routing models.

The work of Dr Pantziou was partly supported by the EEC ESPRIT Projects GEPPCOM (contract No. 9072) and ALCOM IT. The work of Dr Symvonis is supported by an ARC Institutional Grant.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, Chung, and Graham. Routing permutations on graphs via matchings. SIAM Journal on Discrete Mathematics, 7:513–530, 1994.

    Article  Google Scholar 

  2. P. Baran. On distributed communication networks. IEEE Trans. on Commun. Systems, CS-12:1–9, 1964.

    Article  Google Scholar 

  3. A. Borodin, Y. Rabani, and B. Schieber. Deterministic many-to-many hot potato routing. Technical Report RC 20107 (6/19/95), IBM Research Division, T.J. Watson Research Center, Yorktown Heights, NY 10598, June 1995.

    Google Scholar 

  4. 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 

  5. U. Feige and P. Raghavan. Exact analysis of hot-potato routing. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (Pittsburgh, Pennsylvania, October 24–27, 1992), pages 553–562, Los Alamitos-Washington-Brussels-Tokyo, 1992. IEEE Computer Society Press.

    Google Scholar 

  6. N. Haberman. Parallel neighbor-sort (or the glory of the induction principle). Technical Report AD-759 248, National Technical Information Service, US Department of Commerce, 5285 Port Royal Road, Springfieldn VA 22151, 1972.

    Google Scholar 

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

    Google Scholar 

  8. P. Høyer and K.S. Larsen. Permutation routing via matchings. Technical Report 16, Dept of Mathematics and Computer Science, Odense University, June 1996.

    Google Scholar 

  9. C. Kaklamanis, D. Krizanc, and S. Rao. Hot-potato routing on processor arrays. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '93 (Velen, Germany, June 30–July 2, 1993), pages 273–282, New York, 1993. ACM SIGACT, ACM SIGARCH, ACM Press.

    Google Scholar 

  10. D. Krizanc and L. Zhang. Packet routing via matchings. Unpublished manuscript, 1996.

    Google Scholar 

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

    Article  Google Scholar 

  12. G. Pantziou, A. Roberts, and A. Symvonis. Many-to-many routing on trees via matchings. Technical Report TR-507, Basser Dept of Computer Science, University of Sydney, July 1996. Available from ftp://ftp.cs.su.oz.au/pub/tr/TR96_507.ps.Z.

    Google Scholar 

  13. A. Roberts, A. Symvonis, and L. Zhang. Routing on trees via matchings. In Proceedings of the Fourth Workshop on Algorithms and Data Structures (WADS'95), Kingston, Ontario, Canada, pages 251–262. Springer-Verlag, LNCS 955, aug 1995. Also TR 494, January 1995, Basser Dept of Computer Science, University of Sydney. Available from ftp://ftp.cs.su.oz.au/pub/tr/ps.z.

    Google Scholar 

  14. L. Zhang. Personal communication, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece

    Grammati E. Pantziou

  2. Department of Computer Science, University of Sydney, 2006, N.S.W., Australia

    Alan Roberts & Antonis Symvonis

Authors
  1. Grammati E. Pantziou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Roberts
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonis Symvonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pantziou, G.E., Roberts, A., Symvonis, A. (1996). Dynamic tree routing under the “matching with consumption” model. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009504

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation