An algorithm approach to bounding aggregations of multidimensional Markov chains

DOI10.1016/j.tcs.2012.05.030zbMath1247.68194OpenAlexW2033789249MaRDI QIDQ714783

Nihal Pekergin, Lynda Mokdad, Hind Castel-Taleb

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.030

zbMATH Keywords

Markov chainsstochastic boundsqueueing networks

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A coupling technique for stochastic comparison of functions of Markov processes
• Stochastic Comparison of Queueing Networks
• Stochastic Orderings for Markov Processes on Partially Ordered Spaces
• A simple coupling of renewal processes
• Bounds on the end-to-end loss probability for queues in Series with Finite Capacity
• Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
• Queueing Networks and Markov Chains
• Stochastic Monotonicities in Jackson Queueing Networks