A Source traffic model and its transient analysis for network control

Traffic measurements from communication networks have shown that network traffic is quite complex, exhibiting phenomena such as long-tail probability distributions, long-range dependence and self similarity. Thus, in order to design and control new communication networks, we are motivated to consider new source traffic models and new ways to analyze network performance when there are many independent sources each with traffic that can be described by such models. We present a candidate source traffic model: The required bandwidth (arrival rate) as a function of time for each source is represented as the sum of two stochastic processes: (1) a macroscopic (longer-time-scale) level process and (2) a microscopic (shorter-time-scale) within-level variation process. We let the level process be a finite-state semi-Markov process (SMP), allowing general (possibly long-tail) level holding-time distributions, and we let the within-level variation process be a zero-mean piecewise-stationary process. To cope with the added model complexity, we suggest making design and control decisions based on the likelihood that aggregate demand (the input rate from a set of sources) will exceed capacity (the maximum possible output rate). This approach to model analysis avoids the customary queueing detail (focus on buffer content and overflow). We propose using transient analysis for control, conditioning on the level and elapsed level holding time of each source. In doing so, we exploit asymptotics associated with multiplexing a large number of sources.

[1]  B. Gnedenko,et al.  Limit Distributions for Sums of Independent Random Variables , 1955 .

[2]  K. Chung,et al.  Limit Distributions for Sums of Independent Random Variables , 1955 .

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[4]  Erhan Çinlar,et al.  Introduction to stochastic processes , 1974 .

[5]  Antoine-S Bailly,et al.  Science régionale - Walter Isard, Introduction to régional science. Englewood Cliffs (NJ), Prentice-Hall, 1975 , 1975 .

[6]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[7]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[8]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[9]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[10]  Hong Chen,et al.  Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations , 1991, Math. Oper. Res..

[11]  Peter B. Danzig,et al.  Characteristics of wide-area TCP/IP conversations , 1991, SIGCOMM '91.

[12]  M. A. Johnson,et al.  An investigation of phase-distribution moment-matching algorithms for use in queueing models , 1991, Queueing Syst. Theory Appl..

[13]  Ward Whitt,et al.  The Fourier-series method for inverting transforms of probability distributions , 1992, Queueing Syst. Theory Appl..

[14]  J. W. Roberts,et al.  Performance evaluation and design of multiservice networks , 1992 .

[15]  Walter Willinger,et al.  On the Self-Similar Nature of Ethernet Traffic ( extended version ) , 1995 .

[16]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[17]  V. Paxson,et al.  Wide-area traffic: the failure of Poisson modeling , 1994, SIGCOMM.

[18]  W. Whitt,et al.  The transient BMAP/G/l queue , 1994 .

[19]  Kin K. Leung,et al.  Traffic models for wireless communication networks , 1994, IEEE J. Sel. Areas Commun..

[20]  David Tse,et al.  RCBR: a simple and efficient service for multiple time-scale traffic , 1995, SIGCOMM '95.

[21]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

[22]  Debasis Mitra,et al.  Markovian Arrival and Service Communication Systems: Spectral Expansions, Separability and Kronecker-Product Forms , 1995 .

[23]  Ward Whitt,et al.  Numerical Inversion of Laplace Transforms of Probability Distributions , 1995, INFORMS J. Comput..

[24]  Ward Whitt,et al.  Squeezing the Most Out of ATM , 1995, IEEE Trans. Commun..

[25]  Ward Whitt,et al.  On the Laguerre Method for Numerically Inverting Laplace Transforms , 1996, INFORMS J. Comput..

[26]  Ren Asmussen,et al.  Fitting Phase-type Distributions via the EM Algorithm , 1996 .

[27]  W. Turin Fitting probabilistic automata via the em algorithm , 1996 .

[28]  Ward Whitt,et al.  Squeezing the Most Out of ATM , 1995, IEEE Trans. Commun..

[29]  Ward Whitt,et al.  Server Staffing to Meet Time-Varying Demand , 1996 .

[30]  Donald F. Towsley,et al.  Supporting stored video: reducing rate variability and end-to-end resource requirements through optimal smoothing , 1996, SIGMETRICS '96.

[31]  Mark Crovella,et al.  Self-Similarity in World Wide Web Traffic: Evidence and Causes , 1996, SIGMETRICS.

[32]  Albert G. Greenberg,et al.  Resource Sharing for Book-Ahead and Instantaneous-Request Calls Using a CLT Approximation , 1999, TNET.

[33]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1997, TNET.

[34]  David Tse,et al.  RCBR: a simple and efficient service for multiple time-scale traffic , 1997, TNET.

[35]  Anja Feldmann,et al.  Fitting mixtures of exponentials to long-tail distributions to analyze network performance models , 1997, Proceedings of INFOCOM '97.

[36]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

[37]  Ward Whitt,et al.  Control and recovery from rare congestion events in a large multi-server system , 1997, Queueing Syst. Theory Appl..

[38]  Albert G. Greenberg,et al.  Admission control for booking ahead shared resources , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[39]  R. Srikant,et al.  Resource sharing for book-ahead and instantaneous-request calls , 1999, TNET.