Advertisement

Scalability enhancements for connection-oriented networks

  • E. Gauthier
  • J. -Y. Le Boudec
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1044)

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.

Keywords

connection awareness multiplexed signaling bandwidth renegotiation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.-Y. Le Boudec, “The Asynchronous Transfer Mode: A Tutorial,” Computer Networks and ISDN Systems, vol. 24 (4), pp. 279–309, May 1992.CrossRefGoogle Scholar
  2. 2.
    M. Peters, “Advanced Peer-to-Peer Networking: Intermediate Session Routing vs. High Performance Routing,” IEEE Systems Journal, 1993.Google Scholar
  3. 3.
    W. Stallings, ISDN, An Introduction. Macmillan Publishing Company, ISBN 0-02-415471-7, 1989.Google Scholar
  4. 4.
    R. Perlmann, Interconnections. Addison-Wesley, ISBN 0-201-56332-0, 1993.Google Scholar
  5. 5.
    C. Topolcic, Experimental Internet Stream Protocol, Version 2, (ST-II). IETF, 1990.Google Scholar
  6. 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. 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.CrossRefGoogle Scholar
  8. 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. 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. 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. 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. 12.
    J.-Y. Le Boudec and T. Przygienda, “Routing Metric for Connections with Reserved Bandwidth,” EFOC-N, 1994.Google Scholar
  13. 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.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • E. Gauthier
    • 1
  • J. -Y. Le Boudec
    • 1
  1. 1.LRC EPFLLausanne

Personalised recommendations