ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 26, Issue 12, 21 July 2003, Pages 1341-1352
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (401 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0140-3664(03)00002-1    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2003 Elsevier Science B.V. All rights reserved.

On the dynamic allocation of resources using linear prediction of aggregate network traffic

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Miguel López-GuerreroE-mail The Corresponding Author, a, José R. GallardoE-mail The Corresponding Author, b, Luis Orozco-BarbosaCorresponding Author Contact Information, E-mail The Corresponding Author, a and Dimitrios MakrakisE-mail The Corresponding Author, a

a University of Ottawa, 161 Louis Pasteur, P. O. Box 450, Stn A, Ottawa, Ont., Canada K1N 6N5

b CICESE Research Center, Km, 107 Carretera Tijuana-Ensenada, Ensenada, BC 22860, Mexico


Received 12 February 2002; 
revised 22 November 2002; 
accepted 23 December 2002. ;
Available online 21 January 2003.

Abstract

Recent works propose the use of fractional stable noise (FSN) to capture the statistical properties of an arrival process over time intervals. This process can reproduce the properties of long-range dependence and high variability exhibited by traffic in real-life networks. However, when modeling network traffic with this α-stable long-range dependent stochastic process, some analytical difficulties arise. For instance, the value of its index of stability α conditions the existence of some moments, which in turn limits the applicability of traditional statistical procedures. Therefore, alternative procedures and methods have to be used. In this work we claim that in spite of the increased complexity, there is much to gain by considering this modeling approach in the context of traffic control. We focus our attention in the prediction of FSN processes and we argue that it can potentially help improving currently existing resource management mechanisms. We support this claim by introducing the Dynamic Predictive Weighted Fair Queueing; a novel algorithm for the dynamic allocation of resources. Our simulation results and consequent performance comparisons with other schemes suggest that the performance of some scheduling algorithms can be highly improved in terms of packet losses and delays by incorporating prediction techniques that take into account the relevant properties of the network traffic.

Author Keywords: Fractional stable noise; α-stable long-range dependent stochastic process; Dynamic predictive weighted fair queueing

Article Outline

1. Introduction
2. Background concepts and methods
2.1. Symmetric α-stable random variables
2.2. Synthesis of fractional stable noise
3. Linear prediction of FSN processes
3.1. An efficient linear prediction method of FSN processes
3.2. A brief comment on the accuracy of the solution
4. Dynamic prediction-based allocation of bandwidth
4.1. Implementation of dynamic prediction-based allocation of bandwidth
4.2. Performance of dynamic prediction-based bandwidth allocation schemes
5. Dynamic predictive weighted fair queueing
5.1. The simulation model
5.2. Performance evaluation
6. Conclusions
Acknowledgements
References























Corresponding Author Contact InformationCorresponding author. Present address: Universidad de Castilla La Mancha, Escuela Politecnica Superior de Albacete, Campus Universitario, 02071 Albacete, Spain. Tel.: +34 967 599 200; fax: +34 967 599 224


Computer Communications
Volume 26, Issue 12, 21 July 2003, Pages 1341-1352
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.