Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 1997: SOFSEM'97: Theory and Practice of Informatics pp 144–160Cite as

Path layout in ATM networks

  • Invited Papers
  • Conference paper
  • First Online:

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

Abstract

This paper surveys recent results in the area of virtual path layout in ATM networks. We focus on the one-to-all (or broadcast) and the all-to-all problems. We present a model for theoretical studies of these layouts, which amounts to covering the network with simple paths, under various constraints. The constraints are the hop count (the number of paths traversed between the vertices that have to communicate), the load (the number of paths that share an edge or a vertex), and the stretch factor (the total length traversed between pairs of vertices, comparing with the distance between them). The results include recursive constructions, greedy and dynamic programming algorithms, lower bounds proofs, and NP-complete results.

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

    Google Scholar 

  2. W. Aiello, S. Bhatt, F. Chung, A. Rosenberg, and R. Sitaraman. Augmented rings networks. J. Math. Modelling and Scientific Computing, 1997.

    Google Scholar 

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

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

    Google Scholar 

  5. L. Beccheti, C. Gaibisso, and G. Gambosi. Optimal layouts of virtual paths on a mesh, 1997. Private communication.

    Google Scholar 

  6. H.L. Bodlaender. A tourist guide through treewidth. Technical report RUU-CS92-12, Utrecht university, Dept. of Computer Science, Netherlands, March 1992.

    Google Scholar 

  7. H.L. Bodlaender, G. Tel, and N. Santoro. Trade-offs in non-reversing diameter. Nordic Journal of Computing, 1:111–134, 1994.

    Google Scholar 

  8. J. Burgin and D. Dorman. Broadband ISDN resource management: The role of virtual paths. IEEE Communications Magazine, 29, 1991.

    Google Scholar 

  9. F. Chung, E. Coffman, M. Reiman, and B. Simon. The forwarding index of communication networks. ieeeinfo, 33:224–232, 1987.

    Google Scholar 

  10. I. Cidon, O. Gerstel, and S. Zaks. A scalable approach to routing in ATM networks. In G. Tel and P.M.B. Vitányi, editors, The 8th International Workshop on Distributed Algorithms (LNCS 857), pages 209–222, Terschelling, The Netherlands, October 1994.

    Google Scholar 

  11. I. Cidon, O. Gerstel, and S. Zaks.S. A scalable approach to routing in atm networks. In Proceedings 8th Intl. Workshop Distributed Algorithms (WDAG), pages 209–222, 1994.

    Google Scholar 

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

    Google Scholar 

  13. Y. Dinitz, M. Feighelstein, and S. Zaks. On optimal graphs embedded into paths and rings, with analysis using l 1-spheres. In Proc. of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Germany, jun 1997.

    Google Scholar 

  14. Ye. Dinitz. Subset connectivity and edge-disjoint trees, with an application to target broadcasting. Technical Report TR-822, Technion, Haifa, Israel, 1994.

    Google Scholar 

  15. Ye. Dinitz, T. Eilam, S. Moran, and S. Zaks. On the totalk-diameter of connection networks. In Proceedings of the fifth Israel Symposium on Theory of Computing and Systems, pages 96–106, 1997.

    Google Scholar 

  16. T. Eilam, M. Flammini, and S. Zaks. A complete characterization of the path layout construction problem for atm networks with given hop count and load. In Proc. 24th International Colloq. on Automata, Languages, and Programming, 1997.

    Google Scholar 

  17. M. Feighelstein and S. Zaks. Duality in chain atm virtual path layouts. In sirocco97, pages 24–26, 1997.

    Google Scholar 

  18. M. Flammini, E. Nardelli, and G. Proietti. Atm layouts with bounded hop count and congestion. In wdag11, pages 24–26, Saarbrüecken, Germany, September 1997.

    Google Scholar 

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

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

    Google Scholar 

  21. O. Gerstel. Virtual Path Design in ATM Networks. PhD thesis, Technion, Israel Inst. of Technology, December 1995.

    Google Scholar 

  22. O. Gerstel, I. Cidon, and S. Zaks. Efficient support for the client-server paradigm over ATM networks. In IEEE Infocom'96, pages 1294–1301, 1996. Submitted to IEEE/ACM Trans. on Networking.

    Google Scholar 

  23. O. Gerstel, I. Cidon, and S. Zaks. The layout of virtual paths in ATM networks. ACM/IEEE Transactions on networking, 4(6):873–884, December 1996. A preliminary version of this paper appears in [10].

    Google Scholar 

  24. O. Gerstel and A. Segall. Dynamic maintenance of the virtual path layout. In IEEE INFOCOM'95, April 1995.

    Google Scholar 

  25. O. Gerstel, A. Wool, and S. Zaks. Optimal layouts on a chain ATM network. 3rd Annual European Symposium on Algorithms (ESA), (LNCS 979), Corfu, Greece, September 1995, pages 508–522. To appear in Discrete Applied Mathematics.

    Google Scholar 

  26. O. Gerstel and S. Zaks. The virtual path layout problem in fast networks. In The 13th ACM Symp. on Principles of Distributed Computing, pages 235–243, Los Angeles, USA, August 1994.

    Google Scholar 

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

    Google Scholar 

  28. M-C. Heydemann, J-C. Meyer, and D. Sotteau. On forwarding indices of networks. Discrete Applied Math, 23:103–123, 1989.

    Google Scholar 

  29. ITU recommendation. I series (B-ISDN), Blue Book, November 1990.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  32. E. Kranakis, D. Krizanc, and A. Pelc. Hop-congestion tradeoffs for high-speed networks. In 7th IEEE Symp. on Parallel and Distributed Processing, pages 662–668, 1995.

    Google Scholar 

  33. F.Y.S. Lin and K.T. Cheng. Virtual path assignment and virtual circuit routing in ATM networks. In IEEE Globecom'93, pages 436–441, 1993.

    Google Scholar 

  34. C. Partridge. Gigabit Networking. Addison Wesley, 1994.

    Google Scholar 

  35. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36:510–530, 1989.

    Google Scholar 

  36. K.I. Sato, S. Ohta, and I. Tokizawa. Broad-band ATM network architecture based on virtual paths. IEEE Transactions on Communications, 38(8):1212–1222, August 1990.

    Google Scholar 

  37. Y. Sato and K.I. Sato. Virtual path and link capacity design for ATM networks. IEEE Journal of Selected Areas in Communications, 9, 1991.

    Google Scholar 

  38. L. Stacho and I. Vrt'o. Virtual path layouts for some bounded degree networks. In Proc. 3rd International Colloquium on Structural Information and Communication Complexity (SIROCCO), Siena, Italy, June, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion, 32000, Haifa, Israel

    Shmuel Zaks

Authors
  1. Shmuel Zaks
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

František Plášil Keith G. Jeffery

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zaks, S. (1997). Path layout in ATM networks. In: Plášil, F., Jeffery, K.G. (eds) SOFSEM'97: Theory and Practice of Informatics. SOFSEM 1997. Lecture Notes in Computer Science, vol 1338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63774-5_103

Download citation

  • DOI: https://doi.org/10.1007/3-540-63774-5_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63774-5

  • Online ISBN: 978-3-540-69645-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation