An Algebra for Queueing Networks with Time-Varying Service and Its Application to the Analysis of Integrated Service Networks
DOI10.1287/moor.1040.0117zbMath1082.60079MaRDI 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
stability; fluid network; event graph; inf-convolution; fork-join network; saturation throughput; Petri-net; service curve; (max, plus)-algebra; burstiness constraint; Skorokhod's reflection map; time-varying service process
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
60K25: Queueing theory (aspects of probability theory)
93E15: Stochastic stability in control theory
94A05: Communication theory
16Y99: Generalizations
Related Items