3rd International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

Optimal Robust Policies for Bandwidth Allocation and Admission Control in Wireless Networks

Download496 downloads
  • @INPROCEEDINGS{10.4108/ICST.VALUETOOLS2008.4376,
        author={Vicent Pla and Jorma Virtamo and Jorge Mart\^{\i}nez-Bauset},
        title={Optimal Robust Policies for Bandwidth Allocation and Admission Control in Wireless Networks},
        proceedings={3rd International ICST Conference on Performance Evaluation Methodologies and Tools},
        publisher={ICST},
        proceedings_a={VALUETOOLS},
        year={2010},
        month={5},
        keywords={Wireless networks resource management elastic traffic insensitivity optimal policy},
        doi={10.4108/ICST.VALUETOOLS2008.4376}
    }
    
  • Vicent Pla
    Jorma Virtamo
    Jorge Martínez-Bauset
    Year: 2010
    Optimal Robust Policies for Bandwidth Allocation and Admission Control in Wireless Networks
    VALUETOOLS
    ICST
    DOI: 10.4108/ICST.VALUETOOLS2008.4376
Vicent Pla1,*, Jorma Virtamo2,*, Jorge Martínez-Bauset1,*
  • 1: Univ. Politécnica de Valencia, ETSIT, Camí de Vera s/n, 46022 Valencia, Spain
  • 2: Dept. of Communications and Networking, Helsinki Univ. of Technology, P.O. Box 3000, FI02015 TKK, Finland
*Contact email: vpla@dcom.upv.es, jorma.virtamo@tkk.fi, jmartinez@upvnet.upv.es

Abstract

We consider joint strategies of bandwidth allocation and admission control for elastic users competing for a downlink data channel in a cellular network. For the sake of robustness and generality of the results we focus on the set of strategies whose performance does not depend on the detailed traffic characteristics beyond the traffic intensity. Performance is studied at the flow level in a dynamic setting where users come and go over time. A number of user classes are considered, which are characterized by their achievable bit rate, guaranteed throughput, arrival rate and mean flow size. We aim at characterizing a strategy which is optimal in the sense of having the lowest blocking probability. Such characterization provides some interesting insights into the optimal policy and its evolution as the system load increases. Unfortunately, from a practical perspective computing the optimal policy can be exceedingly complex except for lightly loaded systems. Alternatively, we propose a computationally feasible suboptimal policy that achieves a good relative performance.