License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2012.507
URN: urn:nbn:de:0030-drops-34133
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3413/

Brázdil, Tomáš ; Kiefer, Stefan

Stabilization of Branching Queueing Networks

pdf-format:
Dokument 1.pdf (676 KB)


Abstract

Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a job at server i may result in the creation of a new job for server j. We propose to extend Jackson networks by "branching" and by "control" features. Both extensions are new and substantially expand the modelling power of Jackson networks. On the other hand, the extensions raise computational questions, particularly concerning the stability of the networks, i.e, the ergodicity of the underlying Markov chain. We show for our extended model that it is decidable in polynomial time if there exists a controller that achieves stability. Moreover, if such a controller exists, one can efficiently compute a static randomized controller which stabilizes the network in a very strong sense; in particular, all moments of the queue sizes are finite.

BibTeX - Entry

@InProceedings{brzdil_et_al:LIPIcs:2012:3413,
  author =	{Tom{\'a}{\v{s}} Br{\'a}zdil and Stefan Kiefer},
  title =	{{Stabilization of Branching Queueing Networks}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{507--518},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{Christoph D{\"u}rr and Thomas Wilke},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3413},
  URN =		{urn:nbn:de:0030-drops-34133},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2012.507},
  annote =	{Keywords: continuous-time Markov decision processes, infinite-state systems, performance analysis}
}

Keywords: continuous-time Markov decision processes, infinite-state systems, performance analysis
Seminar: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Issue date: 2012
Date of publication: 24.02.2012


DROPS-Home | Fulltext Search | Imprint Published by LZI