A Single-Server Queue with Cyclostationary Arrivals and Arithmetic Service

Michael Kaplan
Additional contact information
Michael Kaplan: INRS-Télécommunications, Verdun, Québec, Canada

Operations Research, 1983, vol. 31, issue 1, 184-205

Abstract: This paper studies a class of nonblocking single-server queues which arise in connection with the modeling of store-and-forward message-switching multiplexors. The essential feature of these queues is that the input processes are periodic and the service times discrete. The inputs are imagined as representing the aggregate of perhaps many statistically dissimilar streams; the statistics of the interarrival and service times within one period can be complex and arbitrary. We present an exact, transform-domain analysis for steady-state virtual waiting-time. This extends existing literature on periodic queues, and illuminates the precise nature of the trade-off between computational cost and model complexity in the class of models considered. We believe that the generality permitted of the input processes is of practical interest.

Keywords: 689 batch arrivals with periodic statistics; nonrandom service (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.1.184 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:31:y:1983:i:1:p:184-205

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().