A new reward model for MDP state aggregation with application to CAC and Routing
Authors:
- 29 September 2004
- journal article
- research article
- Published by Wiley in European Transactions on Telecommunications
- Vol. 16 (6) , 495-508
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Polynomial cost approximations in Markov decision theory based call admission controlIEEE/ACM Transactions on Networking, 2001
- Routing high-bandwidth traffic in max-min fair share networks1996
- Call admission and routing in multi-service loss networksIEEE Transactions on Communications, 1994
- Computing approximate blocking probabilities for large loss networks with state-dependent routingIEEE/ACM Transactions on Networking, 1993
- Reduced load approximations for multirate loss networksIEEE Transactions on Communications, 1993
- Blocking in a Shared Resource EnvironmentIEEE Transactions on Communications, 1981