Relationship between queue length and waiting time in a stationary discrete-time queue
From MaRDI portal
Publication:4835082
DOI10.1080/15326349508807344zbMath0832.60086OpenAlexW2014469925WikidataQ126242550 ScholiaQ126242550MaRDI QIDQ4835082
Masakiyo Miyazawa, Yoshitaka Yakahashi
Publication date: 13 February 1996
Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326349508807344
marked point processesbatch arrivalssingle server queueprioritiesstationary point processesLittle's formularate conservation law
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
ON THE VARIANCES OF SYSTEM SIZE AND SOJOURN TIME IN A DISCRETE-TIME DAR(1)/D/1 QUEUE ⋮ A Cost-Equation Analysis of General-Input General-Service Processor Sharing System ⋮ A note on the distributional Little's law for discrete-time queues with D-MAP arrivals and its application
This page was built for publication: Relationship between queue length and waiting time in a stationary discrete-time queue