LOWER BOUNDS FOR LRD/GI/1 QUEUES WITH SUBEXPONENTIAL SERVICE TIMES

DOI10.1017/S0269964804181060zbMATH Open1057.60094OpenAlexW2098261819MaRDI QIDQ4460800

Author name not available (Why is that?)

Publication date: 29 March 2004

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964804181060

zbMATH Keywords

lower boundstationary waiting timesubexponential service timeslong-range dependent arrival process

Mathematics Subject Classification ID

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

Related Items (1)

Tandem queues with subexponential service times and finite buffers

This page was built for publication: LOWER BOUNDS FOR LRD/GI/1 QUEUES WITH SUBEXPONENTIAL SERVICE TIMES

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