Research Article | Open Access

# Abstract Description of Internet Traffic of Generalized Cauchy Type

**Academic Editor:**Zidong Wang

#### Abstract

Self-similar process with long-range dependence (LRD), that is, fractional Gaussian noise (fGn) with LRD is a widely used model of Internet traffic. It is indexed by its Hurst parameter
that linearly relates to its fractal dimension . Note that, on the one hand, the fractal dimension of traffic measures local self-similarity. On the other hand, LRD is a global property of traffic, which is characterized by its Hurst parameter . However, by using fGn, both the self-similarity and the LRD of traffic are measured by
. Therefore, there is a limitation for fGn to accurately model traffic. Recently, the generalized Cauchy (GC) process was introduced to model traffic with the flexibility to separately measure the fractal dimension
and the Hurst parameter of traffic. However, there is a fundamental problem whether or not there exists the generality that the GC model is more conformable with real traffic than single parameter models, such as fGn, *irrelevant of traffic traces used in experimental verification*. The solution to that problem remains unknown but is desired for model evaluation in traffic theory or for model selection against specific issues, such as queuing analysis relating to the autocorrelation function (ACF) of arrival traffic. The key contribution of this paper is our solution to that fundamental problem (see Theorem 3.17) with the following features in analysis. (i) Set-valued analysis of the traffic of the fGn type. (ii) Set-valued analysis of the traffic of the GC type. (iii) Revealing the generality previously mentioned by comparing metrics of the traffic of the fGn type to that of the GC type.

#### 1. Introduction

This paper explores the Internet traffic (traffic for short) modeling which plays a role in telecommunications [1]. Let be an arrival traffic function, implying the number of bytes in the th packet arriving at , where is the timestamp of the th packet [2]. To avoid confusion, we use and to represent a traffic time series in the continuous case and the discrete one, respectively, where implies the size of the th packet. Note that traffic statistics for corresponds with the statistics of the traffic time series represented by either byte count or packet size [3].

The pioneer in stochastic modeling of traffic refers to the Danish scientist A. K. Erlang, see Bojkovic et al. [4]. As early as the 1920s, he contributed to his experimental work on the statistics of the traffic in telephony networks and introduced the traffic models of the Poisson type [5, 6]. Erlang’s work was so successful in characterizing the old telephony traffic such that it was applied as a law in traffic engineering, see for example, Yue et al. [7], Papoulis [8], Gibson [9], Cooper [10], Pitts and Schormans [11], and McDysan [12]. Note that the autocorrelation function (ACF) of the traffic of the Poisson type, which is Markovian, is exponentially decayed [13]. In fact, the ACF of a Markov process decays exponentially [14]. The Poisson-type models fit in with the traffic in old telephony networks, which are circuit-switched, see for example, [9], Le Gall [15], Lin et al. [16], Manfield and Downs [17], Reiser [18], and Lu [19]. Those types of models, however, fail to effectively characterize the traffic in the Internet, which is packet switched. As a matter of fact, the ACF, the probability density function (PDF), and the power spectrum density (PSD) function of traffic, follow power law, see for example, Resnick [20], Csabai [21], Leland et al. [22], Beran et al. [23], López-Ardao et al. [24], and Cleveland and Sun [25]. Therefore, system responses to the Internet have to take into account the arrival traffic with long-range dependence (LRD), see for example, Tsybakov and Georganas [26], Norros [27], Fishman and Adan [28], Li and Zhao [29], Dahl and Willemain [30], and Kingman [31].

Theoretically, on one hand, Taqqu’s Theorem relates a heavy-tailed PDF in power law to a hyperbolically decayed ACF, that is, power law-type ACF [3, 32]. On the other hand, the Fourier transform connects a hyperbolically decayed ACF with noise (power law-type PSD), see for example, Li [33].

Note that, before the Internet’s worldwide prevalence, in the seventies of the last century, Tobagi et al. [34] reported a noticeable behavior of traffic, which is called “burstiness” [12]. It implies that there would be no packets transmitted for a while, then flurry of transmission, no transmission for another long period of time, and so on if one observes traffic over a long period of time. This also means that traffic has intermittency. In 1986, Jain and Routhier [35] further described the intermittency or burstiness of traffic using the term “packet trains.” They inferred that traffic is neither a Poisson process nor a compound Poisson one [35]. The results in [34, 35] are quite qualitative but they may be considered as early work with respect to fractal-type traffic. The concept of packet train is interesting [36] but we utilize the concept of fractal time series for traffic modeling in this paper.

The early literature quantitatively describing the statistical properties of traffic from a view of fractals refers to Csabai [21], Leland et al. [22], Beran et al. [23], Paxson and Floyd [37], and Crovella and Bestavros [38]. Those scientists revealed some of the main properties of traffic, such as LRD and asymptotic self-similarity. The traffic model described in [22, 23, 37, 39–43], just citing a few, is the fGn that was introduced by Mandelbrot and Van Ness in mathematics [44].

The model of fGn is characterized by a single parameter , called the Hurst parameter. Its limitation in accurately modeling traffic was noticed by Paxson and Floyd [37], and Tsybakov and Georganas [39]. Paxson and Floyd noted that “it might be difficult to characterize the correlations over the entire traffic traces with a single Hurst parameter [37, Section 7.4].” They suggested that “further work is required to fully understand the correlational structure of wide-area traffic [37].” Tsybakov and Georganas remarked that “the class of exactly self-similar processes, that is, fGn or fractional Brownian motion (fBm), is too narrow for modeling actual network traffic [39, Section II].” The authors of [37, 39] qualitatively stated the limitation of fGn in traffic modeling without mentioning how to release the limitation. In this regard, Beran [45, page 101-102] suggested to develop a sufficiently flexible class of parametric correlation models. The key of the Beran’s idea implies that the ACF of an LRD series may be fitted by a correlation model with several parameters instead of one, but he did not mention what concrete parametric correlation models are.

Li and Lim recently reported a two-parameter traffic model called the GC process with the demonstrations based on sets of real-traffic traces in [46, 47]. Li [48] discussed its simulation. Nevertheless, whether or not it has the generality to be more agreement with traffic than single parameter models, such as fGn, remains an unsolved problem. Therefore, it may be useful, especially for traffic engineers, to exhibit that generality. Motivated by this, we, in this paper, aim at presenting a solution to it based on the abstract analysis, more precisely, the set-valued analysis in Hilbert spaces, to thoroughly reveal that generality, irrelevant of traces used in experimental verification. To the best of our knowledge, the set-valued analysis of traffic models is rarely seen.

The rest of paper is organized as follows. Related work is explained in Section 2. The set-valued analysis is presented in Section 3. An application case is demonstrated in Section 4. Discussions are provided in Section 5, followed by our conclusions.

#### 2. Related Work

We first respectively brief the ACFs of the fGn and the GC process. Then, fractal dimension and the Hurst parameter are discussed.

##### 2.1. fGn

The continuous fGn is the derivative of the smoothed fractional Brownian motion (fBm) in the sense of the generalized functions over the Schwartz space of test functions, refer to Kanwal [49] for generalized functions.

Denote by the ACF of the fGn as the increment process of the fBm of the Weyl type. Then, for time lag , which is the set of real numbers, where is the Hurst parameter, is used by smoothing the fBm so that the smoothed fBm is differentiable, and [44]. The PSD of fGn is given by [50] where is angular frequency.

FGn includes three classes of time series. When is positive and finite for all . It is nonintegrable and the corresponding series is LRD. For , the integral of is zero, corresponding series with short-range dependence (SRD). Besides for changes its sign and becomes negative for some proportional to . It reduces to the white noise when .

The ACF of fGn in the discrete case is given by where , where is the set of integers. To avoid confusion, we often consider ACFs for in the normalized case in what follows as an ACF is an even function. Thus, for , one has Considering the right side of (2.4) as the finite 2-order difference of and approximating it with the 2-order differential of yields the following equation. Its right side is quite accurate to the left for [51]:

##### 2.2. GC Process

A random function is called the GC process if it is stationary Gaussian with the ACF given by where and . When , one gets the usual Cauchy process the ACF of which is expressed by which is used in geostatistics, see Chilès and Delfiner [52].

The PSD of the GC process is given by (see [47]) where and

The PSD of the GC process for is given by (see [53]) On the other hand, for is given by The above exhibits the power law of . The GC process is LRD if and is SRD if .

As noted in [53], “the GC process is non-Markovian since does not satisfy the triangular relation given by which is a necessary condition for a Gaussian process to be Markovian, see Todorovic [54].” In fact, up to a multiplicative constant, the Ornstein-Uhlenbeck process is the only stationary Gaussian Markov process, see Lim and Muniandy [55] and Wolpert and Taqqu [56].

##### 2.3. Fractal Dimension and the Hurst Parameter

On the one hand, fractal dimension, denoted by , of traffic is a measure to characterize its local self-similarity or irregularity. On the other hand, the Hurst parameter is used to measure its statistical dependence, see Mandelbrot [57]. Thus, we respectively use and to describe the local property and the global property of , see Li and Lim [46, 47] and Li and Zhao [58]. In fact, if the ACF is sufficiently smooth on and if where is a constant and is the fractal index of , of is expressed by see, for example, Kent and Wood [59], Hall and Roy [60], Chan et al. [61], and Adler [62]. Applying the binomial series to yields Therefore, one has Consequently, the fGn, as the incremental process of the fBm of the Weyl type, is stationary. Its happens to linearly relate to its , see [57, page 27] and Gneiting and Schlather [63]. Hence, a single parameter model fails to separately capture the local irregularity and the LRD of traffic.

Recall that a self-similar process with the self-similarity index requires for , where denotes equality in joint finite distribution. It is known that a stationary Gaussian random function that is not exactly self-similar may satisfy a weaker self-similar property known as local self-similarity. Taking into account the definition of the local self-similarity provided in [59–62], we say that a Gaussian stationary process is locally self-similar of order if its ACF satisfies for , The fractal dimension of a locally self-similar process of order is given by (2.14). Therefore, we have the asymptotic expressions given by

Note that traffic is LRD if its ACF satisfies where . Denote by and the fractal dimension and the Hurst parameter of traffic of the GC type, respectively. Then, according to (2.19), one has Replacing and , respectively, by and according to (2.21), we have where is independent of . Thus,

#### 3. Set-Valued Analysis

A physically measured traffic trace has single history with finite length. Without losing generality, the maximum possible length of a traffic series is assumed as . Let be a space containing all ACFs, including ACFs of real traffic. Let be an ACF of a real-traffic series. Define the norm of as an inner product given by Then, the inner space given by is a Hilbert space when all limits are included [64, 65].

*Remark 3.1. * is a finite-dimensional normed space.

Now, we consider the following consequences of a linear normed space with finite dimensions.

Lemma 3.2. *In a linear finite-dimensional space, all norms are equivalent [66].*

Lemma 3.3. *Every finite-dimensional subspace of a linear normed space is closed [67].*

Lemma 3.4. *Let be a Hilbert space and be a closed subspace of . Let , . Then there exists a unique element satisfying [66, 67], Aubin [68].*

From the above, we obtain the following theorem. Its proof is straightforward according to Lemmas 3.2–3.4.

Theorem 3.5. *Let be an ACF of a real-traffic series. Let be a closed subspace of . Then, there exists a unique such that [64, 65].*

Let be the error. Its norm is defined by Let the functional of be . Then, is convex. Thus, the optimal approximation of in can be expressed by

Suppose has parameters such that Then, the error by taking the approximation (3.5) as a traffic model is a function of . To clarify this point, we utilize the cost function of dimensions expressed by The partial derivative of with respect to parameters, which will be zero at the minimum, yields [69] Let be the solution of . Then, is the optimal approximation of in .

The above discussions draw attention to the fact that an optimal approximation of in may have parameters. Obviously, an approximation of is related to a subspace of as can be seen from Theorem 3.5. For this reason, we, below, consider the extensions of the fGn’s ACF towards constructing the ACF of the GC process.

*Definition 3.6. *Let be a Hilbert space equipped with a distance . When is a subset of , the distance from to is denoted by [70, 71].

*Definition 3.7 (see [70]). *Let be a sequence of subspaces of a Hilbert space . Then, the subset
is the upper limit of the sequence . Besides, the subset
is the lower limit of . A subset is said to be the limit or the set limit of if

Considering the above terms, one has the lemma below.

Lemma 3.8. *Any monotone sequence of subsets has a limit [70].*

According to Lemma 3.8, therefore, the following holds.

Corollary 3.9 (see [70, 71]). *Let be a family of increasing closed subspaces of a Hilbert space . Then,
*

We now turn to constructing the ACF of the GC process.

Corollary 3.10. *. *

*Proof. *According to (2.5), this corollary results.

Let Then, is the set containing the ACF of fGn. Therefore, we have the following remark.

*Remark 3.11. *. Besides, it is closed according to Lemma 3.3.

We now construct the second space. Let be the set containing ACFs of traffic in the form for . Then, According to Corollary 3.10, element in is an approximation of the ACF of fGn. Hence, we have . Based on , we further construct a space as follows.

Proposition 3.12. *The following is an extension of , where ;
*

*Proof. * equals to for , meaning . Thus, this proposition results.

*Remark 3.13. * is nonintegrable for because . Clearly, . In addition, it is closed according to Lemma 3.3.

The space can be further extended into the following.

Proposition 3.14. *The following is an extension of ;
**
where , , .*

*Proof. * is a special case of for , implying . Thus, Proposition 3.14 holds.

According to Proposition 3.14, therefore, we have the remarks below.

*Remark 3.15. * is nonintegrable for because . Clearly, . It is closed according to Lemma 3.3.

*Remark 3.16. *Proposition 3.14 presents a class of parametric ACF structures.

From the above, we have the theorem below.

Theorem 3.17. *Let be an ACF of real traffic. Then,
*

*Proof. *Because , Theorem 3.17 holds according to Corollary 3.9.

Theorem 3.17 exhibits the generality of the GC process in accurate modeling of traffic. In what follows, we let and so as to be consistent with (2.6) in computations.

In the end of this section, we note that the purpose for using the abstract expression of -parameter model (3.5) as well as (3.6) and (3.7) is simply to mention the concept of multiparameter model of ACF. For traffic, the GC model equipped with two parameters can be well explained because one parameter is the fractal index for local property and the other the LRD index for global one.

#### 4. Application of Theorem 3.17 to Traffic Modeling

As an application of Theorem 3.17, we show the ACF modeling of of real-traffic trace named by AMP-1131669938-1.psize, which was collected by the US National Laboratory for Applied Network Research (NLANR) in November 2005 [73]. We first model it in . Then, we compare it with that in (i.e., fGn model). Because , we use in this section.

Denote the measured ACF of by . Denote by and the modeled ACFs in and , respectively. Let be the mean square error (MSE) by using and be the MSE by using . For the sake of demonstration, we use (4.1) for the MSE in and (4.2) for that in ;

Figure 1(a) shows the first 2048 points of AMP-1131669938-1.psize. Figure 1(b) is the right part, that is, the part for , of the measured ACF with the block size and average count = 30. By least squares fitting, we obtain the estimates = (0.020, 0.028). Thus, we have with . Figure 1(c) shows and Figure 1(d) indicates that fits well with . Figure 2 illustrates the estimates of and . According to (2.21), and of that series equal to 0.986 and 1.990, respectively.

**(a)**

**(b)**

**(c)**

**(d)**

**(a)**

**(b)**

With least squares fitting in , however, we have with . Figure 3(a) plots the and Figure 3(b) shows the data fitting in . Figures 1(d) and 3(b) exhibit an application case of (3.16) in Theorem 3.17. Judging from them, it is obvious that the GC process is more effective with that trace for both short-term and long-term lags.

**(a)**

**(b)**

Purely from a view of curve fitting, the fitting accuracy of 10^{−3} in may not be too large. The unsatisfactory point of the modeling in is in two aspects. One is that may overestimate autocorrelations of traffic for small lags (around the knee of the ACF curve). The other is that it may underestimate autocorrelations for large lags as evidenced by Figure 3(b), refer to Li and Lim [46] for more cases regarding modeling real-traffic traces in .

#### 5. Discussion

A conventional method to assess whether a model is appropriate is goodness-of-fit test in statistics ([3, 69], Press et al. [74]). However, it still needs sets of traffic data involved in the test. In fact, experimental processing of specific sets of real traffic, no matter how many traces are involved in experimental verification or goodness-of-fit test, may not deterministically infer the generality of the GC process expressed by Theorem 3.17, theoretically speaking.

Recall that an ACF of arrival traffic has a considerable impact on queuing systems, see, for example, Hajek and He [75], Livny et al. [72], Li and Hwang [76, 77], Wittevrongel and Bruneel [78], and Geist and Westall [79]. Therefore, using the ACF of the arrival traffic of the GC type may bring in considerable advances in practice, such as system analysis or evaluation, which we will work on in the future.

The GC model has one significance to separately characterize the local self-similarity and the LRD. In the case study in the previous section, we have and for AMP-1131669938-1.psize. Both and are of large value for this trace since for LRD and . Note that a large value of corresponds to strong LRD while a large value of implies highly local irregularity. The phenomenon of traffic like this was demonstrated with more real-traffic traces in [46]. This phenomenon may not be satisfactorily observed using single parameter models, that is, fGn due to the restrictive relationship .

The GC model has another significance to explain the complicated phenomenon of traffic, which was observed by Paxosn and Floyd [37] and Feldmann et al. [80], and which was stated like this. Traffic has robust long-term persistence at large time scales but high irregularity at small time scales. This phenomenon may be described by , where and are the fractal dimension and the Hurst parameter of traffic in the th interval on an interval-by-interval basis for , respectively. This complicated phenomenon of traffic can be well characterized by the GC model because is independent of , refer to [46] for the demonstrations of this phenomenon with real traffic. Again, we note that it may not be described by single parameter models, such as fGn. In fact, because and are restricted by .

The third significance of the traffic model of the GC type can be briefed as follows. It is well known that the amount of traffic accumulated in the interval is upper bounded by where and are constants and , see Cruz [81]. It is obviously that a tightened bound of is particularly desired in practice, such as delay computations. By applying the GC model to the traffic bound, we have the tightened bound expressed by where is a small-scale factor, is a large-scale factor, and , is the unit step function, see Li and Zhao [58] for details. For instance, if we let , , , and , then we have a tightened bound given by The conventional traffic bound, that is, the right side of (5.1), is a special case of (5.2) for . We should emphasize that the fractal dimension and the Hurst parameter in (5.2) have to be considered in the sense of the GC model of traffic [58].

Our future work is in two ways. One is to explore more specific significances of the GC model of traffic in practical issues, for example, queuing. The other is to study whether the GC model of random processes may provide new explanation for the random phenomena in nonlinear time-varying systems or complex systems discussed by Dong et al. [82–84], and Shen et al. [85–87], Chen et al. [88], and Sheng et al. [89, 90].

#### 6. Conclusions

FGn, which is a self-similar process with LRD for and a widely used model in traffic engineering, was proposed as a traffic model by Leland et al. [22], Beran et al. [23], and Paxson and Floyd [37], based on their data processing of sets of real-traffic traces. The GC process, which is a locally self-similar process with LRD for , was recently reported by Li and Lim [46], also based on their processing the same sets of traffic traces as those in [22, 37]. However, experimental processing of real traffic relying on selected sample records of traffic may be limited, in methodology, to be used to abstractly evaluate which is more conformable with real traffic without relating to the selected sample records of traffic. The theoretical significance of this paper is to provide us with the abstract assessment in terms of the generality described by (3.16) in Theorem 3.17 that the GC model is more conformable with real traffic than single parameter models, for example, fGn, regardless of any sample records of traffic, which may yet be a theoretical supplement with respect to the traffic model of the GC type. In addition, we have given our construction procedure of the ACF of the GC process in Hilbert spaces with the technique of extensions based on fGn.

#### Acknowledgments

This paper was supported in part by the National Natural Science Foundation of China under the project Grant numbers 60873264 and 61070214, the 973 plan under the project number 2011CB302801/2011CB302802, and by the University of Macau. Thanks go to NLANR for allowing the authors to use its real-traffic data in the research.

#### References

- H. Akimaru and K. Kawashima,
*Teletraffic: Theory and Applications*, Springer, New York, NY, USA, 1993. - M. Li, W. Jia, and W. Zhao, “Correlation form of timestamp increment sequences of self-similar traffic on Ethernet,”
*Electronics Letters*, vol. 36, no. 19, pp. 1668–1669, 2000. View at: Publisher Site | Google Scholar - P. Abry, P. Borgnat, F. Ricciato, A. Scherrer, and D. Veitch, “Revisiting an old friend: on the observability of the relation between long range dependence and heavy tail,”
*Telecommunication Systems*, vol. 43, no. 3-4, pp. 147–165, 2010. View at: Publisher Site | Google Scholar - Z. Bojkovic, M. Bakmaz, and B. Bakmaz, “Originator of teletraffic theory,”
*Proceedings of the IEEE*, vol. 98, no. 1, pp. 123–127, 2010. View at: Publisher Site | Google Scholar - A. K. Erlang, “Telefon-ventetider. et stykke sandsynlighedsregning,”
*Matematisk Tidsskrift B*, vol. 31, pp. 25–42, 1920. View at: Google Scholar - E. Brockmeyer, H. L. Halstrøm, and A. Jensen, “The life of A. K. Erlang,”
*Transactions of the Danish Academy of Technical Sciences*, no. 2, pp. 23–100, 1948. View at: Google Scholar - W. Yue, H. Takagi, and Y. Takahashi,
*Advances in Queueing Theory and Network Applications*, Springer, New York, NY, USA, 2009. - A. Papoulis,
*Probability, Random Variables and Stochastic Processes*, McGraw-Hill Series in Electrical Engineering. Communications and Information Theory, McGraw-Hill, New York, NY, USA, 4th edition, 2002. - J. D. Gibson,
*The Communications Handbook*, IEEE Press, New York, NY, USA, 1997. - R. B. Cooper,
*Introduction to Queueing Tehory*, Elsevier, New York, NY, USA, 2nd edition, 1981. - J. M. Pitts and J. A. Schormans,
*Introduction to ATM Design and Performance: With Applications Analysis Software*, John Wiley & Sons, New York, NY, USA, 1996. - D. McDysan,
*QoS & Traffic Management in IP & ATM Networks*, McGraw-Hill, New York, NY, USA, 2000. - J. S. Bendat and A. G. Piersol,
*Random Data Analysis and Measurement Procedures*, John Wiley & Sons, New York, NY, USA, 3rd edition, 2000. - J. L. Doob,
*Stochastic Rocesses*, John Wiley & Sons, New York, NY, USA, 1953. - F. Le Gall, “One moment model for telephone traffic,”
*Applied Mathematical Modelling*, vol. 6, no. 6, pp. 415–423, 1982. View at: Publisher Site | Google Scholar | Zentralblatt MATH - P. M. Lin, B. J. Leon, and C. R. Stewart, “Analysis of circuit-switched networks employing originating-office control with spill-forward,”
*IEEE Transactions on Communications*, vol. 26, no. 6, pp. 754–765, 1978. View at: Publisher Site | Google Scholar | Zentralblatt MATH - D. R. Manfield and T. Downs, “On the one-moment analysis of telephone traffic networks,”
*IEEE Transactions on Communications*, vol. 27, no. 8, pp. 1169–1174, 1979. View at: Publisher Site | Google Scholar - M. Reiser, “Performance evaluation of data communication systems,”
*Proceedings of the IEEE*, vol. 70, no. 2, pp. 171–196, 1982. View at: Publisher Site | Google Scholar - D.-X. Lu,
*Random Processes and Their Applications*, Press of Tsinghua University, Beijing, China, 2006. - S. I. Resnick, “Heavy tail modeling and teletraffic data,”
*The Annals of Statistics*, vol. 25, no. 5, pp. 1805–1869, 1997, with discussion and a rejoinder by the author. View at: Publisher Site | Google Scholar | Zentralblatt MATH - I. Csabai, “$1/f$ noise in computer network traffic,”
*Journal of Physics A*, vol. 27, no. 12, pp. L417–L421, 1994. View at: Publisher Site | Google Scholar - W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson, “On the self-similar nature of Ethernet traffic (extended version),”
*IEEE/ACM Transactions on Networking*, vol. 2, no. 1, pp. 1–15, 1994. View at: Publisher Site | Google Scholar - J. Beran, R. Sherman, M. S. Taqqu, and W. Willinger, “Long-range dependence in variable-bit-rate video traffic,”
*IEEE Transactions on Communications*, vol. 43, no. 234, pp. 1566–1579, 1995. View at: Publisher Site | Google Scholar - J. C. López-Ardao, C. López-García, A. Suárez-González, M. Fernández-Veiga, and R. Rodríguez-Rubio, “On the use of self-similar processes in network simulation,”
*ACM Transactions on Modeling and Computer Simulation*, vol. 10, no. 2, pp. 125–151, 2000. View at: Publisher Site | Google Scholar - W. S. Cleveland and D. X. Sun, “Internet traffic data,”
*Journal of the American Statistical Association*, vol. 95, no. 451, pp. 979–985, 2000. View at: Google Scholar - B. Tsybakov and N. D. Georganas, “On self-similar traffic in atm queues: definitions, overflow probability bound, and cell delay distribution,”
*IEEE/ACM Transactions on Networking*, vol. 5, no. 3, pp. 397–409, 1997. View at: Publisher Site | Google Scholar - I. Norros, “A storage model with self-similar input,”
*Queueing Systems. Theory and Applications*, vol. 16, no. 3-4, pp. 387–396, 1994. View at: Publisher Site | Google Scholar | Zentralblatt MATH - G. S. Fishman and I. J. B. F. Adan, “How heavy-tailed distributions affect simulation-generated time averages,”
*ACM Transactions on Modeling and Computer Simulation*, vol. 16, no. 2, pp. 152–173, 2006. View at: Publisher Site | Google Scholar - C. Li and W. Zhao, “Stochastic performance analysis of non-feedforward networks,”
*Telecommunication Systems*, vol. 43, no. 3-4, pp. 237–252, 2010. View at: Publisher Site | Google Scholar - T. A. Dahl and T. R. Willemain, “The effect of long-memory arrivals on queue performance,”
*Operations Research Letters*, vol. 29, no. 3, pp. 123–127, 2001. View at: Publisher Site | Google Scholar | Zentralblatt MATH - J. F. C. Kingman, “The first Erlang century and the next,”
*Queueing Systems*, vol. 63, no. 1-4, pp. 3–12, 2009. View at: Publisher Site | Google Scholar | Zentralblatt MATH - P. Loiseau, P. Gonçalves, G. Dewaele, P. Borgnat, P. Abry, and P. V. B. Primet, “Investigating self-similarity and heavy-tailed distributions on a large-scale experimental facility,”
*IEEE/ACM Transactions on Networking*, vol. 18, no. 4, Article ID 5422706, pp. 1261–1274, 2010. View at: Publisher Site | Google Scholar - M. Li, “Fractal time series—a tutorial review,”
*Mathematical Problems in Engineering*, vol. 2010, Article ID 157264, 26 pages, 2010. View at: Publisher Site | Google Scholar | Zentralblatt MATH - F. A. Tobagi, R. W. Peebles, and E. G. Manning, “Modeling and measurement techniques in packet communication networks,”
*Proceedings of the IEEE*, vol. 66, no. 11, pp. 1423–1447, 1978. View at: Publisher Site | Google Scholar - R. Jain and S. A. Routhier, “Packet trains—measurements and a new model for computer network traffic,”
*IEEE Journal on Selected Areas in Communications*, vol. 4, no. 6, pp. 986–995, 1986. View at: Publisher Site | Google Scholar - F. Kamoun, “Performance analysis of a discrete-time queuing system with a correlated train arrival process,”
*Performance Evaluation*, vol. 63, no. 4-5, pp. 315–340, 2006. View at: Publisher Site | Google Scholar - V. Paxson and S. Floyd, “Wide area traffic: the failure of Poisson modeling,”
*IEEE/ACM Transactions on Networking*, vol. 3, no. 3, pp. 226–244, 1995. View at: Publisher Site | Google Scholar - M. E. Crovella and A. Bestavros, “Self-similarity in world wide web traffic: evidence and possible causes,”
*IEEE/ACM Transactions on Networking*, vol. 5, no. 6, pp. 835–846, 1997. View at: Publisher Site | Google Scholar - B. Tsybakov and N. D. Georganas, “Self-similar processes in communications networks,”
*IEEE Transactions on Information Theory*, vol. 44, no. 5, pp. 1713–1725, 1998. View at: Publisher Site | Google Scholar | Zentralblatt MATH - A. Adas, “Traffic models in broadband networks,”
*IEEE Communications Magazine*, vol. 35, no. 7, pp. 82–89, 1997. View at: Google Scholar - H. Michiel and K. Laevens, “Teletraffic engineering in a broad-band era,”
*Proceedings of the IEEE*, vol. 85, no. 12, pp. 2007–2032, 1997. View at: Publisher Site | Google Scholar - A. Erramilli, M. Roughan, D. Veitch, and W. Willinger, “Self-similar traffic and network dynamics,”
*Proceedings of the IEEE*, vol. 90, no. 5, pp. 800–819, 2002. View at: Publisher Site | Google Scholar - 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,”
*Statistical Science*, vol. 10, no. 1, pp. 67–85, 1995. View at: Google Scholar - B. B. Mandelbrot and J. W. Van Ness, “Fractional Brownian motions, fractional noises and applications,”
*SIAM Review*, vol. 10, pp. 422–437, 1968. View at: Publisher Site | Google Scholar | Zentralblatt MATH - J. Beran,
*Statistics for Long-Memory Processes*, vol. 61 of*Monographs on Statistics and Applied Probability*, Chapman & Hall, New York, NY, USA, 1994. - M. Li and S. C. Lim, “Modeling network traffic using generalized Cauchy process,”
*Physica A*, vol. 387, no. 11, pp. 2584–2594, 2008. View at: Publisher Site | Google Scholar - M. Li and S. C. Lim, “Power spectrum of generalized Cauchy process,”
*Telecommunication Systems*, vol. 43, no. 3-4, pp. 219–222, 2010. View at: Publisher Site | Google Scholar - M. Li, “Generation of teletraffic of generalized Cauchy type,”
*Physica Scripta*, vol. 81, no. 2, Article ID 025007, 2010. View at: Publisher Site | Google Scholar | Zentralblatt MATH - R. P. Kanwal,
*Generalized Functions: Theory and Application*, Birkhäuser, Boston, Mass, USA, 3rd edition, 2004. - M. Li and S. C. Lim, “A rigorous derivation of power spectrum of fractional Gaussian noise,”
*Fluctuation and Noise Letters*, vol. 6, no. 4, pp. C33–C36, 2006. View at: Publisher Site | Google Scholar - B. B. Mandelbrot,
*Gaussian Self-Affinity and Fractals*, Springer, New York, NY, USA, 2002. - J.-P. Chilès and P. Delfiner,
*Geostatistics: Modeling Spatial Uncertainty*, Wiley Series in Probability and Statistics: Applied Probability and Statistics, John Wiley & Sons, New York, NY, USA, 1999. View at: Publisher Site - S. C. Lim and M. Li, “A generalized Cauchy process and its application to relaxation phenomena,”
*Journal of Physics A*, vol. 39, no. 12, pp. 2935–2951, 2006. View at: Publisher Site | Google Scholar | Zentralblatt MATH - P. Todorovic,
*An Introduction to Stochastic Processes and Their Applications*, Springer Series in Statistics: Probability and Its Applications, Springer, New York, NY, USA, 1992. - S. C. Lim and S. V. Muniandy, “Generalized Ornstein-Uhlenbeck processes and associated self-similar processes,”
*Journal of Physics A*, vol. 36, no. 14, pp. 3961–3982, 2003. View at: Publisher Site | Google Scholar | Zentralblatt MATH - R. L. Wolpert and M. S. Taqqu, “Fractional Ornstein-Uhlenbeck Lévy processes and the telecom process: upstairs and downstairs,”
*Signal Processing*, vol. 85, no. 8, pp. 1523–1545, 2005. View at: Publisher Site | Google Scholar | Zentralblatt MATH - B. B. Mandelbrot,
*The Fractal Geometry of Nature*, W.H. Freeman, New York, NY, USA, 1982. - M. Li and W. Zhao, “Representation of a stochastic traffic bound,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 21, no. 9, pp. 1368–1372, 2010. View at: Publisher Site | Google Scholar - J. T. Kent and A. T. A. Wood, “Estimating the fractal dimension of a locally self-similar Gaussian process by using increments,”
*Journal of the Royal Statistical Society B*, vol. 59, no. 3, pp. 679–699, 1997. View at: Google Scholar | Zentralblatt MATH - P. Hall and R. Roy, “On the relationship between fractal dimension and fractal index for stationary stochastic processes,”
*The Annals of Applied Probability*, vol. 4, no. 1, pp. 241–253, 1994. View at: Publisher Site | Google Scholar | Zentralblatt MATH - G. Chan, P. Hall, and D. S. Poskitt, “Periodogram-based estimators of fractal properties,”
*The Annals of Statistics*, vol. 23, no. 5, pp. 1684–1711, 1995. View at: Publisher Site | Google Scholar | Zentralblatt MATH - R. J. Adler,
*The Geometry of Random Fields*, John Wiley & Sons, New York, NY, USA, 1981, Wiley Series in Probability and Mathematical Statistic. - T. Gneiting and M. Schlather, “Stochastic models that separate fractal dimension and the Hurst effect,”
*SIAM Review*, vol. 46, no. 2, pp. 269–282, 2004. View at: Publisher Site | Google Scholar | Zentralblatt MATH - M. Li, “Modeling autocorrelation functions of long-range dependent teletraffic series based on optimal approximation in Hilbert space-A further study,”
*Applied Mathematical Modelling*, vol. 31, no. 3, pp. 625–631, 2007. View at: Publisher Site | Google Scholar | Zentralblatt MATH - M. Li, W. Zhao, W. Jia, D. Long, and C. H. Chi, “Modeling autocorrelation functions of self-similar teletraffic in communication networks based on optimal approximation in Hilbert space,”
*Applied Mathematical Modelling*, vol. 27, no. 3, pp. 155–168, 2003. View at: Publisher Site | Google Scholar | Zentralblatt MATH - D. H. Griffel,
*Applied Functional Analysis*, Ellis Horwood, Chichester, UK, 1981, Ellis Horwood Series in Mathematics and its Application. - N. Young,
*An Introduction to Hilbert Space*, Cambridge Mathematical Textbooks, Cambridge University Press, Cambridge, UK, 1988. - J.-P. Aubin,
*Applied Functional Analysis*, Pure and Applied Mathematics, Wiley-Interscience, New York, NY, USA, 2nd edition, 2000. - J. A. Rice,
*Mathematical Statistics and Data Analysis*, Wadsworth, 2nd edition, 1995. - J.-P. Aubin and H. Frankowska,
*Set-Valued Analysis*, vol. 2 of*Systems & Control: Foundations & Applications*, Birkhäuser, Boston, Mass, USA, 1990. - G. V. Smirnov,
*Introduction to the Theory of Differential Inclusions*, vol. 41 of*Graduate Studies in Mathematics*, American Mathematical Society, Providence, RI, USA, 2002. - M. Livny, B. Melamed, and A. K. Tsiolis, “The impact of autocorrelation on queuing systems,”
*Management Science*, vol. 39, no. 3, pp. 322–339, 1993. View at: Google Scholar - http://pma.nlanr.net/Traces/Traces/daily.
- W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery,
*Numerical Recipes in C: The art of scientific computing*, Cambridge University Press, Cambridge, UK, 2nd edition, 1992. - B. Hajek and L. He, “On variations of queue response for inputs with the same mean and autocorrelation function,”
*IEEE/ACM Transactions on Networking*, vol. 6, no. 5, pp. 588–598, 1998. View at: Publisher Site | Google Scholar - S. Q. Li and C. L. Hwang, “Queue response to input correlation functions: discrete spectral analysis,”
*IEEE/ACM Transactions on Networking*, vol. 1, no. 5, pp. 522–533, 1993. View at: Publisher Site | Google Scholar - S. Q. Li and C. L. Hwang, “Queue response to input correlation functions: continuous spectral analysis,”
*IEEE/ACM Transactions on Networking*, vol. 1, no. 6, pp. 678–692, 1993. View at: Publisher Site | Google Scholar - S. Wittevrongel and H. Bruneel, “Correlation effects in ATM queues due to data format conversions,”
*Performance Evaluation*, vol. 32, no. 1, pp. 35–56, 1998. View at: Publisher Site | Google Scholar - R. M. Geist and J. M. Westall, “Correlational and distributional effects in network traffic models,”
*Performance Evaluation*, vol. 44, no. 1-4, pp. 121–138, 2001. View at: Publisher Site | Google Scholar | Zentralblatt MATH - A. Feldmann, A. C. Gilbert, W. Willinger, and T. G. Kurtz, “The changing nature of network traffic: scaling phenomena,”
*Computer Communication Review*, vol. 28, no. 2, pp. 5–29, 1998. View at: Google Scholar - R. L. Cruz, “A calculus for network delay. I. Network elements in isolation,”
*IEEE Transactions on Information Theory*, vol. 37, no. 1, pp. 114–131, 1991. View at: Publisher Site | Google Scholar | Zentralblatt MATH - H. Dong, Z. Wang, D. W. C. Ho, and H. Gao, “Robust ${H}_{\infty}$ fuzzy output-feedback control with multiple probabilistic delays and multiple missing measurements,”
*IEEE Transactions on Fuzzy Systems*, vol. 18, no. 4, pp. 712–725, 2010. View at: Publisher Site | Google Scholar - H. Dong, Z. Wang, and H. Gao, “Observer-based ${H}_{\infty}$ control for systems with repeated scalar nonlinearities and multiple packet losses,”
*International Journal of Robust and Nonlinear Control*, vol. 20, no. 12, pp. 1363–1378, 2010. View at: Google Scholar | Zentralblatt MATH - H. Dong, Z. Wang, D. W. C. Ho, and H. Gao, “Variance-constrained ${H}_{\infty}$ filtering for a class of nonlinear time-varying systems with multiple missing measurements: the finite-horizon case,”
*IEEE Transactions on Signal Processing*, vol. 58, no. 5, pp. 2534–2543, 2010. View at: Publisher Site | Google Scholar - B. Shen, Z. Wang, Y. S. Hung, and G. Chesi, “Distributed ${H}_{\infty}$ filtering for polynomial nonlinear stochastic systems in sensor networks,”
*IEEE Transactions on Industrial Electronics*, vol. 58, no. 5, pp. 1971–1979, 2011. View at: Google Scholar - B. Shen, Z. Wang, and X. Liu, “Bounded ${H}_{\infty}$ synchronization and state estimation for discrete time-varying stochastic complex networks over a finite horizon,”
*IEEE Transactions on Neural Networks*, vol. 22, no. 1, pp. 145–157, 2011. View at: Publisher Site | Google Scholar - B. Shen, Z. Wang, and Y. S. Hung, “Distributed ${H}_{\infty}$-consensus filtering in sensor networks with multiple missing measurements: the finite-horizon case,”
*Automatica*, vol. 46, no. 10, pp. 1682–1688, 2010. View at: Publisher Site | Google Scholar - Y. Q. Chen, R. Sun, and A. Zhou, “An improved Hurst parameter estimator based on fractional Fourier transform,”
*Telecommunication Systems*, vol. 43, no. 3-4, pp. 197–206, 2010. View at: Publisher Site | Google Scholar - H. Sheng, H. Sun, Y. Q. Chen, and T. Qiu, “Synthesis of multifractional Gaussian noises based on variable-order fractional operators,”
*Signal Processing*, vol. 91, no. 7, pp. 1645–1650, 2011. View at: Publisher Site | Google Scholar - H. Sheng, Y. Q. Chen, and T. Qiu, “On the robustness of Hurst estimators,”
*IET Signal Processing*, vol. 5, no. 2, pp. 209–225, 2011. View at: Publisher Site | Google Scholar

#### Copyright

Copyright © 2012 Ming Li and Wei Zhao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.