Abstract
The infinite server model of Cox with arbitrary service time distribution appears to provide a large class of traffic models - Pareto and log-normal distributions have already been reported in the literature for several applications. Here we begin the analysis of the large buffer asymptotics for a multiplexer driven by this class of inputs. To do so we rely on recent results by Duffield and O’Connell on overflow probabilities for the general single server queue. In this paper we focus on the key step in this approach: The appropriate large deviations scaling is shown to be related to the forward recurrence time of the service time distribution, and a closed form expression is derived for the corresponding generalized limiting log-moment generating function associated with the input process. Three different regimes are identified. In a companion paper we apply these results to obtain the large buffer asymptotics under a variety of service time distributions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.G. Addie, M. Zukerman and T. Neame, Fractal traffic: Measurements, modeling and performance evaluation, in: Proceedings of INFOCOM '95, Boston, MA (April 1995) pp. 985–992.
J. Beran, R. Sherman, M.S. Taqqu and W. Willinger, Long-range dependence in variable bit-rate video traffic, IEEE Trans. Commun. 43 (1995) 1566–1579.
D.R. Cox, Long-range dependence: A review, in: Statistics: An Appraisal, eds. H.A. David and H.T. David (The Iowa State University Press, Ames, IA, 1984) pp. 55–74.
D.R. Cox and V. Isham, Point Processes (Chapman and Hall, New York, NY, 1980).
A. Dembo and O. Zeitouni, Large Deviation Techniques and Applications (Jones and Bartlett, Boston, MA, 1993).
N.G. Duffield and N. O'Connell, Large deviations and overflow probabilities for the general single server queue, with applications, Proceedings of the Cambridge Philosophical Society 118 (1995) 363–374.
A. Erramilli, O. Narayan and W. Willinger, Experimental queuing analysis with long-range dependent packet traffic, IEEE/ACM Trans. Networking 4 (1996) 209–223.
J.D. Esary, F. Proschan and D.W. Walkup, Association of random variables, with applications, Ann. Math. Statist. 38 (1967) 166–1474.
H.J. Fowler and W.E. Leland, Local area network traffic characteristics, with implications for broadband network congestion management, IEEE J. Selected Areas Commun. 9 (1991) 1139–1149.
M. Garrett and W. Willinger, Analysis, modeling and generation of self-similar VBR video traffic, in: Proceedings of SIGCOMM '94 (September 1994) pp. 269–280.
P.W. Glynn and W. Whitt, Logarithmic asymptotics for steady-state tail probabilities in a single-server queue, J. Appl. Probab. 31 (1994) 131–159.
F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).
G. Kesidis, J. Walrand and C.S. Chang, Effective bandwidths for multiclass Markov fluids and other ATM sources, IEEE/ACM Trans. Networking (1993) 424–428.
W. Leland, M. Taqqu, W. Willinger and D. Wilson, On the self-similar nature of Ethernet traffic (extended version), IEEE/ACM Trans. Networking 2 (1994) 1–15.
N. Likhanov, B. Tsybakov and N.D. Georganas, Analysis of an ATM buffer with self-similar (fractal) input traffic, in: Proceedings of INFOCOM '95, Boston, MA (April 1995) pp. 985–992.
M. Livny, B. Melamed and A.K. Tsiolis, The impact of autocorrelation on queueing systems, Management Science 39 (1993) 322–339.
R.M. Loynes, The stability of a queue with non-independent inter-arrival and service times, Proceedings of the Cambridge Philosophical Society 58 (1962) 497–520.
I. Norros, A storage model with self-similar input, Queueing Systems 16 (1994) 387–396.
M. Parulekar and A.M. Makowski, Tail probabilities for a multiplexer with self-similar traffic, in: Proceedings of INFOCOM' 96, San Francisco, CA (April 1996) pp. 1452–1459.
M. Parulekar and A.M. Makowski, Buffer overflow probabilities for a multiplexer with self-similar traffic, Technical Report TR-95-67, Institute for Systems Research, University of Maryland, College Park, MD (1995).
M. Parulekar and A.M. Makowski, Tail probabilities for M/G/∞processes (II): Buffer asymptotics, in preparation.
M. Parulekar and A.M. Makowski, Asymptotic tail probabilities for general single server queues: Another look, in preparation.
M. Parulekar and A.M. Makowski, M/G/∞ Input processes: A versatile class of models for network traffic, in: Proceedings of INFOCOM' 97, Kobe, Japan (April 1997) pp. 419–426.
M. Parulekar, Buffer engineering for M/G/∞ input processes, Ph.D. thesis, Electrical Engineering Department, University of Maryland, College Park, MD (expected December 1997).
V. Paxson and S. Floyd, Wide area traffic: The failure of Poisson modeling, IEEE/ACM Trans. Networking 3 (1993) 226–244.
W. Willinger, M.S. Taqqu, W.E. Leland and D.V. Wilson, Self-similarity in high-speed packet traffic: Analysis and modeling of ethernet traffic measurements, Statist. Sci. 10 (1995) 67–85.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Parulekar, M., Makowski, A.M. Tail probabilities for M/G/∞ input processes (I): Preliminary asymptotics. Queueing Systems 27, 271–296 (1997). https://doi.org/10.1023/A:1019122400632
Issue Date:
DOI: https://doi.org/10.1023/A:1019122400632