Bounds for performance characteristics: a systematic approach via cost structures

DOI10.1080/15326349808807467MaRDI QIDQ4385217zbMATH OpenOpenAlexFDO

Authors G. J. Van Houtum, W. H. M. Zijm, Ivo Adan, J. Wessels

Publication date 20 September 1998

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/0425a15f-9b0e-4a9c-b1b1-f5f272f7b78d

zbMATH Keywords

average costsMarkov chainspossibly infinitely many states

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Dynamic programming (90C39)

Recommendations

• A linear programming approach to Markov reward error bounds for queueing networks
• scientific article; zbMATH DE number 1946759
• Refinable bounds for large Markov chains
• Bounds and error bounds for queueing networks

Cited in

(4)

• Stationary analysis of the shortest queue problem
• Analysis of the shortest relay queue policy in a cooperative random access network with collisions
• A unified ``bang-bang principle with respect to \({\mathcal R}\)-invariant performance benchmarks
• JOIN MINIMUM COST QUEUE FOR MULTICLASS CUSTOMERS: STABILITY AND PERFORMANCE BOUNDS

This page was built for publication: Bounds for performance characteristics: a systematic approach via cost structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385217)