Admission control schemes to provide class-level QoS in multiservice networks

Computer Networks

Volumn 35, Issue 2-3, 2001, Pages 307-326

  Kalyanasundaram, Suresh ^a   Chong, Edwin K P ^b   Shroff, Ness B ^b  

^a MOTOROLA INC   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Call admission control; Class level QoS; Constrained Markov decision process; Linear program; Quality of service

Indexed keywords

EID: 0000324192     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(00)00173-0     Document Type: Article

References (27)

1. J. Liebeherr, Multimedia networks: issues and challenges, Computer 28 (4) (1995) 68-69.
2. D. Mitra, J.A. Morrison, K.G. Ramakrishnan, ATM network design and optimization: a multirate loss network framework, IEEE/ACM Transactions on Networking 4 (4) (1996) 531-543, also available from http://cm.bell-labs.com/cm/ms/who/mitra/ pub.html.
3. C.-S. Chang, J.A. Thomas, Effective bandwidth in high speed digital networks, IEEE Journal on Selected Areas in Communications 13 (1995) 1091-1100.
4. G. Kesidis, J. Walrand, C.-S. Chang, Effective bandwidths for multiclass Markov fluids and other ATM sources, IEEE Transactions on Networking 1 (4) (1993) 424-428.
5. E.W. Knightly, N.B. Shroff, Admission control for statistical QoS: theory and practice, IEEE Network 13 (2) (1999) 20-29, also available from http://www.ece.rice.edu/networks/publications.html.
6. G. de Veciana, C. Courcoubetis, J. Walrand, Decoupling bandwidths: a decomposition approach to resource management in networks, in: Proceedings of the IEEE INFOCOM '94, vol. 2, Toronto, Canada, 1994, pp. 446-474, also available from http:// walrandpc.eecs.berkeley.edu/Pubs.html.
7. J.S. Kaufman, Blocking in a shared resource environment, IEEE Transactions on Communications 29 (10) (1981) 1474-1481.
8. D. Mitra, M.I. Rieman, J. Wang, Robust dynamic admission control for unified cell and call QoS in statistical multiplexers, IEEE Journal on Selected Areas in Communications 16 (5) (1998) 692-707, also available from http://cm.bell-labs.com/cm/ms/who/ mitra/pub.html.
9. S.C. Borst, D. Mitra, Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic, IEEE Journal on Selected Areas in Communications 16 (5) (1998) 668-678.
10. B. Kraimeche, M. Schwartz, Circuit access control strategies in integrated digital networks, in: Proceedings of the IEEE INFOCOM '84, San Francisco, CA, 1984, pp. 230-235.
11. J.-F.P. Labourdette, G.W. Hart, Blocking probabilities in multitraffic loss systems: insensitivity, asymptotic behavior, and approximations, IEEE Transactions on Communications 40 (8) (1992) 1355-1366.
12. J.M. Hyman, A.A. Lazar, G. Pacifici, A separation principle between scheduling and admission control for broadband switching, IEEE Journal on Selected Areas in Communications 11 (4) (1993) 605-616.
13. Z. Dziong, L.G. Mason, Fair-efficient call admission control policies for broadband networks - a game theoretic framework, IEEE/ACM Transactions on Networking 4 (1) (1996) 123-136.
14. R.J. Gibbens, F.P. Kelly, Resource pricing and the evolution of congestion control, Automatica 35 (12) (1999) 1969-1985, also available from http://www.statslab.cam.ac.uk/∼frank/PAPERS.
15. S.M. Ross, Applied Probability Models with Optimization Applications, Holden-Day, San Francisco, CA, 1970.
16. K.W. Ross, Randomized and past-dependent policies for Markov decision processes with multiple constraints, Operations Research 37 (3) (1989) 474-477.
17. S.M. Ross, Introduction to Stochastic Dynamic Programming, Academic Press, New York, 1983.
18. C. Derman, Finite State Markovian Decision Processes, Academic Press, New York, 1970.
19. H. Mine, S. Osaki, Markovian Decision Processes, Elsevier, Amsterdam, 1970.
20. M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley, New York, 1994.
21. R. Givan, S. Leach, T. Dean, Bounded parameter Markov decision processes, in: Proceedings of the Fourth European Conference on Planning, 1997, pp. 234-246, also available from http://dynamo.ecn.purdue.edu/∼givan.
22. J.K. Satia, R.E. Lave Jr., Markovian decision processes with uncertain transition probabilities, Operations Research 21 (1973) 728-740.
23. S. Kalyanasundaram, E.K.P. Chong, N.B. Shroff, Markov decision processes with uncertain transition rates: sensitivity and robustness, Tech. Rep., Purdue University, 1999.
24. Y. Fang, I. Chlamtac, Y.-B. Lin, Modeling PCS networks under general call holding time and residence time distributions, IEEE/ACM Transactions on Networking 5 (6) (1997) 893-905.
25. A. Pfening, M. Telek, Optimal control of Markov regenerative processes, in: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, vol. 1, 1998, pp. 663-668.
26. T. Dean, R. Givan, S. Leach, Model reduction techniques for computing approximately optimal solutions for Markov decision processes, in: Proceedings of the Uncertainty in AI, 1997, also available from http://dynamo.ecn.purdue.edu/∼givan.
27. T. Dean, R. Givan, Model minimization in Markov decision processes, in: Proceedings of the National Conference on Artificial Intelligence, 1997, pp. 106-111, also available from http://dynamo.ecn.purdue.edu/∼givan.