Skip to main content
Log in

Bandwidth allocation in ATM networks

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In an ATM network, bandwidth is allocated at different levels and in different stages. At the physical level, the ATM topology can be dynamically reconfigured by adding/removing truns between ATM switches. This allocation of bandwidth is made possible by the SONET Synchronous Transfer Mode (STM) infrastructure equipped with Digital Cross Connect Systems (DCSs). We will refer to this allocation asSTM allocation. At the ATM level, we can allocate bandwidth to individual Virtual Circuits (ATM-VC allocation) as well as to Virtual Paths (ATM-VP allocation). For example, in order to implement the Connectionless Network Access layer functions we find it convenient to organize the Virtual Paths in a Connectionless Overlay Network. This introduces another type of bandwidth allocation (CLS allocation). In this paper, we address and formulate the above bandwidth allocation problems, and propose efficient techniques for their solution. We illustrate these techniques with examples based on STM and CLS allocation, respectively.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.L. Adams, The virtual path identifier and its applications for routing and priority of connectionless and connection oriented services, Int. J. Digital and Analog Cabled Syst. 1 (1988) 257–262.

    Google Scholar 

  2. G. Boiocchi, P. Crocetti, L. Fratta, M. Gerla and M.A. Marsiglia, ATM connectionless server: Performance evaluation, in:Proc. IFIP '93, La Martinica, France (January 1993).

  3. A. Biocca, G. Freschi, A. Forcina and R. Melen, Architectural issues in the interoperability between MANs and the ATM network, in:Proc. 13th Int. Switching Symp., Stockholm (May 1990).

  4. Bertsekas and R. Gallager,Computer Communications Networks (Prentice-Hall, 1989).

  5. M.S. Bazaraa and C.M. Shetty,Nonlinear Programming Theory and Algorithms (Wiley, New York, 1979) pp. 257–259.

    Google Scholar 

  6. P. Crocetti, L. Fratta, M. Gerla, M.A. Marsiglia and D. Romanò, Connectionless support service in ATM, in: Proc. ICCC '92, Genova, Italy (1992) pp. 191–196.

  7. M. Gerla and L. Kleinrock, On topological design of distributed computer networks, IEEE Trans. Comm. COM-25 (1977) 48–60.

    Google Scholar 

  8. M. Gerla and Y.D. Lin, Network management using database discovery tools, in:Proc. 16th Conf. on Local Computer Networks, Minneapolis (October 1991).

  9. M. Gerla, J.A.S. Monteiro and R. Pazos, Topology design and bandwidth allocation in ATM nets, IEEE J. Sel. Areas Comm. SAC-7 (1989) 1253–1262.

    Google Scholar 

  10. M. Gerla, T.-Y. Tai, J. Monteiro and G. Gallassi, Interconnecting LANs and MANs to ATM, in:Proc. 16th Conf. on Local Computer Networks, Minneapolis (October 1991) pp. 259–270.

  11. J.Y. Hui, M.B. Gürsoy, N. Moayeri and R.D. Yates, A layered broadband switching architecture with physical or virtual path configurations, IEEE J. Sel. Areas Comm. SAC-9 (1991) 1416–1426.

    Google Scholar 

  12. C. Kang and H.H. Tan, Combined channel allocation and routing algorithms, in:Proc. Globecom '91, Phoenix, AZ (December 1991) pp. 1690–1695.

  13. T. Van Landegem and R. Peschi, Managing a connectionless virtual overlay network on top of ATM, in:Proc. ICC '91, Denver, USA (June 1991).

  14. M.-J. Lee and J.R. Yee, An efficient near-optimal algorithm for the joint traffic and trunk routing problem in self-planning networks, in:Proc. IEEE INFOCOM '89, Ottawa, Ont., Canada (April 1989) pp. 127–135.

  15. B. Martos,Nonlinear Programming Theory and Methods (North-Holland, Amsterdam/Oxford, 1975) pp. 238–248.

    Google Scholar 

  16. J.A.S. Monteiro and M. Gerla, Topological reconfiguration of ATM networks, in:Proc. INFOCOM '90, San Francisco, CA (June 1990) pp. 207–214.

  17. K. Murty,Linear and Combinatorial Programming (Wiley, New York, 1976) pp. 187–189.

    Google Scholar 

  18. M.J. Ng and D.B. Hoang, Joint optimization of capacity and flow assignment in a packet-switched communications network, IEEE Trans. Comm. COM-35 (1987) 202–209.

    Google Scholar 

  19. R.O. Onvural and Y.C. Liu, On the amount of bandwidth allocated to virtual paths in ATM networks, in:Proc. GLOBECOM '92, Orlando, USA (December 1992), pp. 1460–1464.

  20. A. Pattavina, Multichannel bandwidth allocation in a broadband packet switch, IEEE J. Sel. Areas Comm. SAC-6 (1988) 1489–1499.

    Google Scholar 

  21. R.A. Pazos-Rangel and M. Gerla, Express pipe networks, in:Global Telecommunications Conf., Miami, FL (December 1982) pp. B2.3.1.–5.

  22. H. Pan and I.Y. Wang, The bandwidth allocation of ATM through genetic algorithm, in:Proc. Globecom '91, Phoenix, AZ (December 1991) pp. 125–129.

  23. E. Tirttaatmadja and R.A. Palmer, The application of virtual paths to the interconnection of IEEE 802.6 metropolitan area networks, in:Proc. 13th Int. Switching Symp., Stockholm (May 1990).

  24. S.M. Walters and M. Ahmed, Broadband virtual private networks and their evolution, in:Proc. 14th Int. Switching Symp., Yokohama, Japan (October 1992) pp. 86–90.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was jointly supported by the Brazilian National Science Council (CNPq) and NSF.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Monteiro, J.A.S., Gerla, M. Bandwidth allocation in ATM networks. Ann Oper Res 49, 25–50 (1994). https://doi.org/10.1007/BF02031590

Download citation

  • Issue Date:

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

Keywords

Navigation