COMPARISON OF QUEUES WITH DIFFERENT DISCRETE-TIME ARRIVAL PROCESSES
From MaRDI portal
Publication:2712999
DOI10.1017/S0269964801151016zbMath0977.60097OpenAlexW2086090386MaRDI QIDQ2712999
Publication date: 17 January 2002
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964801151016
uniformizationtandem queueMarkovian arrival processstochastic networkconvex orderingincreasing convex orderingfluid scaling\((\max,+)\) algebraRoss conjecture
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
This page was built for publication: COMPARISON OF QUEUES WITH DIFFERENT DISCRETE-TIME ARRIVAL PROCESSES