On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks

Xiaohan Kang, Weina Wang, Juan José Jaramillo, Lei Ying

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

23 Citations (Scopus)

Abstract

This paper considers the problem of scheduling real-time traffic in wireless networks. We consider an ad hoc wireless network with general interference and general one-hop traffic. Each packet is associated with a deadline and will be dropped if it is not transmitted before the deadline expires. The number of packet arrivals in each time slot and the length of a deadline are both stochastic and follow certain distributions. We only allow a fraction of packets to be dropped. At each link, we assume the link keeps track of the difference between the minimum number of packets that need to be delivered and the number of packets that are actually delivered, which we call deficit. The largest-deficit-first (LDF) policy schedules links in descending order according to their deficit values, which is a variation of the largest-queue-first (LQF) policy for non-real-time traffic. We prove that the efficiency ratio of LDF can be lower bounded by a quantity that we call the real-time local-pooling factor (R-LPF). We further prove that given a network with interference degree β, the R-LPF is at least 1/(β + 1), which in the case of the one-hop interference model translates into an R-LPF of at least 1/3.

Original languageEnglish (US)
Title of host publicationProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
Pages99-108
Number of pages10
DOIs
StatePublished - 2013
Event14th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2013 - Bangalore, India
Duration: Jul 29 2013Aug 1 2013

Other

Other14th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2013
CountryIndia
CityBangalore
Period7/29/138/1/13

Fingerprint

Wireless ad hoc networks
Wireless networks
Scheduling

Keywords

  • Fluid limit
  • Largest-deficit-first
  • Local-pooling fluid factor
  • Real-time scheduling
  • Stability

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Cite this

Kang, X., Wang, W., Jaramillo, J. J., & Ying, L. (2013). On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (pp. 99-108) https://doi.org/10.1145/2491288.2491298

On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks. / Kang, Xiaohan; Wang, Weina; Jaramillo, Juan José; Ying, Lei.

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2013. p. 99-108.

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

Kang, X, Wang, W, Jaramillo, JJ & Ying, L 2013, On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks. in Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). pp. 99-108, 14th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2013, Bangalore, India, 7/29/13. https://doi.org/10.1145/2491288.2491298
Kang X, Wang W, Jaramillo JJ, Ying L. On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2013. p. 99-108 https://doi.org/10.1145/2491288.2491298
Kang, Xiaohan ; Wang, Weina ; Jaramillo, Juan José ; Ying, Lei. / On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2013. pp. 99-108
@inproceedings{872e9585fd074ec5932bb3919727e257,
title = "On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks",
abstract = "This paper considers the problem of scheduling real-time traffic in wireless networks. We consider an ad hoc wireless network with general interference and general one-hop traffic. Each packet is associated with a deadline and will be dropped if it is not transmitted before the deadline expires. The number of packet arrivals in each time slot and the length of a deadline are both stochastic and follow certain distributions. We only allow a fraction of packets to be dropped. At each link, we assume the link keeps track of the difference between the minimum number of packets that need to be delivered and the number of packets that are actually delivered, which we call deficit. The largest-deficit-first (LDF) policy schedules links in descending order according to their deficit values, which is a variation of the largest-queue-first (LQF) policy for non-real-time traffic. We prove that the efficiency ratio of LDF can be lower bounded by a quantity that we call the real-time local-pooling factor (R-LPF). We further prove that given a network with interference degree β, the R-LPF is at least 1/(β + 1), which in the case of the one-hop interference model translates into an R-LPF of at least 1/3.",
keywords = "Fluid limit, Largest-deficit-first, Local-pooling fluid factor, Real-time scheduling, Stability",
author = "Xiaohan Kang and Weina Wang and Jaramillo, {Juan Jos{\'e}} and Lei Ying",
year = "2013",
doi = "10.1145/2491288.2491298",
language = "English (US)",
isbn = "9781450321938",
pages = "99--108",
booktitle = "Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)",

}

TY - GEN

T1 - On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks

AU - Kang, Xiaohan

AU - Wang, Weina

AU - Jaramillo, Juan José

AU - Ying, Lei

PY - 2013

Y1 - 2013

N2 - This paper considers the problem of scheduling real-time traffic in wireless networks. We consider an ad hoc wireless network with general interference and general one-hop traffic. Each packet is associated with a deadline and will be dropped if it is not transmitted before the deadline expires. The number of packet arrivals in each time slot and the length of a deadline are both stochastic and follow certain distributions. We only allow a fraction of packets to be dropped. At each link, we assume the link keeps track of the difference between the minimum number of packets that need to be delivered and the number of packets that are actually delivered, which we call deficit. The largest-deficit-first (LDF) policy schedules links in descending order according to their deficit values, which is a variation of the largest-queue-first (LQF) policy for non-real-time traffic. We prove that the efficiency ratio of LDF can be lower bounded by a quantity that we call the real-time local-pooling factor (R-LPF). We further prove that given a network with interference degree β, the R-LPF is at least 1/(β + 1), which in the case of the one-hop interference model translates into an R-LPF of at least 1/3.

AB - This paper considers the problem of scheduling real-time traffic in wireless networks. We consider an ad hoc wireless network with general interference and general one-hop traffic. Each packet is associated with a deadline and will be dropped if it is not transmitted before the deadline expires. The number of packet arrivals in each time slot and the length of a deadline are both stochastic and follow certain distributions. We only allow a fraction of packets to be dropped. At each link, we assume the link keeps track of the difference between the minimum number of packets that need to be delivered and the number of packets that are actually delivered, which we call deficit. The largest-deficit-first (LDF) policy schedules links in descending order according to their deficit values, which is a variation of the largest-queue-first (LQF) policy for non-real-time traffic. We prove that the efficiency ratio of LDF can be lower bounded by a quantity that we call the real-time local-pooling factor (R-LPF). We further prove that given a network with interference degree β, the R-LPF is at least 1/(β + 1), which in the case of the one-hop interference model translates into an R-LPF of at least 1/3.

KW - Fluid limit

KW - Largest-deficit-first

KW - Local-pooling fluid factor

KW - Real-time scheduling

KW - Stability

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

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

U2 - 10.1145/2491288.2491298

DO - 10.1145/2491288.2491298

M3 - Conference contribution

SN - 9781450321938

SP - 99

EP - 108

BT - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

ER -