Abstract : 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.
https://hal.inria.fr/inria-00498378
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : mercredi 7 juillet 2010 - 13:17:02
Dernière modification le : samedi 27 janvier 2018 - 01:31:43
Document(s) archivé(s) le : vendredi 8 octobre 2010 - 09:30:04
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, 2010. 〈inria-00498378〉
