Polynomial cost approximations in markov decision theory based call admission control

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… (More)
DOI: 10.1109/90.974530

5 Figures and Tables

Topics

  • Presentations referencing similar topics