 Light traffic approximations in general stationary single-server queuesD. J. Daley and T. Rolski Stochastic Processes and their Applications, 1994, vol. 49, issue 1, 141-158 Abstract: This paper complements two previous studies (Daley and Rolski, 1984, 1991) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-time processes are derived, reflecting respectively the stationary time-sampling frame that may be appropriate for monitoring the system as a whole, and the customer-sampling frame (Palm distributions). Substantially different results can come from these two different views, and when compounded with the different approaches to the light traffic limits, no single light traffic scenario emerges. Keywords: G/GI/1; queue; stationary; point; process; with; multiple; points; light; traffic; queue; with; batch; arrivals (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:49:y:1994:i:1:p:141-158 Ordering information: This journal article can be ordered from Access Statistics for this article Stochastic Processes and their Applications is currently edited by T. Mikosch More articles in Stochastic Processes and their Applications from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.