Distributed online and stochastic queueing on a multiple access channel

Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

We consider the problems of online and stochastic packet queueing in a distributed system of n nodes with queues, where the communication between the nodes is done via a multiple access channel. In the online setting, in each round, an arbitrary number of packets can be injected to nodes' queues. Two measures of performance are considered: the total number of packets in all queues, called the total load, and the maximum queue size, called the maximum load. We develop a deterministic distributed algorithm that is asymptotically 1 optimal with respect to both complexity measures, in a competitive way. More precisely, the total load of our algorithm is bigger than the total load of any other algorithm, including centralized online solutions, by only an additive term of O(n2), whereas the maximum queue size of our algorithm is at most n times bigger than the maximum queue size of any other algorithm, with an extra additive O(n). The optimality for both measures is justified by proving the corresponding lower bounds, which also separates nearly exponentially distributed solutions from the centralized ones. Next, we show that our algorithm is also stochastically stable for any expected injection rate smaller or equal to 1. This is the first solution to the stochastic queueing problem on a multiple access channel that achieves such stability for the (highest possible) rate equal to 1.

Original languageEnglish (US)
Article number21
JournalACM Transactions on Algorithms
Volume14
Issue number2
DOIs
StatePublished - Jun 2018
Externally publishedYes

    Fingerprint

Keywords

  • Contention resolution
  • Distributed algorithms
  • Multiple access channel
  • Online algorithms
  • Shared channel
  • Stability
  • Stochastic queueing

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

Cite this