Skip to main content
Log in

Performance analysis of virtual circuit connections for bursty data sources in ATM networks

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

Abstract

ATM is a packet-like transmission mode that has been proposed for BISDN. It is characterized by an asynchronous slotted transmission mechanism that provides a high bandwidth, low delay connection-oriented transport service to the end user. In this paper, we provide an analytical approach for determining the performance of a virtual circuit connection for data transmission in a high-speed ATM network with finite buffers at the network nodes. The analysis assumes that the network operates using thebest effort delivery strategy and that the end-to-end virtual circuit is responsible for guaranteeing the integrity of the connection. Since the normal Markovian assumptions do not apply, a concise exact solution is impossible to obtain. This provides motivation for developing approximate techniques such as those found in Whitt's QNA paper that allow us to use general distributions for the traffic streams and service times. However, even these techniques assume infinite buffer capacities and hence cannot model buffer overflow. We have therefore developed a hybrid model that allows us to incorporate finite buffers at the nodes. This enables us to study the effect on the performance of both link errors and buffer overflow in conjunction with an end-to-end packet loss recovery scheme.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. A. Bhargava et al., Performance comparison of error control schemes in high-speed computer communication networks, IEEE Sel. Areas Commun. SAC-6(1988)1565–1575.

    Google Scholar 

  2. P.J. Kuehn, Approximate analysis of general queueing networks by decomposition, IEEE Trans. Commun. COM-26(1979)113–125.

    Google Scholar 

  3. S. Minzer, Broadband ISDN and Asynchronous Transfer Mode (ATM), IEEE Commun. Mag. (September 1989)17–24.

  4. P. Tran-Gia and H. Ahmadi, Analysis of a discrete time queueing system with batch arrivals and its applications in packet switching systems, in:Proc. IEEE INFOCOM, New Orleans, LA (1988).

  5. W. Whitt, Approximating a point process by a renewal process, I: Two basic methods, Oper. Res. 30(1980)125–147.

    Google Scholar 

  6. W. Whitt, The Queueing Network Analyzer, Bell Syst. Tech. J. 62(1983)2779–2815.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported in part by a grant from AT&T and in part by NSF under Grant No. 8914447.

Work done while at the University of Pennsylvania, Philadelphia, PA 19104, USA

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shroff, N., El Zarki, M. Performance analysis of virtual circuit connections for bursty data sources in ATM networks. Ann Oper Res 35, 297–323 (1992). https://doi.org/10.1007/BF02024995

Download citation

  • Issue Date:

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

Keywords