Optimization of call admission control for a statistical multiplexer allocating link bandwidth

IEEE Transactions on Automatic Control

Volumn 48, Issue 10, 2003, Pages 1830-1836

  Spitler, Stephen L ^a   Lee, Daniel C ^a  

^a University of Southern California ^*  (United States)

Author keywords

Call admission control (CAC); Capacity planning; Complementary slackness condition; Linear programming; Markov decision process (MDP); Randomized stationary policy

Indexed keywords

BANDWIDTH; LINEAR PROGRAMMING; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; QUALITY OF SERVICE; STATISTICAL METHODS;

CALL ADMISSION CONTROL; CALL BLOCKING PROBABILITY; STATISTICAL MULTIPLEXER;

CONTROL SYSTEM SYNTHESIS;

EID: 0242365499     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2003.817929     Document Type: Article

References (23)

1. H. G. Perros and K. M. Elsayed, "Call admission control schemes: a review," IEEE Commun. Mag., vol. 34, pp. 82-91, Nov. 1996.
2. D. Mitra, M. I. Reiman, and J. Wang, "Robust dynamic admission control for unified cell and call QoS," IEEE J. Select. Areas Commun., vol. 16, pp. 692-707, June 1998.
3. M. Reiman and A. Shwartz, "Call admission: a new approach to quality of service," Queueing Syst., vol. 38, pp. 125-148, 2001.
4. R. Ramjee, R. Nagarajan, and D. Towsley, "On optimal call admission control in cellular networks," ACM/Baltzer J. Wireless Networks, vol. 3, no. 1, pp. 29-41, 1997.
5. E. Altman, T. Jimenez, and G. Koole, "On optimal call admission control in resource-sharing system," IEEE Trans. Commun., vol. 49, pp. 1659-1668, Sept. 2001.
6. K. W. Ross and D. Tsang, "The stochastic knapsack problem," IEEE Trans. Commun., vol. 37, pp. 740-747, July 1989.
7. A. Papoulis, Probability, Random Variables, and Stochastic Processes. New York: McGraw-Hill, 1991.
8. R. W. Wolff, "Poisson arrivals see time averages," Oper. Res., vol. 30, no. 2, pp. 223-231, 1982.
9. E. A. Feinberg, "Constrained semi-Markov decision processes with average rewards," ZOR-Math. Meth. Oper. Res., vol. 39, pp. 257-288, 1994.
10. E. Altman, Constrained Markov Decision Processes. New York: Chapman & Hall, 1999.
11. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Upper Saddle River, NJ: Prentice-Hall, 1982.
12. A. Ephremides, P. Varaiya, and J. Walrand, "A simple dynamic routing problem," IEEE Trans. Automat. Contr., vol. AC-25, pp. 690-693, Aug. 1980.
13. J. S. Baras, D. J. Ma, and A. M. Makowski, "K competing queues with geometric service requirements and linear costs: The μc rule is always optimal," Syst. Control Lett., vol. 6, pp. 173-180, 1985.
14. C. Buyukkoc, P. Varaiya, and J. Walrand, "The cμ rule revisited," Adv. Appl. Probab., vol. 17, pp. 237-238, 1985.
15. P. Nain and K. Ross, "Optimal priority assignment with hard constraint," IEEE Trans. Automat. Contr., vol. 31, pp. 883-888, Oct. 1986.
16. V. R. Konda and J. N. Tsitsiklis, "Actor-critic algorithms," SIAM J. Control Optim., to be published.
17. S. M. Ross, Stochastic Processes, 2nd ed. New York: Wiley, 1996.
18. R. G. Gallager, Discrete Stochastic Processes. Boston, MA: Kluwer, 1996.
19. F. P. Kelly, Reversibility and Stochastic Networks. New York: Wiley, 1979.
20. R. C. Larson and A. R. Odoni, Urban Operations Research. Upper Saddle River, NJ: Prentice-Hall, 1981.
21. V. S. Borkar, "Ergodic control of Markov chains with constraints-The general case," SIAM J. Control Optim., vol. 32, no. 1, pp. 176-186, Jan. 1994.
22. ____, "Topics in controlled Markov chains," in Pitman Research Notes in Mathematics Series #240. White Plains, NY: Longman, 1991.
23. W. Willinger and V. Paxson, "Where mathematics meets the internet," Notices Amer. Math. Soc., vol. 45, no. 8, pp. 961-970, Sept. 1998.