Skip to main content
SpringerLink
Log in

A scalable approach to routing in ATM networks

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1994)

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

Included in the following conference series:

Abstract

We discuss a new routing problem that arises in a very popular type of fast communication networks, namely ATM networks. We first define a graph-theoretic model that captures the characteristics of the new routing problem. In this model we define the general routing problem, and a more restricted case which helps in the solution of the general case. For the latter case we present a routing scheme for a given tree network, by decomposing the network into sub-networks and operating on each sub-network recursively; We also analyze the quality of the resulting routing.

Next, we use our scheme as a building block in a scheme for solving the general problem and analyze the quality of this solution as well. We conclude by proving lower bounds that establish the asymptotic optimality of our results.

The results exhibit a tradeoff between the efficiency of two important factors in ATM networks, namely, (1) the size of the routing tables, and (2) the overhead during the setup of a data connection between any two network users.

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. S. Ahn, R.P. Tsang, S.R. Tong, and D.H.C. Du. Virtual path layout design on ATM networks. In INFOCOM'94, pages 192–200, 1994.

    Google Scholar 

  2. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive routing. In 21st Symp. on Theory of Computing, pages 479–489, 1989.

    Google Scholar 

  3. B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM Journal on Discrete Math, 5(2):151–162, May 1992.

    Article  Google Scholar 

  4. R. Cohen and A. Segall. Connection management and rerouting in ATM networks. In INFOCOM'94, pages 184–191, 1994.

    Google Scholar 

  5. S. Even. Graph Algorithms. Computer Science Press, 1979.

    Google Scholar 

  6. The ATM Forum. ATM, User-Network Interface Specification, version 3.0. Prentice Hall, 1993.

    Google Scholar 

  7. G.N. Frederickson and R. Janardan. Separator-based strategies for efficient message routing. In 27th Symp. on Foundations of Computer Science, pages 428–437, 1986.

    Google Scholar 

  8. G.N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3:171–190, 1988.

    Article  MathSciNet  Google Scholar 

  9. O. Gerstel, I. Cidon, and S. Zaks. The layout of virtual paths in ATM networks. Technical Report (In preparation), Technion.

    Google Scholar 

  10. O. Gerstel and S. Zaks. The virtual path layout problem in fast networks. Accepted to the 13th ACM Symp. on Principles of Distributed Computing, August 1994.

    Google Scholar 

  11. R. Händler and M.N. Huber. Integrated Broadband Networks: an introduction to ATM-based networks. Addison-Wesley, 1991.

    Google Scholar 

  12. Aaron Kershenbaum. Telecommunications Network Design Algorithms. McGraw-Hill, 1993.

    Google Scholar 

  13. L. Kleinrock and F. Kamoun. Hierarchical routing for large networks; preformance evaluation and optimization. Computer Networks, 1:155–174, 1977.

    Article  Google Scholar 

  14. L. Kleinrock and F. Kamoun. Optimal clustering structures for hierarchical topological design of large computer networks. Networks, 10:221–248, 1980.

    Google Scholar 

  15. P. Lougher and D. Sheperd. The design of a storage server for continuous media. The Computer Journal, 36(1), 1993.

    Google Scholar 

  16. D. Peleg and A.A. Schäffer. Graph spanners. Journal of Graph Theory, 13(1): 99–116, 1989.

    Google Scholar 

  17. D. Peleg and E. Upfal. A tradeoff between space and efficiency for routing tables. In 20th Symp. on Theory of Computing, pages 43–52, 1988.

    Google Scholar 

  18. S. Ramanathan and P. Venkat Rangan. Feedback techniques for intra-media continuity and inter-media synchronization in distributed multimedia systems. The Computer Journal, 36(1):19–31, 1993.

    Article  Google Scholar 

  19. B. Zelinka. Medians and peripherians on trees. Arch. Math. (Brno), pages 87–95, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sun Microsystems Labs, 2550 Garcia Ave., 94043, Mountain View, CA

    Israel Cidon

  2. Computer Science Dept., Technion, 32000, Haifa, Israel

    Ornan Gerstel & Shmuel Zaks

Authors
  1. Israel Cidon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ornan Gerstel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shmuel Zaks
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerard Tel Paul Vitányi

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cidon, I., Gerstel, O., Zaks, S. (1994). A scalable approach to routing in ATM networks. In: Tel, G., Vitányi, P. (eds) Distributed Algorithms. WDAG 1994. Lecture Notes in Computer Science, vol 857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020435

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48799-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation