11th EAI International Conference on Performance Evaluation Methodologies and Tools

Research Article

Exact Computation and Bounds for the Coupling Time in Queueing Systems

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.4108/eai.5-12-2017.2274715,
    author={Sebastian  Samain and Ana  Busic},
    title={Exact Computation and Bounds for the Coupling Time in Queueing Systems},
    proceedings={11th EAI International Conference on Performance Evaluation Methodologies and Tools},
    publisher={ACM},
    proceedings_a={VALUETOOLS},
    year={2018},
    month={8},
    keywords={perfect simulation algorithmic complexity queueing systems automata},
    doi={10.4108/eai.5-12-2017.2274715}
}
  • Sebastian Samain
    Ana Busic
    Year: 2018
    Exact Computation and Bounds for the Coupling Time in Queueing Systems
    VALUETOOLS
    ACM
    DOI: 10.4108/eai.5-12-2017.2274715
Sebastian Samain1,*, Ana Busic1
  • 1: INRIA
*Contact email: samain.seb@gmail.com

Abstract

This paper is a work in progress on the exact computation and bounds of the expected coupling time for finite-state Markov chains. We give an exact formula in terms of generating series. We show how this may help to bound the expected coupling time for queueing networks.

Keywords
perfect simulation algorithmic complexity queueing systems automata
Published
2018-08-10
Publisher
ACM
http://dx.doi.org/10.4108/eai.5-12-2017.2274715
Copyright © 2017–2024 ACM
EAI Logo

About EAI

Community

Publish with EAI