Optimal dynamic admission control in heterogeneous networks

2008 International ITG Workshop on Smart Antennas, WSA 2008

Volumn , Issue , 2008, Pages 217-224

  Bühler, Jörg ^a   Wunder, Gerhard ^a  

^a FRAUNHOFER HEINRICH HERTZ INSTITUTE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADMISSION CONTROL; DYNAMIC ADMISSION CONTROL; GREEDY STRATEGIES; HETEROGENEOUS NETWORK ENVIRONMENTS; HETEROGENEOUS NETWORKS; OPTIMAL CONTROL; OPTIMAL POLICIES; RESOURCE COSTS; SEMI-MARKOV DECISION PROCESSES; STOCHASTIC ASSIGNMENT; STRUCTURAL PROPERTIES;

ANTENNA ACCESSORIES; ANTENNAS; INTERSECTIONS; SMART ANTENNAS;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 49749143796     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSA.2008.4475562     Document Type: Conference Paper

References (12)

1. I. Blau and G. Wunder, "User allocation in multisystem, multi-service scenarios: Upper and lower performance bound of polynomial time assignment algorithm," in Conference on Information Sciences and Systems (CISS '07), Baltimore USA, 2007.
2. H. Tijms, Stochastic Modelling and Analysis: A Computational Approach. New York, NY: Wiley, 1986.
3. K. Ross and D. Tsang, "The stochastic knapsack problem," IEEE Trans. Communications, vol. 37, no. 7, pp. 884-895, 1989.
4. _, "Optimal circuit access policies in an isdn environment: A markov decision approach," IEEE Trans. Communications, vol. 37, no. 9, pp. 934-939, 1989.
5. E. Altman, T. Jiménez, and G. Koole, "On optimal call admission control in a resource-sharing system," IEEE Trans. Communications, vol. 49, pp. 1659-1668, 2001.
6. A. Gavious and Z. Rosberg, "A restricted complete sharing policy for a stochastic knapsack problem in b-isdn," IEEE Trans. Communications, vol. 42, no. 7, pp. 2375-2379, 1994.
7. K. Ross and D. Yao, "Monotonicity properties for the stochastic knapsack," IEEE Trans. Inform. Theory, vol. 36, no. 5, pp. 1173-1179, 1990.
8. L. Fleischer, M. Goemans, V. Mirrokni, and M. Sviridenko, "Tight approximation algorithms for maximum general assignment problems," in Proc. 17th ACM-SIAM Symposium on Discrete Algorithms, 2006.
9. L. Kleinrock, Queueing Systems Vol. I: Theory. John Wiley & Sons, 1975.
10. E. Altman and G. Koole, "On submodular value functions of dynamic programming," INRIA, Tech. Rep. 2658, 1995.
11. G. Koole, "Monotonicity in markov reward and decision chains: Theory and applications," Foundation and Trends in Stochastic Systems, vol. 1, no. 1, pp. 1-76, 2006.
12. _, "Dynamic programming tools for control of telecommunication systems," in Proc. 35th Conference on Decision and Control, 1996.