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

Author

Nordström, Ernst ; Carlström, Jakob

Author_Institution

Dept. of Comput. Syst., Uppsala Univ., Sweden

fYear

1999

fDate

1999

Firstpage

71

Lastpage

76

Abstract

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

Keywords

Markov processes; asynchronous transfer mode; iterative methods; minimax techniques; quality of service; queueing theory; telecommunication congestion control; telecommunication network routing; telecommunication traffic; ABR; ATM networks; CAC; CBR; Markov decision approach; VBR; call admission control; integrated services; link independence assumption; max-min fairness criterion; policy iteration procedure; revenue maximization; routing; traffic; Availability; Bandwidth; Bit rate; Call admission control; Communication system traffic control; Feedback; Information technology; Iterative algorithms; Resource management; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

ATM Workshop, 1999. IEEE Proceedings

Conference_Location

Kochi

Print_ISBN

4-88552-164-5

Type

conf

DOI

10.1109/ATM.1999.786781

Filename

786781