QoS guarantees for long-range dependent traffic

In this paper we study resource management on self-similar traffic to guarantee QoS. At first, we investigate a local ATM network. Then a queuing process with the real ATM network traffic is established to explore the tail distribution under different conditions. We have found the following results: 1. The long-range dependent correlations are the dominate factors of the queuing performance. When the long-range dependent relation is broken, the tail length reduces very obviously, whereas the queuing performance is almost the same though the short-range dependent relation is broken. 2. The more buffer solution is not practical because the queue-length distribution of self-similar traffic is too long to be handled purely by more buffer solution. However, it can be potentially accompanied with large delay penalty. 3. The more capacity solution can reduce the queuing tail efficiently. To guarantee QoS for the long range dependent traffic, more capacity method proves to be effective. 4. Multiplexing is another solution to reduce the queuing tail length, especially at high Hurst parameter. In order to achieve good QoS on self-similar traffic, enough bandwidth and multiplexing are the suitable solutions. A simple call admission control scheme, which can achieve high utilization and sustain in the same time a relatively good QoS Guarantee, is proposed. The scheme takes the advantage of both the multiplexing and enough bandwidth allocation to guarantee QoS.

[1]  S. Lowen,et al.  Point Process Approaches to the Modeling and Analysis of Self-similar Traac { Part I: Model Construction , 1996 .

[2]  Stefano Giordano,et al.  A new call admission control scheme based on the self similar nature of multimedia traffic , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[3]  J. R. Wallis,et al.  Robustness of the rescaled range R/S in the measurement of noncyclic long run statistical dependence , 1969 .

[4]  J. Hosking.  Modeling persistence in hydrological time series using fractional differencing , 1984 .

[5]  B. Mandelbrot.  A Fast Fractional Gaussian Noise Generator , 1971 .

[6]  B.K. Ryu,et al.  Point process approaches to the modeling and analysis of self-similar traffic .I. Model construction , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[7]  Azer Bestavros,et al.  Explaining World Wide Web Traffic Self-Similarity , 1995 .

[8]  Jan Beran,et al.  Statistics for long-memory processes , 1994 .

[9]  Nicolas D. Georganas,et al.  Analysis of an ATM buffer with self-similar ("fractal") input traffic , 1995, Proceedings of INFOCOM'95.

[10]  Mark W. Garrett,et al.  Modeling and generation of self-similar vbr video traffic , 1994, SIGCOMM 1994.

[11]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[12]  Walter Willinger,et al.  Experimental queueing analysis with long-range dependent packet traffic , 1996, TNET.

[13]  John A. Silvester,et al.  Simulation of an ATM queueing system with a fractional Brownian noise arrival process , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[14]  Amarnath Mukherjee,et al.  On resource management and QoS guarantees for long range dependent traffic , 1995, Proceedings of INFOCOM'95.

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

[16]  G. K. Young,et al.  Practical application of fractional Brownian Motion and noise to synthetic hydrology , 1973 .

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

[18]  Armand M. Makowski,et al.  Buffer Overflow Probabilities for a Multiplexer with Self- Similar Traffic , 1995 .

[19]  H. Saito,et al.  Upper bound of loss probability for self-similar traffic , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[20]  Walter Willinger,et al.  Analysis, modeling and generation of self-similar VBR video traffic , 1994, SIGCOMM.

[21]  Armand M. Makowski,et al.  Tail probabilities for a multiplexer with self-similar traffic , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.