Stochastic monotonicity in queueing networks

Abstract : Stochastic monotonicity is one of the sufficient conditions for stochastic comparisons of Markov chains. On a partially ordered state space, several stochastic orderings can be defined by means of increasing sets. The most known is the strong stochastic (sample-path) ordering, but weaker orderings (weak and weak*) could be defined by restricting the considered increasing sets. When the strong ordering could not be defined, weaker orderings represent an alternative as they generate less constraints. Also, they may provide more accurate bounds. The main goal of this paper is to provide an intuitive event formalism added to stochastic comparisons methods in order to prove the stochastic monotonicity for multidimensional Continuous Time Markov Chains (CTMC). We use the coupling by events for the strong monotonicity. For weaker monotonicity, we give a theorem based on generator inequalities using increasing sets. We prove this theorem, and we present the event formalism for the definition of the increasing sets. We apply our formalism on queueing networks, in order to establish monotonicity properties
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01366211
Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Submitted on : Wednesday, September 14, 2016 - 11:23:33 AM
Last modification on : Tuesday, January 22, 2019 - 2:32:06 PM

Links full text

Identifiers

Citation

Hind Castel-Taleb, Nihal Pekergin. Stochastic monotonicity in queueing networks. EPEW 2009 : 6th European Performance Engineering Workshop, Jul 2009, Imperial College London United Kingdom. pp.116 - 130, ⟨10.1007/978-3-642-02924-0_10⟩. ⟨hal-01366211⟩

Share

Metrics

Record views

57