On scheduling for minimizing end-to-end buffer usage over multihop wireless networks

V. J. Venkataramanan, Xiaojun Lin, Lei Ying, Sanjay Shakkottai

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

29 Citations (Scopus)

Abstract

While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) results have not been as forthcoming. In this paper, we study the end-to-end buffer usage (sum of buffer utilization along a flow path) over a network with general topology and with fixed, loop-free routes using a large-deviations approach. We first derive bounds on the best performance that any scheduling algorithm can achieve. Based on the intuition from the bounds, we propose a class of (backpressure-like) scheduling algorithms called αβ-algorithms. We show that the parameters α and β can be chosen such that the system under the αβ-algorithm performs arbitrarily closely to the best possible scheduler (formally the decay rate function for end-to-end buffer overflow is shown to be arbitrarily close to optimal in the large-buffer regime). We also develop variants which have the same asymptotic optimality property, and also provide good performance in the small-buffer regime. Our results are substantiated using both analysis and simulation.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
DOIs
StatePublished - 2010
Externally publishedYes
EventIEEE INFOCOM 2010 - San Diego, CA, United States
Duration: Mar 14 2010Mar 19 2010

Other

OtherIEEE INFOCOM 2010
CountryUnited States
CitySan Diego, CA
Period3/14/103/19/10

Fingerprint

Wireless networks
Scheduling
Scheduling algorithms
Topology

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Venkataramanan, V. J., Lin, X., Ying, L., & Shakkottai, S. (2010). On scheduling for minimizing end-to-end buffer usage over multihop wireless networks. In Proceedings - IEEE INFOCOM [5462117] https://doi.org/10.1109/INFCOM.2010.5462117

On scheduling for minimizing end-to-end buffer usage over multihop wireless networks. / Venkataramanan, V. J.; Lin, Xiaojun; Ying, Lei; Shakkottai, Sanjay.

Proceedings - IEEE INFOCOM. 2010. 5462117.

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

Venkataramanan, VJ, Lin, X, Ying, L & Shakkottai, S 2010, On scheduling for minimizing end-to-end buffer usage over multihop wireless networks. in Proceedings - IEEE INFOCOM., 5462117, IEEE INFOCOM 2010, San Diego, CA, United States, 3/14/10. https://doi.org/10.1109/INFCOM.2010.5462117
Venkataramanan, V. J. ; Lin, Xiaojun ; Ying, Lei ; Shakkottai, Sanjay. / On scheduling for minimizing end-to-end buffer usage over multihop wireless networks. Proceedings - IEEE INFOCOM. 2010.
@inproceedings{bb1d59f10a9c49d5a704a5d6797c1c68,
title = "On scheduling for minimizing end-to-end buffer usage over multihop wireless networks",
abstract = "While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) results have not been as forthcoming. In this paper, we study the end-to-end buffer usage (sum of buffer utilization along a flow path) over a network with general topology and with fixed, loop-free routes using a large-deviations approach. We first derive bounds on the best performance that any scheduling algorithm can achieve. Based on the intuition from the bounds, we propose a class of (backpressure-like) scheduling algorithms called αβ-algorithms. We show that the parameters α and β can be chosen such that the system under the αβ-algorithm performs arbitrarily closely to the best possible scheduler (formally the decay rate function for end-to-end buffer overflow is shown to be arbitrarily close to optimal in the large-buffer regime). We also develop variants which have the same asymptotic optimality property, and also provide good performance in the small-buffer regime. Our results are substantiated using both analysis and simulation.",
author = "Venkataramanan, {V. J.} and Xiaojun Lin and Lei Ying and Sanjay Shakkottai",
year = "2010",
doi = "10.1109/INFCOM.2010.5462117",
language = "English (US)",
isbn = "9781424458363",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - On scheduling for minimizing end-to-end buffer usage over multihop wireless networks

AU - Venkataramanan, V. J.

AU - Lin, Xiaojun

AU - Ying, Lei

AU - Shakkottai, Sanjay

PY - 2010

Y1 - 2010

N2 - While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) results have not been as forthcoming. In this paper, we study the end-to-end buffer usage (sum of buffer utilization along a flow path) over a network with general topology and with fixed, loop-free routes using a large-deviations approach. We first derive bounds on the best performance that any scheduling algorithm can achieve. Based on the intuition from the bounds, we propose a class of (backpressure-like) scheduling algorithms called αβ-algorithms. We show that the parameters α and β can be chosen such that the system under the αβ-algorithm performs arbitrarily closely to the best possible scheduler (formally the decay rate function for end-to-end buffer overflow is shown to be arbitrarily close to optimal in the large-buffer regime). We also develop variants which have the same asymptotic optimality property, and also provide good performance in the small-buffer regime. Our results are substantiated using both analysis and simulation.

AB - While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) results have not been as forthcoming. In this paper, we study the end-to-end buffer usage (sum of buffer utilization along a flow path) over a network with general topology and with fixed, loop-free routes using a large-deviations approach. We first derive bounds on the best performance that any scheduling algorithm can achieve. Based on the intuition from the bounds, we propose a class of (backpressure-like) scheduling algorithms called αβ-algorithms. We show that the parameters α and β can be chosen such that the system under the αβ-algorithm performs arbitrarily closely to the best possible scheduler (formally the decay rate function for end-to-end buffer overflow is shown to be arbitrarily close to optimal in the large-buffer regime). We also develop variants which have the same asymptotic optimality property, and also provide good performance in the small-buffer regime. Our results are substantiated using both analysis and simulation.

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

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

U2 - 10.1109/INFCOM.2010.5462117

DO - 10.1109/INFCOM.2010.5462117

M3 - Conference contribution

SN - 9781424458363

BT - Proceedings - IEEE INFOCOM

ER -