Scheduling gain for frequency-selective Rayleigh-fading channels with application to self-organizing packet scheduling

This paper investigates packet scheduling in the context of Self-Optimizing Networks, and demonstrates how to improve coverage dynamically by adjusting the scheduling strategy. We focus on α -fair schedulers, and we provide methods for calculating the scheduling gain, including several closed form f...

Full description

Saved in:
Bibliographic Details
Published in:Performance evaluation 2011-08, Vol.68 (8), p.690-709
Main Authors: Combes, Richard, Altman, Zwi, Altman, Eitan
Format: Article
Language:English
Subjects:
Algorithms
Channels
Computer Science
Gain
Information Theory
Mathematical analysis
Mathematical models
Mathematics
Networking and Internet Architecture
Optimization and Control
Packets (communication)
Probability
Scheduling
Self-optimizing networks
Strategy
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper investigates packet scheduling in the context of Self-Optimizing Networks, and demonstrates how to improve coverage dynamically by adjusting the scheduling strategy. We focus on α -fair schedulers, and we provide methods for calculating the scheduling gain, including several closed form formulas. Scheduling gain is analyzed for different fading models, with a particular focus on the frequency-selective channel. We then propose a coverage-capacity self-optimization algorithm based on α -fair schedulers. A use case illustrates the implementation of the algorithm and simulation results show that important coverage gains are achieved at the expense of very little computing power.
ISSN:0166-5316
1872-745X
DOI:10.1016/j.peva.2011.01.009