Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1997: Computing and Combinatorics pp 11–17Cite as

Many-to-one packet routing via matchings

Extended Abstract

  • Session 1: Parallel and Distributed Computing
  • Conference paper
  • First Online:

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

Abstract

In this paper we study the packet routing problem under the matching model proposed by Alon, Chung and Graham [1]. We extend the model to allow more than one packet per origin and destination node. We give tight bounds for the many-to-one routing number for complete graphs, complete bipartite graphs and linear arrays. We also present an efficient algorithm for many-to-one routing on an trees (and therefore any graph). Finally, we give bounds for routing arbitrary relations in this model.

Partially supported by NSERC.

The work was done in University of Waterloo.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon, F. R. K. Chung and R. L. Graham. Routing permutations on graphs via matchings. in Proc. of the 25th ACM annual Symposium on Theory of Computing,-1993; SIAM J. Discrete Math. 7 (1994), 516–530.

    Google Scholar 

  2. M. Baumslag and F. Annexstein. A unified framework for off-line permutation routing in parallel networks. Mathematical Systems Theory 24 (1991), 233–251.

    Google Scholar 

  3. N. Haberman. Parallel neighbor-sort (or the glory of the induction principle). Technical Report AD-759 248, National Technical Information Services, US Department of Commerce, Springfield VA 22151, 1972.

    Google Scholar 

  4. D. Krizanc and L. Zhang, Many-to-one routing via matching, Technical Report TR-96-19, School of Computer Science, Carleton University, 1996.

    Google Scholar 

  5. T. Leighton. Methods for message routing in parallel machines. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 77–96, 1992.

    Google Scholar 

  6. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypertubes. Morgan Kaufmann, Cal. 1992.

    Google Scholar 

  7. M. Ramras. Routing permutations on a graph. Networks 23 (1993), 391–398.

    Google Scholar 

  8. A. Roberts, A. Symvonis and L. Zhang, Routing on Trees via Matchings, The Workshop on Algorithms and Data Structures, Kingston, Canada, 1995. Lecture Notes in Computer Sciences vol. 955, 251–263.

    Google Scholar 

  9. L. Zhang, Optimal Bounds for Matching Routing on Trees. Proc. of The Eighth Annual ACM-SIAM Syposium on Discrete Algorithms, New Orleans, 445–453, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, K1S SB6, Ottawa, Ont

    Danny Krizanc

  2. BioInformatics Center, Institute of Systems Science, National University of Singapore, 119597, Republic of Singapore

    Louxin Zhang

Authors
  1. Danny Krizanc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Louxin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krizanc, D., Zhang, L. (1997). Many-to-one packet routing via matchings. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045067

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation