An Alternative LP Formulation of the Admission Control Problem in Multiclass Networks

Author

Pietrabissa, Antonio

Author_Institution

Univ. of Rome, Rome

Volume

53

Issue

3

fYear

2008

fDate

4/1/2008 12:00:00 AM

Firstpage

839

Lastpage

845

Abstract

Communication networks support an increasing number of classes of service (CoS). Admission control strategies can be planned within the Markov decision process (MDP) framework; with the linear programming (LP) formulation of the MDP, class level requirements are explicitly controlled. Scalability problems with respect to the number C of CoSs arise with the standard LP formulation. This note proposes an alternative LP formulation, which is more scalable: the problem size reduction is 0((C+ 1)²/2^C).

Keywords

Markov processes; linear programming; telecommunication congestion control; telecommunication networks; Markov decision process framework; admission control problem; alternative LP formulation; classes of service; communication networks; linear programming; multiclass networks; Admission control; Bandwidth; Communication networks; Communication system control; Communication system traffic control; Linear programming; Multiaccess communication; Satellites; Scalability; Wireless networks; Call admission control; Markov decision processes (MDPs); communication networks; linear programming (LP);

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/TAC.2008.919516

Filename

4484207