Skip to main content
SpringerLink
Log in

Robust connection acceptance control for ATM networks with incomplete source information

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

Abstract

Consider an ATM resource where the statistics of each bursty traffic source are not precisely known. How should the resource decide when to accept fresh connections? We address this problem for the case where each source behaves as a simple “On-Off” model and only the peak bandwidth is known. A connection acceptance control algorithm is proposed that relies on the choice of a boundary. The performance of this algorithm is analysed using an approximation based on separation of timescales. The slowly changing call process behaves like the queue process at an infinite server queue, where the arrival process to the queue is dictated by the fast moving burst process. A technique for finding a suitable boundary is also given, based on the Bayesian principle. The algorithm, together with the proposed boundary, could be used in a network to control connection acceptance at each resource along a virtual path.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N.G. Bean, Mathematical modelling of packet switched communication networks, J.T. Knight Prize Essay, University of Cambridge, Cambridge, UK (January 1992).

    Google Scholar 

  2. N.G. Bean, Statistical multiplexing in broadband communication networks, Ph.D. Thesis, The Statistical Laboratory, University of Cambridge, 16 Mill Lane, Cambridge, CB2 1SB, UK (June 1993).

  3. D.P. Bertsekas,Dynamic Programming and Stochastic Control, Vol. 125 ofMathematics in Science and Engineering (Academic Press, New York, 1976).

    Google Scholar 

  4. P. Billingsley,Probability and Measure, Wiley Series on Probability and Mathematical Statistics, 2nd ed. (Wiley Interscience, New York, 1986).

    Google Scholar 

  5. P.E. Boyer, F.M. Guillemin, M.J. Servel and J.-P. Coudreuse, Spacing cells protects and enhances utilization of ATM network links, IEEE Network Magazine 6(5) (1992) 38–49.

    Google Scholar 

  6. P.T. Brady, A model for generating on-off speech patterns in two-way conversations, Bell Syst. Tech. J. 48 (1969) 2445–2472.

    Google Scholar 

  7. C. Courcoubetis, G. Kesidis, A. Ridder, J. Walrand and R. Weber, Admission control and routing in ATM networks using inferences from measured buffer occupancy, Memorandum Number UCB/ERL M91/37, University of California, Berkeley (April 1991).

    Google Scholar 

  8. J.N. Daigle and J.D. Langford, Models for analysis of packet voice communications systems, IEEE J. Sel. Areas Commun. SAC-4 (1986) 847–855.

    Article  Google Scholar 

  9. A.I. Elwalid and D. Mitra, Effective bandwidth of general Markovian traffic sources and admission control of high speed networks, IEEE ACM Trans. Networking (1992).

  10. R.J. Gibbens and P.J. Hunt, Effective bandwidths for the multi-type UAS channel, Queueing Syst. 9 (1991) 17–28.

    Article  Google Scholar 

  11. T.R. Griffiths, Analysis of connection acceptance strategies in asynchronous transfer mode networks, in:Proc. 7th UK Teletraffic Symp., Durham (April 1990).

  12. R. Guérin, H. Ahmadi and M. Naghshineh, Equivalent capacity and its application to bandwidth allocation in high-speed networks, IEEE J. Sel. Areas Commun. SAC-9 (1991) 968–981.

    Article  Google Scholar 

  13. H.G. Heuser,Functional Analysis (Wiley, New York, 1982).

    Google Scholar 

  14. J.Y. Hui, Resource allocation for broadband networks, IEEE J. Sel. Areas Commun. SAC-6 (1988) 1598–1608.

    Article  Google Scholar 

  15. R. Johnsonbaugh and W.E. Pfaffenberger,Foundations of Mathematical Analysis, Pure and Applied Mathematics, A series of Monographs and Textbooks, vol. 62 (Marcel Dekker, New York, 1981).

    Google Scholar 

  16. R.E. Kalman, A new approach to linear filtering and prediction problems, Trans. Amer. Soc. Mech. Eng., Series D, J. Basic Eng. 82 (1960) 35–45.

    Google Scholar 

  17. F.P. Kelly, Effective bandwidths at multi-class queues, Queueing Syst. 9 (1991) 5–16.

    Article  Google Scholar 

  18. G. Niestegge, The leaky bucket policing method in ATM networks, Int. J. Digital and Analog Commun. Syst. 3 (1990) 187–197.

    Google Scholar 

  19. J.W. Roberts (ed.),Performance Evaluation and Design of Multiservice Networks. Information Technologies and Sciences, Cost 224, Commission of the European Communities, Luxembourg (1992).

  20. H. Saito and K. Shiomoto, Dynamic call admission control in ATM networks, IEEE J. Sel. Areas Commun. SAC-9 (1991) 982–989.

    Article  Google Scholar 

  21. L. Trajković and S.J. Golestani, Congestion control for multimedia services, IEEE Network Magazine 6(5) (1992) 20–26.

    Article  Google Scholar 

  22. W. Whitt, Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues, Pre-print, AT&T Bell Laboratories, Murray Hill, NJ 07974-0636, USA (August 1992).

Download references

Author information

Authors and Affiliations

  1. Statistical Laboratory, University of Cambridge, 16 Mill Lane, CB2 1SB, Cambridge, UK

    Nigel G. Bean

Authors
  1. Nigel G. Bean
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bean, N.G. Robust connection acceptance control for ATM networks with incomplete source information. Ann Oper Res 48, 357–379 (1994). https://doi.org/10.1007/BF02024521

Download citation

  • Issue Date:

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

Keywords

Search

Navigation