Online packet scheduling under adversarial errors

Paweł Garncarek, Tomasz Jurdziński, Dariusz R. Kowalski, Krzysztof Loryś

Research output: Contribution to journalArticle

Abstract

We consider the problem of scheduling packets of different sizes via a directed communication link prone to errors, where dynamic packet arrivals and errors are modeled by an adversary. Packets arrive over time to be transmitted over a channel in which instantaneous errors occur at times not known to the algorithm in advance. We focus on estimating the competitive throughput of online scheduling algorithms defined as the ratio between the total size of packets successfully transmitted by an online algorithm and the largest total size of packets which can be transmitted for the same arrival and error patterns. First, we design two online algorithms with optimal competitive throughput in various scenarios. One algorithm works for any f≥1 channels and attains the competitive throughput 1/2 provided that sizes of packets satisfy the divisibility property (i.e., any larger size is divisible by any smaller). The other algorithm achieves the optimal competitive throughput in (1/3,1/2] for arbitrary sizes of packets on one communication channel, where the exact value of the competitive throughput depends on the sizes of packets. Second, we focus on algorithms working with speedup s≥1. In this setting, online algorithms transmit packets s times faster than the offline optimum solution they are compared against. We design an algorithm which attains the competitive throughput 1 if it works with speedup 2 in the case that sizes of packets satisfy the divisibility property and with speedup s∈[4,6) for arbitrary sizes of packets. This demonstrates that throughput of the best online fault-tolerant scheduling algorithms scales well with resource augmentation.

Original languageEnglish (US)
Pages (from-to)492-509
Number of pages18
JournalTheoretical Computer Science
Volume795
DOIs
StatePublished - Nov 26 2019
Externally publishedYes

Fingerprint

Packet Scheduling
Online Scheduling
Scheduling
Throughput
Online Algorithms
Speedup
Divisibility
Scheduling algorithms
Scheduling Algorithm
Resource Augmentation
Arbitrary
Communication Channels
Divisible
Telecommunication links
Fault-tolerant
Instantaneous
Scenarios

Keywords

  • Adversarial errors
  • Competitive throughput
  • Dynamic packet arrivals
  • Online algorithms
  • Packet scheduling
  • Resource augmentation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Garncarek, P., Jurdziński, T., Kowalski, D. R., & Loryś, K. (2019). Online packet scheduling under adversarial errors. Theoretical Computer Science, 795, 492-509. https://doi.org/10.1016/j.tcs.2019.08.003

Online packet scheduling under adversarial errors. / Garncarek, Paweł; Jurdziński, Tomasz; Kowalski, Dariusz R.; Loryś, Krzysztof.

In: Theoretical Computer Science, Vol. 795, 26.11.2019, p. 492-509.

Research output: Contribution to journalArticle

Garncarek, P, Jurdziński, T, Kowalski, DR & Loryś, K 2019, 'Online packet scheduling under adversarial errors', Theoretical Computer Science, vol. 795, pp. 492-509. https://doi.org/10.1016/j.tcs.2019.08.003
Garncarek P, Jurdziński T, Kowalski DR, Loryś K. Online packet scheduling under adversarial errors. Theoretical Computer Science. 2019 Nov 26;795:492-509. https://doi.org/10.1016/j.tcs.2019.08.003
Garncarek, Paweł ; Jurdziński, Tomasz ; Kowalski, Dariusz R. ; Loryś, Krzysztof. / Online packet scheduling under adversarial errors. In: Theoretical Computer Science. 2019 ; Vol. 795. pp. 492-509.
@article{55e62d6f3d2141aeb8bed96b168bca4e,
title = "Online packet scheduling under adversarial errors",
abstract = "We consider the problem of scheduling packets of different sizes via a directed communication link prone to errors, where dynamic packet arrivals and errors are modeled by an adversary. Packets arrive over time to be transmitted over a channel in which instantaneous errors occur at times not known to the algorithm in advance. We focus on estimating the competitive throughput of online scheduling algorithms defined as the ratio between the total size of packets successfully transmitted by an online algorithm and the largest total size of packets which can be transmitted for the same arrival and error patterns. First, we design two online algorithms with optimal competitive throughput in various scenarios. One algorithm works for any f≥1 channels and attains the competitive throughput 1/2 provided that sizes of packets satisfy the divisibility property (i.e., any larger size is divisible by any smaller). The other algorithm achieves the optimal competitive throughput in (1/3,1/2] for arbitrary sizes of packets on one communication channel, where the exact value of the competitive throughput depends on the sizes of packets. Second, we focus on algorithms working with speedup s≥1. In this setting, online algorithms transmit packets s times faster than the offline optimum solution they are compared against. We design an algorithm which attains the competitive throughput 1 if it works with speedup 2 in the case that sizes of packets satisfy the divisibility property and with speedup s∈[4,6) for arbitrary sizes of packets. This demonstrates that throughput of the best online fault-tolerant scheduling algorithms scales well with resource augmentation.",
keywords = "Adversarial errors, Competitive throughput, Dynamic packet arrivals, Online algorithms, Packet scheduling, Resource augmentation",
author = "Paweł Garncarek and Tomasz Jurdziński and Kowalski, {Dariusz R.} and Krzysztof Loryś",
year = "2019",
month = "11",
day = "26",
doi = "10.1016/j.tcs.2019.08.003",
language = "English (US)",
volume = "795",
pages = "492--509",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Online packet scheduling under adversarial errors

AU - Garncarek, Paweł

AU - Jurdziński, Tomasz

AU - Kowalski, Dariusz R.

AU - Loryś, Krzysztof

PY - 2019/11/26

Y1 - 2019/11/26

N2 - We consider the problem of scheduling packets of different sizes via a directed communication link prone to errors, where dynamic packet arrivals and errors are modeled by an adversary. Packets arrive over time to be transmitted over a channel in which instantaneous errors occur at times not known to the algorithm in advance. We focus on estimating the competitive throughput of online scheduling algorithms defined as the ratio between the total size of packets successfully transmitted by an online algorithm and the largest total size of packets which can be transmitted for the same arrival and error patterns. First, we design two online algorithms with optimal competitive throughput in various scenarios. One algorithm works for any f≥1 channels and attains the competitive throughput 1/2 provided that sizes of packets satisfy the divisibility property (i.e., any larger size is divisible by any smaller). The other algorithm achieves the optimal competitive throughput in (1/3,1/2] for arbitrary sizes of packets on one communication channel, where the exact value of the competitive throughput depends on the sizes of packets. Second, we focus on algorithms working with speedup s≥1. In this setting, online algorithms transmit packets s times faster than the offline optimum solution they are compared against. We design an algorithm which attains the competitive throughput 1 if it works with speedup 2 in the case that sizes of packets satisfy the divisibility property and with speedup s∈[4,6) for arbitrary sizes of packets. This demonstrates that throughput of the best online fault-tolerant scheduling algorithms scales well with resource augmentation.

AB - We consider the problem of scheduling packets of different sizes via a directed communication link prone to errors, where dynamic packet arrivals and errors are modeled by an adversary. Packets arrive over time to be transmitted over a channel in which instantaneous errors occur at times not known to the algorithm in advance. We focus on estimating the competitive throughput of online scheduling algorithms defined as the ratio between the total size of packets successfully transmitted by an online algorithm and the largest total size of packets which can be transmitted for the same arrival and error patterns. First, we design two online algorithms with optimal competitive throughput in various scenarios. One algorithm works for any f≥1 channels and attains the competitive throughput 1/2 provided that sizes of packets satisfy the divisibility property (i.e., any larger size is divisible by any smaller). The other algorithm achieves the optimal competitive throughput in (1/3,1/2] for arbitrary sizes of packets on one communication channel, where the exact value of the competitive throughput depends on the sizes of packets. Second, we focus on algorithms working with speedup s≥1. In this setting, online algorithms transmit packets s times faster than the offline optimum solution they are compared against. We design an algorithm which attains the competitive throughput 1 if it works with speedup 2 in the case that sizes of packets satisfy the divisibility property and with speedup s∈[4,6) for arbitrary sizes of packets. This demonstrates that throughput of the best online fault-tolerant scheduling algorithms scales well with resource augmentation.

KW - Adversarial errors

KW - Competitive throughput

KW - Dynamic packet arrivals

KW - Online algorithms

KW - Packet scheduling

KW - Resource augmentation

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

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

U2 - 10.1016/j.tcs.2019.08.003

DO - 10.1016/j.tcs.2019.08.003

M3 - Article

AN - SCOPUS:85071095941

VL - 795

SP - 492

EP - 509

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -