Skip to main content
Springer Nature Link
Log in

A critically loaded multirate link with trunk reservation

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider a loss system model of interest in telecommunications. There is a single service facility with N servers and no waiting room. There are K types of customers, with type ί customers requiring A ί servers simultaneously. Arrival processes are Poisson and service times are exponential. An arriving type ί customer is accepted only if there are Rί(⩾Aί ) idle servers. We examine the asymptotic behavior of the above system in the regime known as critical loading where both N and the offered load are large and almost equal. We also assume that R 1,..., R K-1 remain bounded, while R NK ←∞ and R NK /√N ← 0 as N ← ∞. Our main result is that the K dimensional “queue length” process converges, under the appropriate normalization, to a particular K dimensional diffusion. We show that a related system with preemption has the same limit process. For the associated optimization problem where accepted customers pay, we show that our trunk reservation policy is asymptotically optimal when the parameters satisfy a certain relation.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.M. Akinpelu, The overload performance of engineered networks with nonhierarchical and hierarchical routing, AT&T Tech. J. 63 (1984) 1261-1281.

    Google Scholar 

  2. N.G. Bean, R.J. Gibbens and S. Zachary, The performance of single resource loss systems in multi-service networks, in: The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks, eds. J. Labetoulle and J.W. Roberts (Elsevier, Amsterdam, 1994).

    Google Scholar 

  3. N.G. Bean, R.J. Gibbens and S. Zachary, Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks, Adv. in Appl. Probab. 27 (1995) 273-292.

    Article  Google Scholar 

  4. P. Billingsley, Convergence of Probability Measures (Wiley, New York, 1968).

    Google Scholar 

  5. P. Bremaud, Point Processes and Queues: Martingale Dynamics (Springer, Berlin, 1980).

    Google Scholar 

  6. E.G. Coffman, Jr., A.A. Pukhalskii and M.I. Reiman, Storage limited queues in heavy traffic, Probab. Engrg. Inform. Sci. 5 (1991) 499-522.

    Google Scholar 

  7. P.J. Hunt and F.P. Kelly, On critically loaded loss networks, Adv. in Appl. Probab. 21 (1989) 831-841.

    Article  Google Scholar 

  8. P.J. Hunt and C.N. Laws, Optimization via trunk reservation in single resource loss systems under heavy traffic, Ann. Appl. Probab. 7 (1997) 1058-1079.

    Article  Google Scholar 

  9. J. Jacod and A.N. Shiryaev, Limit Theorems for Stochastic Processes (Springer, Berlin, 1987).

    Google Scholar 

  10. D.L. Jagerman, Some properties of the Erlang loss function, Bell System Tech. J. 53 (1974) 525-551.

    Google Scholar 

  11. F.P. Kelly, Blocking probabilities in large circuit-switched networks, Adv. in Appl. Probab. 18 (1986) 473-505.

    Article  Google Scholar 

  12. F.P. Kelly, Routing and capacity allocation in networks with trunk reservation, Math. Oper. Res. 15 (1990) 771-793.

    Google Scholar 

  13. F.P. Kelly, Loss networks, Ann. Appl. Probab. 1 (1991) 319-378.

    Google Scholar 

  14. P. Key, Optimal control and trunk reservation in loss networks, Probab. Engin. Inform. Sci. 4 (1990) 203-242.

    Article  Google Scholar 

  15. R.Sh. Liptser and A.N. Shiryaev, Theory of Martingales (Kluwer, Dordrecht, 1989).

    Google Scholar 

  16. B.L. Miller, A queueing reward system with several customer classes, Manag. Sci. 16 (1969) 234-245.

    Article  Google Scholar 

  17. M.I. Reiman, Asymptotically optimal trunk reservation for large trunk groups, in: Proceedings of the 28th IEEE CDC (1989) pp. 2536-2541.

  18. M.I. Reiman, A critically loaded multiclass Erlang loss system, Queueing Systems, 9 (1991) 65-82.

    Article  Google Scholar 

  19. M.I. Reiman, Optimal trunk reservation for a critically loaded link, in: Teletraffic and Datatraffic in a Period of Change, eds. A. Jensen and V.B. Iversen (North-Holland, Amsterdam, 1991).

    Google Scholar 

  20. K.W. Ross, Multiservice Loss Models for Broadband Telecommunication Networks (Springer, Berlin, 1995).

    Google Scholar 

  21. K.W. Ross and D. Tsang, Optimal circuit access policies in an ISDN environment: a Markov decision approach, IEEE Trans. Commun. (1989) 934-939.

  22. T.S. Zhang, On the strong solutions of one-dimensional stochastic differential equations with reflecting boundary, Stoch. Process. Appl. 50 (1994) 135-147.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Problems in Information Transmission, 101447, Moscow, Russia

    A.A. Puhalskii

  2. Lucent Technologies, Bell Laboratories, Murray Hill, 07974, USA

    M.I. Reiman

Authors
  1. A.A. Puhalskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M.I. Reiman
    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

Puhalskii, A., Reiman, M. A critically loaded multirate link with trunk reservation. Queueing Systems 28, 157–190 (1998). https://doi.org/10.1023/A:1019151106992

Download citation

  • Issue Date:

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