On the use of packet scheduling in self-optimization processes: application to coverage-capacity optimization - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2010

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

Richard Combes
Zwi Altman
  • Fonction : Auteur
  • PersonId : 872996

Résumé

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.
Fichier principal
Vignette du fichier
p11-combes.pdf (488.11 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00498378 , version 1 (07-07-2010)

Identifiants

  • HAL Id : inria-00498378 , version 1

Citer

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⟩
172 Consultations
123 Téléchargements

Partager

More