Polynomial cost approximations in markov decision theory based call admission control

Authors:
Hannu Rummukainen;Jorma Virtamo
Affiliations:
VTT Information Technology, Espoo, Finland;Helsinki University of Technology, 02150 Espoo, Finland
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2001

Citing 6
Cited 1

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Computational algorithms for closed queueing networks with exponential servers

Communications of the ACM
Accuracy and Stability of Numerical Algorithms

Accuracy and Stability of Numerical Algorithms
ATM Network Resource Management

ATM Network Resource Management
Multiservice Loss Models for Broadband Telecommunication Networks

Multiservice Loss Models for Broadband Telecommunication Networks
Call admission control and routing in integrated services networks using neuro-dynamic programming

IEEE Journal on Selected Areas in Communications

Large population games in radial loss networks: computationally tractable equilibria for distributed network admission control

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of call admission control and routing in a multiservice circuit-switched loss network can be solved optimally under certain assumptions by the tools of Markov decision theory. However, in networks of practical size a number of simplifying approximations are needed to make the solution feasible. Assuming link independence, we propose a new method for approximating the state-dependent link costs accurately and relatively efficiently, even on links with extremely large state spaces. The proposed polynomial approximations are optimal in the sense of minimizing the residual in the continuous-time Howard equations of the Markov decision processes associated with the links. Numerical results are presented, and the proposed approximations are found superior to some earlier link-cost approximation methods.