Polynomial cost approximations in Markov decision theory based call admission control

Hannu Rummukainen, Jorma Virtamo

    Research output: Contribution to journalArticleScientificpeer-review

    4 Citations (Scopus)


    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.

    Original languageEnglish
    Pages (from-to)769-779
    Number of pages11
    JournalIEEE/ACM Transactions on Networking
    Issue number6
    Publication statusPublished - 1 Dec 2001
    MoE publication typeA1 Journal article-refereed


    • Broadband networks
    • Connection admission control
    • Markov decision processes
    • Network revenue
    • Piecewise polynomial approximation
    • Telecommunication congestion control
    • Telecommunication network routing


    Dive into the research topics of 'Polynomial cost approximations in Markov decision theory based call admission control'. Together they form a unique fingerprint.

    Cite this