Online packet scheduling under adversarial jamming

Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys

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

Abstract

We consider the problem of scheduling packets of different lengths via a directed communication link prone to jamming errors. Dynamic packet arrivals and errors aremodelled by an adversary. We focus on estimating competitive throughput of online scheduling algorithms. We design an online algorithm for scheduling packets of arbitrary lengths, achieving optimal competitive throughput in (1/3, 1/2] (the exact value depends on packet lengths). Another algorithm we design makes use of additional resources in order to achieve competitive throughput 1, that is, it achieves at least as high throughput as the best schedule without such resources, for any arrival and jamming patterns. More precisely, we show that if the algorithm can run with double speed, i.e., with twice higher frequency, then its competitive throughput is 1. This demonstrates that throughput of the best online fault-tolerant scheduling algorithms scales well with resource augmentation. Finally, we generalize the first of our algorithms to the case of any f ≥ 1 channels and obtain competitive throughput 1/2 in this setting in case packets lengths are pairwise divisible (i.e., any larger is divisible by any smaller).

Original languageEnglish (US)
Title of host publicationApproximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers
EditorsOla Svensson, Evripidis Bampis
PublisherSpringer Verlag
Pages193-206
Number of pages14
ISBN (Print)9783319182629
DOIs
StatePublished - Jan 1 2015
Externally publishedYes
Event12th International Workshop on Approximation and Online Algorithms, WAOA 2014 - Wroclaw, Poland
Duration: Sep 11 2014Sep 12 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8952
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Workshop on Approximation and Online Algorithms, WAOA 2014
CountryPoland
CityWroclaw
Period9/11/149/12/14

Fingerprint

Packet Scheduling
Online Scheduling
Jamming
Throughput
Scheduling
Online Algorithms
Divisible
Scheduling Algorithm
Scheduling algorithms
Resource Augmentation
Resources
Algorithm Design
Fault-tolerant
High Throughput
Pairwise
Schedule
Telecommunication links
Generalise
Arbitrary
Demonstrate

Keywords

  • Adversarial jamming
  • Competitive throughput
  • Online algorithms
  • Packet scheduling
  • Resource augmentation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Jurdzinski, T., Kowalski, D. R., & Lorys, K. (2015). Online packet scheduling under adversarial jamming. In O. Svensson, & E. Bampis (Eds.), Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers (pp. 193-206). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8952). Springer Verlag. https://doi.org/10.1007/978-3-319-18263-6_17

Online packet scheduling under adversarial jamming. / Jurdzinski, Tomasz; Kowalski, Dariusz R.; Lorys, Krzysztof.

Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers. ed. / Ola Svensson; Evripidis Bampis. Springer Verlag, 2015. p. 193-206 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8952).

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

Jurdzinski, T, Kowalski, DR & Lorys, K 2015, Online packet scheduling under adversarial jamming. in O Svensson & E Bampis (eds), Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8952, Springer Verlag, pp. 193-206, 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, Wroclaw, Poland, 9/11/14. https://doi.org/10.1007/978-3-319-18263-6_17
Jurdzinski T, Kowalski DR, Lorys K. Online packet scheduling under adversarial jamming. In Svensson O, Bampis E, editors, Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers. Springer Verlag. 2015. p. 193-206. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-18263-6_17
Jurdzinski, Tomasz ; Kowalski, Dariusz R. ; Lorys, Krzysztof. / Online packet scheduling under adversarial jamming. Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers. editor / Ola Svensson ; Evripidis Bampis. Springer Verlag, 2015. pp. 193-206 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3b3f4b2188384568a7ca05b67c760b75,
title = "Online packet scheduling under adversarial jamming",
abstract = "We consider the problem of scheduling packets of different lengths via a directed communication link prone to jamming errors. Dynamic packet arrivals and errors aremodelled by an adversary. We focus on estimating competitive throughput of online scheduling algorithms. We design an online algorithm for scheduling packets of arbitrary lengths, achieving optimal competitive throughput in (1/3, 1/2] (the exact value depends on packet lengths). Another algorithm we design makes use of additional resources in order to achieve competitive throughput 1, that is, it achieves at least as high throughput as the best schedule without such resources, for any arrival and jamming patterns. More precisely, we show that if the algorithm can run with double speed, i.e., with twice higher frequency, then its competitive throughput is 1. This demonstrates that throughput of the best online fault-tolerant scheduling algorithms scales well with resource augmentation. Finally, we generalize the first of our algorithms to the case of any f ≥ 1 channels and obtain competitive throughput 1/2 in this setting in case packets lengths are pairwise divisible (i.e., any larger is divisible by any smaller).",
keywords = "Adversarial jamming, Competitive throughput, Online algorithms, Packet scheduling, Resource augmentation",
author = "Tomasz Jurdzinski and Kowalski, {Dariusz R.} and Krzysztof Lorys",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-319-18263-6_17",
language = "English (US)",
isbn = "9783319182629",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "193--206",
editor = "Ola Svensson and Evripidis Bampis",
booktitle = "Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers",

}

TY - GEN

T1 - Online packet scheduling under adversarial jamming

AU - Jurdzinski, Tomasz

AU - Kowalski, Dariusz R.

AU - Lorys, Krzysztof

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We consider the problem of scheduling packets of different lengths via a directed communication link prone to jamming errors. Dynamic packet arrivals and errors aremodelled by an adversary. We focus on estimating competitive throughput of online scheduling algorithms. We design an online algorithm for scheduling packets of arbitrary lengths, achieving optimal competitive throughput in (1/3, 1/2] (the exact value depends on packet lengths). Another algorithm we design makes use of additional resources in order to achieve competitive throughput 1, that is, it achieves at least as high throughput as the best schedule without such resources, for any arrival and jamming patterns. More precisely, we show that if the algorithm can run with double speed, i.e., with twice higher frequency, then its competitive throughput is 1. This demonstrates that throughput of the best online fault-tolerant scheduling algorithms scales well with resource augmentation. Finally, we generalize the first of our algorithms to the case of any f ≥ 1 channels and obtain competitive throughput 1/2 in this setting in case packets lengths are pairwise divisible (i.e., any larger is divisible by any smaller).

AB - We consider the problem of scheduling packets of different lengths via a directed communication link prone to jamming errors. Dynamic packet arrivals and errors aremodelled by an adversary. We focus on estimating competitive throughput of online scheduling algorithms. We design an online algorithm for scheduling packets of arbitrary lengths, achieving optimal competitive throughput in (1/3, 1/2] (the exact value depends on packet lengths). Another algorithm we design makes use of additional resources in order to achieve competitive throughput 1, that is, it achieves at least as high throughput as the best schedule without such resources, for any arrival and jamming patterns. More precisely, we show that if the algorithm can run with double speed, i.e., with twice higher frequency, then its competitive throughput is 1. This demonstrates that throughput of the best online fault-tolerant scheduling algorithms scales well with resource augmentation. Finally, we generalize the first of our algorithms to the case of any f ≥ 1 channels and obtain competitive throughput 1/2 in this setting in case packets lengths are pairwise divisible (i.e., any larger is divisible by any smaller).

KW - Adversarial jamming

KW - Competitive throughput

KW - Online algorithms

KW - Packet scheduling

KW - Resource augmentation

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

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

U2 - 10.1007/978-3-319-18263-6_17

DO - 10.1007/978-3-319-18263-6_17

M3 - Conference contribution

AN - SCOPUS:84942526059

SN - 9783319182629

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 193

EP - 206

BT - Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers

A2 - Svensson, Ola

A2 - Bampis, Evripidis

PB - Springer Verlag

ER -