An Algebra for Queueing Networks with Time-Varying Service and Its Application to the Analysis of Integrated Service Networks

DOI10.1287/moor.1040.0117zbMath1082.60079OpenAlexW2143492210MaRDI QIDQ5704188

Rajeev Agrawal, Rajendran Rajan, François Baccelli

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8878f5c2fa64c3788ba8836261ea97acc18e0118

zbMATH Keywords

stabilityfluid networkevent graphinf-convolutionfork-join networksaturation throughputPetri-netservice curve(max, plus)-algebraburstiness constraintSkorokhod's reflection maptime-varying service process

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Queueing theory (aspects of probability theory) (60K25) Stochastic stability in control theory (93E15) Communication theory (94A05) Generalizations (16Y99)

Related Items (1)

Asymptotic identity in min-plus algebra: a report on CPNS

This page was built for publication: An Algebra for Queueing Networks with Time-Varying Service and Its Application to the Analysis of Integrated Service Networks