Paper Info
Title
Optimal call admission control for an IEEE 802.16 wireless metropolitan area network
Abstract
This paper focus on optimal Call Admission Control (CAC) policy for an IEEE 802.16 Wireless MAN. This policy has two objectives: (i) statistically guarantee the QoS of UGS, rtPS and nrtPS connections, (ii) maximize the average revenue of the wireless link. To find such optimal policy, we model our CAC agent as a Constrained Semi-Markov Decision Process (CSMDP). To the best of our knowledge, the only algorithm able to compute the optimal control policy of a CSMDP is based on the Linear Programming (L.P.) approach. Unfortunately, a realistic CAC problem with a large states space is intractable with the L.P. algorithm. Our work presents two contributions. First, the proposition of an optimal CAC for Triple-Play services support over a 802.16 WMAN. Second, the presentation of an alternative iterative algorithm that can be used to overcome the difficulties faced by the L.P. approach.
Year
DOI
Venue
2007
10.1007/978-3-540-72709-5_11
NET-COOP
Keywords
Field
DocType
wireless metropolitan area network,optimal control policy,realistic cac problem,optimal call admission control,constrained semi-markov decision process,l.p. algorithm,optimal cac,cac agent,alternative iterative algorithm,l.p. approach,optimal policy,state space,linear program,iterative algorithm,optimal control
Optimal control,Wireless,Iterative method,Call Admission Control,Computer science,Markov decision process,Quality of service,Computer network,IEEE 802,Linear programming
Conference
Volume
ISSN
Citations 
4465
0302-9743
5
PageRank 
References 
Authors
0.68
5
4
Name
Order
Citations
PageRank
Sondes Khemiri1153.02
Khaled Boussetta219327.71
Nadjib Achir313122.92
Guy Pujolle42015267.64