The stability of Longest-Queue-First scheduling with variable packet sizes

Siva Theja Maguluri, Bruce Hajek, R. Srikant

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

Abstract

It is well known that the MaxWeight scheduling algorithm is throughput-optimal in wireless networks. However, its complexity is exponential in the number of links in an ad hoc network. In this work, we consider a greedy variant of the MaxWeight algorithm, called Longest Queue First (LQF). A synchronous version of LQF is known to be throughput-optimal under a topological condition called local pooling. Here we study an asynchronous version of LQF which is suitable for implementation in networks with variable packet sizes. We show that asynchronous LQF is also throughput-optimal under the local pooling condition.

Original languageEnglish (US)
Title of host publication2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
Pages3770-3775
Number of pages6
DOIs
StatePublished - Dec 1 2011
Event2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 - Orlando, FL, United States
Duration: Dec 12 2011Dec 15 2011

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
CountryUnited States
CityOrlando, FL
Period12/12/1112/15/11

    Fingerprint

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Maguluri, S. T., Hajek, B., & Srikant, R. (2011). The stability of Longest-Queue-First scheduling with variable packet sizes. In 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 (pp. 3770-3775). [6161014] (Proceedings of the IEEE Conference on Decision and Control). https://doi.org/10.1109/CDC.2011.6161014