Skip to Main content Skip to Navigation
Conference papers

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

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.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/inria-00498378
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, July 7, 2010 - 1:17:02 PM
Last modification on : Thursday, January 20, 2022 - 5:31:44 PM
Long-term archiving on: : Friday, October 8, 2010 - 9:30:04 AM

File

p11-combes.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00498378, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

140

Files downloads

93