Distributed Fair Resource Allocation in Cellular Networks in the Presence of Heterogeneous Delays

Authors:
L. Ying;R. Srikant;A. Eryilmaz;G. E. Dullerud
Affiliations:
University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign
Venue:
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Year:
2005

Citing 5
Cited 3

Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks

IEEE/ACM Transactions on Networking (TON)
Variability in TCP round-trip times

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)

The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)

Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling

IEEE/ACM Transactions on Networking (TON)
On stability region and delay performance of linear-memory randomized scheduling for time-varying networks

IEEE/ACM Transactions on Networking (TON)
A unified approach to optimizing performance in networks serving heterogeneous flows

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of allocating resources at a base station to many competing flows, where each flow is intended for a different receiver. The channel conditions may be time-varying and different for different receivers. It has been shown in [6] that in a delay-free network, a combination of queue-length-based scheduling at the base station and congestion control at the end users can guarantee queue-length stability and fair resource allocation. In this paper, we extend this result to wireless networks where the congestion information from the base station is received with a feedback delay at the transmitters. The delays can be heterogenous (i.e., different users may have different roundtrip delays) and time-varying, but are assumed to be upper-bounded, with possibly very large upper bounds. We will show that the joint congestion control-scheduling algorithm continues to be stable and continues to provide a fair allocation of the network resources.