Skip to main content
SpringerLink
Log in

Resource Sharing for Book-Ahead and Instantaneous-Request Calls Using a CLT Approximation

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper extends the admission control algorithm for book-ahead and instantaneous-request calls proposed by Greenberg, Srikant and Whitt (1997) to cover multiple classes of instantaneous-request calls, each with their own traffic characteristics and their own performance requirements. As before, book-ahead calls specify their starting and finishing times, and are assumed to book far ahead relative to the holding times of the instantaneous-request calls. The book-ahead calls may be constrained by an upper-limit on the capacity that can be reserved for them. Instantaneous-request calls are admitted if the probability of interruption (or some other form of service degradation in response to the conflict) for that call is below a threshold, but now this threshold can be class-dependent, and now the interrupt probability is calculated by a normal approximation based on the central limit theorem. Simulation experiments show that the normal approximation performs as well as the previous detailed calculation in single-class examples, and that the normal approximation can be applied to multi-class examples.

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. Bean, R.J. Gibbens and S. Zachary, The performance of single resource loss systems in multiservice networks, in: Proc. of the 14th Internat. Teletraffic Congress, 1994.

  2. N. Bean, R.J. Gibbens and S. Zachary, Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks, Advances in Applied Probability 27 (1995) 273-292.

    Google Scholar 

  3. J.A. Bucklew, Large Deviation Techniques in Decision, Simulation, and Estimation (Wiley, New York, 1990).

    Google Scholar 

  4. G.L. Choudhury, K.K. Leung and W. Whitt, An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates, IEEE/ACM Transactions on Networking 3 (1995) 585-601.

    Google Scholar 

  5. G.L. Choudhury, K.K. Leung and W. Whitt, Efficiently providing multiple grades of service with protection against overloads in shared resources, AT&T Technical Journal 74 (1995) 50-63.

    Google Scholar 

  6. E.G. Coffman, Jr., P. Jelenkovic and B. Poonen, Reservation probabilities, Advances in Performance Analysis 2 (1999) 129-158.

    Google Scholar 

  7. N.G. Duffield and W. Whitt, Control and recovery from rare congestion events in a large multi-server system, Queueing Systems 26 (1997) 69-104.

    Google Scholar 

  8. N.G. Duffield and W. Whitt, A source traffic model and its transient analysis for network control, Stochastic Models 14 (1998) 51-78.

    Google Scholar 

  9. W. Feller, An Introduction to Probability Theory and its Applications, Vol. I, 3rd ed. (Wiley, New York, 1968).

    Google Scholar 

  10. W. Feller, An Introduction to Probability Theory and its Applications, Vol. II, 2nd ed. (Wiley, New York, 1971).

    Google Scholar 

  11. A. Gersht and K.J. Lee, A bandwidth management strategy in ATM networks, Preprint, GTE Laboratories (1990).

  12. A.G. Greenberg and R. Srikant, Computational techniques for accurate performance evaluation of multirate, multihop communication networks, IEEE/ACMTransactions on Networking 5 (1997) 266-277.

    Google Scholar 

  13. A.G. Greenberg, R. Srikant and W. Whitt, Resource sharing for book-ahead and instantaneous-request calls, IEEE/ACM Transactions on Networking 7 (1999) 10-22.

    Google Scholar 

  14. J.S. Kaufman, Blocking in a shared resource environment, IEEE Transactions on Communications 29 (1981) 1474-1481.

    Google Scholar 

  15. M.R. Leadbetter, G. Lindgren and H. Rootzén, Extremes and Related Properties of Random Sequences and Processes (Springer, New York, 1983).

    Google Scholar 

  16. J.W. Roberts, A service system with heterogeneous user requirements, in: Performance of Data Communication Systems and Their Applications, ed. G. Pujolle (North-Holland, Amsterdam, 1981) pp. 423-431.

    Google Scholar 

  17. A. Shwartz and A. Weiss, Large Deviations for Performance Analysis (Chapman and Hall, London, 1995).

    Google Scholar 

  18. D. Wischik and A. Greenberg, Admission control for booking ahead shared resources, in: Proc. of IEEE Infocom '98, San Francisco, CA, April 1998.

Download references

Author information

Authors and Affiliations

  1. Coordinated Science Laboratory and the Department of General Engineering, University of Illinois, 1308 W. Main Street, Urbana, IL, 61801, USA

    R. Srikant

  2. AT&T Labs, Room A117, Shannon Laboratory, 180 Park Avenue, Florham Park, NJ, 07932-0971, USA

    Ward Whitt

Authors
  1. R. Srikant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ward Whitt
    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

Srikant, R., Whitt, W. Resource Sharing for Book-Ahead and Instantaneous-Request Calls Using a CLT Approximation. Telecommunication Systems 16, 233–253 (2001). https://doi.org/10.1023/A:1016650524348

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016650524348

Search

Navigation