In this paper we study the call admission control (CAC) and routing issue for ATM networks which carry integrated CBR/VBR and ABR traffic. The integration of CBR/VBR and ABR traffic is assumed to be based on the max-min fairness criterion. The CAC and routing task is formulated as a Markov decision problem (MDP) where the objective is to maximize the revenue from carried calls. The MDP is solved by the policy iteration procedure, after applying the standard link independence assumption. The numerical results show that the MDP routing method yields higher revenue than the least loaded path routing method.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Call admission control and routing for integrated CBR/VBR and ABR services: a Markov decision approach


    Contributors:


    Publication date :

    1999-01-01


    Size :

    433093 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Continuous-time Markov Decision Processes to Call Admission Control Problem

    Zhou, Y.-p. / Xi, H.-s. / Yin, B.-q. et al. | British Library Online Contents | 2001


    Call Admission Control

    Karapantazis, Stylianos / Todorova, Petia / Davoli, Franco et al. | Springer Verlag | 2007


    Call Admission Control Scheme with Bandwidth Borrowing in Integrated GEO Satellite Networks

    Hong, Tae Chul / Kang, Kun Seok / Ahn, Do-Seob et al. | AIAA | 2006


    Call Admission Control for DVB-S2 Systems

    Parraga Niebla, Cristina | AIAA | 2006