Skip to main content

Scalability enhancements for connection-oriented networks

  • Conference paper
  • First Online:
Broadband Communications Networks, Services, Applications, Future Directions (IZS 1996)

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

Included in the following conference series:

Abstract

We consider the issue of increasing the number of connections that connection oriented networks, such as ATM, can handle. We describe one step that aims at reducing connection awareness inside the network. To that end, connections between the same pair of access nodes are grouped together and made indistinguishable inside the network. The concept of dynamic virtual path trunks is introduced as a support mechanism, and it is shown how virtual path links can be setup and maintained without additional round-trip delays.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-Y. Le Boudec, “The Asynchronous Transfer Mode: A Tutorial,” Computer Networks and ISDN Systems, vol. 24 (4), pp. 279–309, May 1992.

    Article  Google Scholar 

  2. M. Peters, “Advanced Peer-to-Peer Networking: Intermediate Session Routing vs. High Performance Routing,” IEEE Systems Journal, 1993.

    Google Scholar 

  3. W. Stallings, ISDN, An Introduction. Macmillan Publishing Company, ISBN 0-02-415471-7, 1989.

    Google Scholar 

  4. R. Perlmann, Interconnections. Addison-Wesley, ISBN 0-201-56332-0, 1993.

    Google Scholar 

  5. C. Topolcic, Experimental Internet Stream Protocol, Version 2, (ST-II). IETF, 1990.

    Google Scholar 

  6. L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zapalla, “RSVP: A New Resource ReSerVation Protocol,” IEEE Network, September 1993.

    Google Scholar 

  7. L. Gün and R. Guérin, “Bandwidth Management and Congestion Control framework of the Broadband Network architecture,” Computer Networks and ISDN Systems, vol. 26 (1), pp. 61–78, 1993.

    Article  Google Scholar 

  8. J.-Y. Le Boudec and T. Przygienda, “A Route Pre-computation Algorithm for Integrated Services Networks,” Technical Report 95/113, DI-EPFL, CH-1015 Lausanne, Switzerland, February 1995.

    Google Scholar 

  9. O. Crochat, J.-Y. Le Boudec, and T. Przygienda, “Path Selection in ATM using Route Pre-Computation,” Technical Report 95/128, DI-EPFL, CH-1015 Lausanne, Switzerland, May 1995.

    Google Scholar 

  10. D. Tennenhouse, “Layered Multiplexing Considered Harmful,” in Protocols for High-Speed Networks (H. Rudin and R. Williamson, eds.), pp. 143–148, IFIP, North-Holland, 1989.

    Google Scholar 

  11. J.-Y. Le Boudec, E. Port, and L. Truong, “Flight of the FALCON,” IEEE Comm Mag, pp. 50–56, February 1993.

    Google Scholar 

  12. J.-Y. Le Boudec and T. Przygienda, “Routing Metric for Connections with Reserved Bandwidth,” EFOC-N, 1994.

    Google Scholar 

  13. P. Boyer and D. Tranchier, “A Reservation Principle with Applications to the ATM Traffic Control,” Computer Networks and ISDN Systems, vol. 24, pp. 321–334, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bernhard Plattner

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gauthier, E., Le Boudec, J.Y. (1996). Scalability enhancements for connection-oriented networks. In: Plattner, B. (eds) Broadband Communications Networks, Services, Applications, Future Directions. IZS 1996. Lecture Notes in Computer Science, vol 1044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022215

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49669-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics