Large Deviations for Large Capacity Loss Networks with Fixed Routing and Polyhedral Admission Sets

Discrete Event Dynamic Systems: Theory and Applications

Volumn 7, Issue 4, 1997, Pages 391-418

  Chang, Cheng Shang ^a   Wang, Hung Jen ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Call blocking probability; Cell loss probability; Large deviations; Loss networks

Indexed keywords

COMPUTER SIMULATION; FLOW OF FLUIDS; PROBABILITY; QUEUEING THEORY; TESTING; THEOREM PROVING;

LOSS NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 0031247777     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008270628177     Document Type: Article

References (20)

1. Chang, C.S. 1995. Sample path large deviations and intree networks. Queueing Systems 20: 7-36.
2. Dembo. A., and Zeitouni, O. 1992. Large Deviations Techniques and Applications. Boston: Jones and Barlett Publishers.
3. Deuschel, J.D., and Stroock, D.W. 1989. Large Deviations. Boston: Academic Press.
4. Ellis, R. 1984. Large deviations for a general class of random vectors. Ann. Probab. 12: 1-12.
5. Gärtner, J. 1977. On large deviations from invariant measure. Theory Probab. Appl. 22: 24-39.
6. Gazdzicki, P., Lambadaris, I., and Mazumdar, R.R. 1993. Blocking probabilities for large multirate Erlang loss systems. Adv. Appl. Probab. 25: 997-1009.
7. Hiriart-Urruty, J.-B., and Lemaaréchal, C. 1991. Convex Analysis and Minimization Algorithms II. New York: Springer-Verlag.
8. Hui, J.Y. 1988. Resource allocation for broadband networks. IEEE Select. Areas Commun. 6: 1598-1608.
9. Hunt, P. J. 1989. Implied cost in loss networks. Adv. Appl. Probab. 21: 661-680.
10. Hunt, P.J., and Kelly, F.P. 1989. On critically loaded loss networks. Adv. Appl. Probab. 21: 831-841.
11. Kelly, F.P. 1991. Loss networks. Ann. Appl. Probab. 1: 319-378.
12. 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.
13. Mitra, D., and Morrison, J.A. 1994. Erlang capacity and uniform approximations for shared unbuffered resources. IEEE/ACM Trans. Networking 2: 558-570.
14. Reiman, M.I. 1991. A critically loaded multiclass Erlang loss system. Queueing Systems 9: 65-82.
15. Rockafeller, R.T. 1970. Convex Analysis. Princeton: Princeton University Press.
16. Ross, K.W. 1995. Multiservice Loss Models for Broadband Telecommunication Networks. New York: Springer-Verlag.
17. Whitt, W. 1993. Tail probability with statistical multiplexing and effective bandwidths in multi-class queues. Telecommunication Systems 2: 71-107.
18. Whittle, P. 1990. A risk-sensitive maximum principle. Systems & Control Letters 15: 183-192.
19. Whittle, P. 1991a. A risk-sensitive maximum principle: the case of imperfect state observation. IEEE Trans. Automat. Contr. 36: 793-801.
20. Whittle, P. 1991b. Likelihood and cost as path integrals. J. R. Statist. Soc, B 53: 505-538.