Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays

Lei Ying, R. Srikant, A. Eryilmaz, G. E. Dullerud

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationProceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Pages96-105
Number of pages10
Volume2005
DOIs
StatePublished - 2005
Externally publishedYes
Event3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks 2005, WiOpt 2005 - Trentino, Italy
Duration: Apr 4 2005Apr 6 2005

Other

Other3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks 2005, WiOpt 2005
CountryItaly
CityTrentino
Period4/4/054/6/05

Fingerprint

Base stations
Resource allocation
Scheduling algorithms
Transmitters
Wireless networks
Scheduling
Feedback

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ying, L., Srikant, R., Eryilmaz, A., & Dullerud, G. E. (2005). Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays. In Proceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (Vol. 2005, pp. 96-105). [1421096] https://doi.org/10.1109/WIOPT.2005.18

Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays. / Ying, Lei; Srikant, R.; Eryilmaz, A.; Dullerud, G. E.

Proceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks. Vol. 2005 2005. p. 96-105 1421096.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ying, L, Srikant, R, Eryilmaz, A & Dullerud, GE 2005, Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays. in Proceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks. vol. 2005, 1421096, pp. 96-105, 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks 2005, WiOpt 2005, Trentino, Italy, 4/4/05. https://doi.org/10.1109/WIOPT.2005.18
Ying L, Srikant R, Eryilmaz A, Dullerud GE. Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays. In Proceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks. Vol. 2005. 2005. p. 96-105. 1421096 https://doi.org/10.1109/WIOPT.2005.18
Ying, Lei ; Srikant, R. ; Eryilmaz, A. ; Dullerud, G. E. / Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays. Proceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks. Vol. 2005 2005. pp. 96-105
@inproceedings{6564d764a1fa4973967794f9fd08ed41,
title = "Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays",
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.",
author = "Lei Ying and R. Srikant and A. Eryilmaz and Dullerud, {G. E.}",
year = "2005",
doi = "10.1109/WIOPT.2005.18",
language = "English (US)",
isbn = "076952267X",
volume = "2005",
pages = "96--105",
booktitle = "Proceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks",

}

TY - GEN

T1 - Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays

AU - Ying, Lei

AU - Srikant, R.

AU - Eryilmaz, A.

AU - Dullerud, G. E.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33744458955&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33744458955&partnerID=8YFLogxK

U2 - 10.1109/WIOPT.2005.18

DO - 10.1109/WIOPT.2005.18

M3 - Conference contribution

AN - SCOPUS:33744458955

SN - 076952267X

SN - 9780769522678

VL - 2005

SP - 96

EP - 105

BT - Proceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

ER -