Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference

Xiaohan Kang, Juan José Jaramillo, Lei Ying

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless networks with multihop traffic under the one-hop interference model. Although it is well known that the back-pressure algorithm achieves the maximal stability, its computational complexity is prohibitively high. In this paper, we consider LQF, a low-complexity scheduling algorithm, which has been shown to have near-optimal throughput performance in many networks with single-hop traffic flows. We are interested in the performance of LQF for multihop traffic flows. In this scenario, the coupling between queues due to multihop traffic flows makes the local-pooling-factor analysis difficult to perform. Using the fluid-limit techniques, we show that LQF achieves the maximal stability for linear networks with multihop traffic and a single destination on the boundary of the network under the one-hop interference model.

Original languageEnglish (US)
Pages (from-to)273-291
Number of pages19
JournalQueueing Systems
Volume80
Issue number3
DOIs
StatePublished - Apr 4 2015

Fingerprint

Wireless networks
Scheduling
Linear networks
Factor analysis
Scheduling algorithms
Computational complexity
Throughput
Fluids
Interference
Queue
Traffic flow

Keywords

  • Fluid limit
  • Linear networks
  • Longest-queue-first scheduling
  • Multihop traffic
  • Queueing networks
  • Stability
  • Throughput optimality

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Management Science and Operations Research

Cite this

Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference. / Kang, Xiaohan; Jaramillo, Juan José; Ying, Lei.

In: Queueing Systems, Vol. 80, No. 3, 04.04.2015, p. 273-291.

Research output: Contribution to journalArticle

@article{992551a2a01a43189a7b9b9eb90be491,
title = "Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference",
abstract = "We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless networks with multihop traffic under the one-hop interference model. Although it is well known that the back-pressure algorithm achieves the maximal stability, its computational complexity is prohibitively high. In this paper, we consider LQF, a low-complexity scheduling algorithm, which has been shown to have near-optimal throughput performance in many networks with single-hop traffic flows. We are interested in the performance of LQF for multihop traffic flows. In this scenario, the coupling between queues due to multihop traffic flows makes the local-pooling-factor analysis difficult to perform. Using the fluid-limit techniques, we show that LQF achieves the maximal stability for linear networks with multihop traffic and a single destination on the boundary of the network under the one-hop interference model.",
keywords = "Fluid limit, Linear networks, Longest-queue-first scheduling, Multihop traffic, Queueing networks, Stability, Throughput optimality",
author = "Xiaohan Kang and Jaramillo, {Juan Jos{\'e}} and Lei Ying",
year = "2015",
month = "4",
day = "4",
doi = "10.1007/s11134-015-9441-2",
language = "English (US)",
volume = "80",
pages = "273--291",
journal = "Queueing Systems",
issn = "0257-0130",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference

AU - Kang, Xiaohan

AU - Jaramillo, Juan José

AU - Ying, Lei

PY - 2015/4/4

Y1 - 2015/4/4

N2 - We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless networks with multihop traffic under the one-hop interference model. Although it is well known that the back-pressure algorithm achieves the maximal stability, its computational complexity is prohibitively high. In this paper, we consider LQF, a low-complexity scheduling algorithm, which has been shown to have near-optimal throughput performance in many networks with single-hop traffic flows. We are interested in the performance of LQF for multihop traffic flows. In this scenario, the coupling between queues due to multihop traffic flows makes the local-pooling-factor analysis difficult to perform. Using the fluid-limit techniques, we show that LQF achieves the maximal stability for linear networks with multihop traffic and a single destination on the boundary of the network under the one-hop interference model.

AB - We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless networks with multihop traffic under the one-hop interference model. Although it is well known that the back-pressure algorithm achieves the maximal stability, its computational complexity is prohibitively high. In this paper, we consider LQF, a low-complexity scheduling algorithm, which has been shown to have near-optimal throughput performance in many networks with single-hop traffic flows. We are interested in the performance of LQF for multihop traffic flows. In this scenario, the coupling between queues due to multihop traffic flows makes the local-pooling-factor analysis difficult to perform. Using the fluid-limit techniques, we show that LQF achieves the maximal stability for linear networks with multihop traffic and a single destination on the boundary of the network under the one-hop interference model.

KW - Fluid limit

KW - Linear networks

KW - Longest-queue-first scheduling

KW - Multihop traffic

KW - Queueing networks

KW - Stability

KW - Throughput optimality

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

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

U2 - 10.1007/s11134-015-9441-2

DO - 10.1007/s11134-015-9441-2

M3 - Article

AN - SCOPUS:84930477022

VL - 80

SP - 273

EP - 291

JO - Queueing Systems

JF - Queueing Systems

SN - 0257-0130

IS - 3

ER -