A new graph perspective on max-min fairness in Gaussian parallel channels
Authors
Reference
Proc. IEEE 2008 International Symposium on Information Theory and its Applications (ISITA),
Auckland, New Zealand,
Dec. 2008.
Abstract
In this work we make a step towards answers to the above questions for the (max-min) fair performance (with regards to a general performance function) in parallel channels shared by multiple users. We state optimistic and pessimistic bounds on the user performance which give rise to an algorithmic computation procedure and insights into the problem structure. The essence of our results is that the fair performance behaves as a specialized version of the Lovasz function of the channel sharing topology and is influenced by the (set of) allowable power allocations only through a certain gap/distance.
Subject areas
- Multi-carrier Systems
- Network / QoS Optimization
IEEEtran BibTeX-Entry
@inproceedings{WB08angp,
author = "Marcin Wiczanowski and Holger Boche",
title = "{A new graph perspective on max-min fairness in Gaussian parallel channels}",
booktitle = "{Proc. IEEE 2008 International Symposium on Information Theory and its Applications (ISITA)}",
address = "Auckland, New Zealand",
month = dec,
year = "2008",
}
Last modified 28.10.2008 11:39