Abstract
In this paper, we study large deviations of large capacity loss networks with fixed routing. We use two-level modelling for the loss networks: the call level and the cell level. At the call level, a call request is accepted if it succeeds an admission test. The test is based on a polyhedral set of the number of calls in progress when a new call arrives. After being accepted, a call then transmits a sequence of cells (random variables) during its holding period. We show that the fluid limits and the conditional central limit theorems in Kelly (1991) can be extended to the large deviation regime. Moreover, there are corresponding fluid flow explanations for our large deviation results. In particular, we derive the exponential decay rates of the call blocking probability and the cell loss probability. These decay rates are obtained by solving primal and dual convex programming problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chang, C.S. 1995. Sample path large deviations and intree networks. Queueing Systems 20: 7–36.
Dembo, A., and Zeitouni, O. 1992. Large Deviations Techniques and Applications. Boston: Jones and Barlett Publishers.
Deuschel, J.D., and Stroock, D.W. 1989. Large Deviations. Boston: Academic Press.
Ellis, R. 1984. Large deviations for a general class of random vectors. Ann. Probab. 12: 1–12.
Gärtner, J. 1977. On large deviations from invariant measure. Theory Probab. Appl. 22: 24–39.
Gazdzicki, P., Lambadaris, I., and Mazumdar, R.R. 1993. Blocking probabilities for large multirate Erlang loss systems. Adv. Appl. Probab. 25: 997–1009.
Hiriart-Urruty, J.-B., and Lemaaréchal, C. 1991. Convex Analysis and Minimization Algorithms II. New York: Springer-Verlag.
Hui, J.Y. 1988. Resource allocation for broadband networks. IEEE Select. Areas Commun. 6: 1598–1608.
Hunt, P.J. 1989. Implied cost in loss networks. Adv. Appl. Probab. 21: 661–680.
Hunt, P.J., and Kelly, F.P. 1989. On critically loaded loss networks. Adv. Appl. Probab. 21: 831–841.
Kelly, F.P. 1991. Loss networks. Ann. Appl. Probab. 1: 319–378.
Labourdette, J.-F.P., and Hart, G.W. 1992. Blocking probabilities in multitraffic loss systems: insenstivity, asymptotic behavior and approximations. IEEE Trans. on Commum. 40: 1355–1366.
Mitra, D., and Morrison, J.A. 1994. Erlang capacity and uniform approximations for shared unbuffered resources. IEEE/ACM Trans. Networking 2: 558–570.
Reiman, M.I. 1991. A critically loaded multiclass Erlang loss system. Queueing Systems 9: 65–82.
Rockafeller, R.T. 1970. Convex Analysis. Princeton: Princeton University Press.
Ross, K.W. 1995. Multiservice Loss Models for Broadband Telecommunication Networks. New York: Springer-Verlag.
Whitt, W. 1993. Tail probability with statistical multiplexing and effective bandwidths in multi-class queues. Telecommunication Systems 2: 71–107.
Whittle, P. 1990. A risk-sensitive maximum principle. Systems & Control Letters 15: 183–192.
Whittle, P. 1991a. A risk-sensitive maximum principle: the case of imperfect state observation. IEEE Trans. Automat. Contr. 36: 793–801.
Whittle, P. 1991b. Likelihood and cost as path integrals. J. R. Statist. Soc, B 53: 505–538.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chang, CS., Wang, HJ. Large Deviations for Large Capacity Loss Networks with Fixed Routing and Polyhedral Admission Sets. Discrete Event Dynamic Systems 7, 391–418 (1997). https://doi.org/10.1023/A:1008270628177
Issue Date:
DOI: https://doi.org/10.1023/A:1008270628177