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 373–382Cite as

Lower bounds for the virtual path layout problem in ATM networks

  • Contributed Papers
  • Conference paper
  • First Online:

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

Abstract

In this paper we deal with the problem of designing virtual path layouts in ATM networks with given hop-count and minimum load, for which we prove a lower bound with respect to networks with arbitrary topology. The result is then applied to derive a tight lower bound for the one-to-many communication pattern in networks with arbitrary topology, and for the many-to-many communication pattern in planar graphs and graphs with bounded treewidth.

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. McDysan, D.E., Spohn, D.L.: ATM: Theory and Applications. McGraw-Hill, New York, NY (1995)

    Google Scholar 

  2. de Prycker, M.: Asynchronous Transfer Mode: Solutions for Broadband ISDN. Ellis-Horwood, New York, NY (1993)

    Google Scholar 

  3. ATM Forum: ATM, User-Network Interface Specification. Version 3.0. Prentice-Hall (1993)

    Google Scholar 

  4. Eilam, T., Flammini, M., Zaks, S.: A Complete Characterization of the Path Layout Construction Problem for ATM Networks with given Hop Count and Load. Proc. of the 24th International Colloquium on Algorithms, Languages and Programming-ICALP 97, to appear (1997)

    Google Scholar 

  5. Gerste, O., Zaks, S.: The Virtual Path Layout Problem in Fast Networks. Proc. of the 13th ACM Conf. on Principles of Distributed Computing (1994) 235–243

    Google Scholar 

  6. Dahl, G., Martin, A., Stoer, M.: Routing through Virtual Paths in Layered Telecommunication Networks. Tech. Rep. No. N-0316, University of Oslo, Blindern, Oslo, Norway (1996)

    Google Scholar 

  7. Chlamtac, L, Farago, A., Zhang, T.: Optimizing the System of Virtual Paths. IEEE Transactions on Networking (1994)

    Google Scholar 

  8. Lougher, P., Sheperd, D.: On the Complexity of the Disjoint-Paths Problem. Combinatorica 13 (1993)

    Google Scholar 

  9. Ramanathan, S., Rangan, P.V.: Feedback Techniques for Intea-Media Continuity and Inter-Media Synchronization in Distributed Multimedia Systems. The Computer Journal 36 (1) (1993)

    Google Scholar 

  10. Cidon, I., Gerstel, O., Zaks, S.: The Layout of Virtual Paths in ATM Networks. Tech. Rep. No. CS0831, Technion-Haifa, Israel (1994)

    Google Scholar 

  11. Cidon, I., Gerstel, O., Zaks, S.: A Scalable Approach to Routing in ATM Networks. Proc. of the 8th International Workshop on Distributed Algorithms (LNCS No. 857) (1994)

    Google Scholar 

  12. Gerstel, O.: Virtual Path Design in ATM Networks. PhD thesis, Technion-Haifa, Israel (1995)

    Google Scholar 

  13. Gerstel, O., Wool, A., Zaks, S.: Optimal Layouts on a Chain ATM Network. Proc. of the 3rd Annual European Symposium on Algorithms (1995)

    Google Scholar 

  14. Gasienic, L., Kranakis, E., Krizanc, D., Pelc, A.: Minimizing Congestion of Layouts for ATM Networks with Faulty Links. Tech. Rep., Carleton University, School of Computer Science, Ottawa, Canada (1995)

    Google Scholar 

  15. Kranakis, E., Krizanc, D., Pelc, A.: Hop-Congestion Tradeoffs for ATM Networks. Tech. Rep., Carleton University, School of Computer Science, Ottawa, Canada (1995)

    Google Scholar 

  16. Flammini, M., Nardelli, E., Proietti, G.: ATM Layouts with Bounded Hop Count and Congestion. Proc. of the 11th Workshop on Distributes Algorithms-WDAG 97, to appear (1997)

    Google Scholar 

  17. Gerstel, O., Cidon, I., Zaks, S.: Efficient Support for the Client-Server Paradigm over ATM Networks. Proc. of the IEEE Infocom Conference (1996) 1294–1301

    Google Scholar 

  18. Korte, B., Lovász, L., Prömel, H.J., Schrijver, A. Editors: Paths, Flows and VLSI-Layout. Springer-Verlag (1990)

    Google Scholar 

  19. Bodlaender, H.: A Partial k-Arboretum of Graphs with bounded Tree-Width. Tech. Rep. No. UU-CS-1996-02, Department of Computer Science, University of Utrecht, The Netherland (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, 00185, Roma, Italy

    Luca Becchetti

  2. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, 00184, Rome, Italy

    Luca Becchetti

  3. Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, 00185, Roma, Italy

    Carlo Gaibisso

Authors
  1. Luca Becchetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlo Gaibisso
    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

Becchetti, L., Gaibisso, C. (1997). Lower bounds for the virtual path layout problem 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_116

Download citation

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

  • 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