Computer Science – Information Theory
Scientific paper
2008-08-07
Computer Science
Information Theory
41 pages, 8 figures. submitted to IEEE Transactions on Information Theory on August the 6th, 2008
Scientific paper
In this work we are concerned with the problem of achieving max-min fairness in Gaussian parallel channels with respect to a general performance function, including channel capacity or decoding reliability as special cases. As our central results, we characterize the laws which determine the value of the achievable max-min fair performance as a function of channel sharing policy and power allocation (to channels and users). In particular, we show that the max-min fair performance behaves as a specialized version of the Lovasz function, or Delsarte bound, of a certain graph induced by channel sharing combinatorics. We also prove that, in addition to such graph, merely a certain 2-norm distance dependent on the allowable power allocations and used performance functions, is sufficient for the characterization of max-min fair performance up to some candidate interval. Our results show also a specific role played by odd cycles in the graph induced by the channel sharing policy and we present an interesting relation between max-min fairness in parallel channels and optimal throughput in an associated interference channel.
Boche Holger
Wiczanowski Marcin
No associations
LandOfFree
A new graph perspective on max-min fairness in Gaussian parallel channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A new graph perspective on max-min fairness in Gaussian parallel channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new graph perspective on max-min fairness in Gaussian parallel channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-213424