Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-25T07:38:20.109Z Has data issue: false hasContentIssue false

A queue with semiperiodic traffic

Published online by Cambridge University Press:  01 July 2016

Juan Alvarez*
Affiliation:
University of Illinois at Urbana-Champaign
Bruce Hajek*
Affiliation:
University of Illinois at Urbana-Champaign
*
Postal address: Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1308 West Main Street, Urbana, IL 61801, USA.
Postal address: Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1308 West Main Street, Urbana, IL 61801, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, we analyze the diffusion limit of a discrete-time queueing system with constant service rate and connections that randomly enter and depart from the system. Each connection generates periodic traffic while it is active, and a connection's lifetime has finite mean. This can model a time division multiple access system with constant bit-rate connections. The diffusion scaling retains semiperiodic behavior in the limit, allowing for both short-time analysis (within one frame) and long-time analysis (over multiple frames). Weak convergence of the cumulative arrival process and the stationary buffer-length distribution is proved. It is shown that the limit of the cumulative arrival process can be viewed as a discrete-time stationary-increment Gaussian process interpolated by Brownian bridges. We present bounds on the overflow probability of the limit queueing process as functions of the arrival rate and the connection lifetime distribution. Also, numerical and simulation results are presented for geometrically distributed connection lifetimes.

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2005 

Footnotes

Supported by the National Science Foundation under grants NSF ANR 99-80544.

References

Addie, R., Mannersalo, P. and Norros, I. (1999). Performance formulae for queues with Gaussian input. In Teletraffic Engineering in a Competitive World (Proc. Internat. Teletraffic Congress (ITC-16), Edinburgh, 1999), eds Key, P. and Smith, D., Elsevier, Amsterdam, pp. 11691178.Google Scholar
Billingsley, P. (1999). Convergence of Probability Measures, 2nd edn. John Wiley, New York.Google Scholar
Doob, J. L. (1949). Heuristic approach to the Kolmogorov–Smirnov theorems. Ann. Math. Statist. 20, 393403.Google Scholar
Durrett, R. (1996). Probability: Theory and Examples, 2nd edn. Duxbury Press, Belmont, CA.Google Scholar
Hajek, B. (1994). A queue with periodic arrivals and constant service rate. In Probability, Statistics and Optimisation: a Tribute to Peter Whittle, ed. Kelly, F. P., John Wiley, Chichester, pp. 147157.Google Scholar
Karatzas, I. and Shreve, S. E. (1991). Brownian Motion and Stochastic Calculus (Grad. Texts Math. 113), 2nd edn. Springer, New York.Google Scholar
Krunz, M. M. and Makowski, A. M. (1998). Modeling video traffic using M/G/∞ input processes: a compromise between Markovian and LRD models. IEEE J. Select. Areas Commun. 16, 733748.Google Scholar
Norros, I. (2002). Most probable path techniques for Gaussian queueing systems. In Networking 2002 (Proc. 2nd Internat. IFIP-TC6 Network. Conf., Pisa, 2002), eds Gregori, E. et al., Springer, London, pp. 86104.Google Scholar
Pazhyannur, R. S. and Fleming, P. J. (2001). Asymptotic results for voice delay in packet networks. In Proc. IEEE 54th Vehicular Technology Conf., Vol. 3, IEEE, pp. 18611865.Google Scholar
Shorack, G. R. and Wellner, J. A. (1986). Empirical Processes with Applications to Statistics. John Wiley, New York.Google Scholar
Simon, M. K. and Alouini, M.-S. (2000). Digital Communication over Fading Channels: A Unified Approach to Performance Analysis. John Wiley, New York.Google Scholar