On the use of packet scheduling in self-optimization processes: application to coverage-capacity optimization

Richard Combes (1) , Zwi Altman (1) , Eitan Altman (2)

1 Orange Labs [Issy les Moulineaux]
2 MAESTRO - Models for the performance analysis and the control of networks

Self-organizing networks (SON) is commonly seen as a way to increase network performance while simplifying its management. This paper investigates Packet Scheduling (PS) in the context of self-optimizing networks, and demonstrates how to dynamically improve coverage by adjusting the scheduling strategy. We focus on -fair schedulers, and we provide methods for calculating the scheduling gain, including several closed form formulas. We then propose a coverage-capacity self-optimization scheme based on -fair schedulers. The method uses Key Performance Indicators (KPIs) to calculate the optimal in both simple and efficient manner. A simple use case illustrates the implementation of the SON feature and simulation results show the important coverage gains that can be achieved at the expense of very little computing power.

Mots clés: Wireless communication; Self-Optimizing Networks; Scheduling

Domaines: Informatique mobile; Réseaux et télécommunications [cs.NI]

Richard Combes, Zwi Altman, Eitan Altman. On the use of packet scheduling in self-optimization processes: application to coverage-capacity optimization. WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.11-20. ⟨inria-00498378⟩