Monotonicity of throughput in non-Markovian networks

DOI10.2307/3214323zbMath0673.60097OpenAlexW2067911502MaRDI QIDQ3827368

Pantelis Tsoucas, Jean Walrand

Publication date: 1989

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1903/4822

zbMATH Keywords

blockingthroughput monotonicitycoupling argumentpathwise comparisonnon-Markovian networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov renewal processes, semi-Markov processes (60K15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (15)

A linguistic approach to stochastic comparison of queueing systems ⋮ A decomposition-related throughput property of tandem queueing networks with blocking ⋮ Monotonicity and error bounds for networks of Erlang loss queues ⋮ Structured buffer-allocation problems ⋮ Simple bounds and monotonicity results for finite multi-server exponential tandem queues ⋮ Approximate analysis for queueing networks with finite capacity and customer loss ⋮ Algebraic structure of some stochastic discrete event systems, with applications ⋮ Counterexamples for comparisons of queues with finite waiting rooms ⋮ Error bounds for state space truncation of finite Jackson networks ⋮ Monotonicity properties of cost functions in queueing networks ⋮ Performance bounds on multiserver exponential tandem queues with finite buffers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Note on Time Monotonicity for Performability Models ⋮ On the stability of open networks: A unified approach by stochastic dominance

This page was built for publication: Monotonicity of throughput in non-Markovian networks