CoLoRaDe: A Novel Algorithm for Controlling Long-Range Dependent Network Traffic
Mohammed Rezaul, Karim and Grout, Vic (2007) CoLoRaDe: A Novel Algorithm for Controlling Long-Range Dependent Network Traffic. In: UNSPECIFIED.
|
PDF
fulltext.pdf Download (181kB) | Preview |
Abstract
Long-range dependence characteristics have been observed in many natural or physical phenomena. In particular, a significant impact on data network performance has been shown in several papers. Congested Internet situations, where TCP/IP buffers start to fill, show long-range dependent (LRD) self-similar chaotic behaviour. The exponential growth of the number of servers, as well as the number of users, causes the performance of the Internet to be problematic since the LRD traffic has a significant impact on the buffer requirements. The Internet is a large-scale, wide-area network for which the importance of measurement and analysis of traffic is vital. The intensity of the long-range dependence (LRD) of communications network traffic can be measured using the Hurst parameter. A variety of techniques (such as R/S analysis, aggregated variance-time analysis, periodogram analysis, Whittle estimator, Higuchi's method, wavelet-based estimator, absolute moment method, etc.) exist for estimating Hurst exponent but the accuracy of the estimation is still a complicated and controversial issue. Earlier research (Rezaul et al., 2006) introduced a novel estimator called the Hurst exponent from the autocorrelation function (HEAF) and it was shown why lag 2 in HEAF (i.e. HEAF (2)) is considered when estimating LRD of network traffic. HEAF estimates H by a process which is simple, quick and reliable. In this research we extend these concepts by introducing a novel algorithm for controlling the long-range dependence of network traffic, named CoLoRaDe which is shown to reduce the LRD of packet sequences at the router buffer.
| Item Type: | Conference or Workshop Item |
|---|---|
| Additional Information: | Copyright © 2007 IEEE ' All Rights reserved. This paper was presented to Sixth International Conference on Networking (ICN 2007) 22nd -28th April 2007 in Martinique, French Caribbean. The proceedings were published by the IEEE and are available at http://dx.doi.org/10.1109/ICN.2007.29This material is posted here with permission of the IEEE and the author. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the products or services of Glyndwr University Wrexham. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. |
| Keywords: | Long-Range Dependent Network Traffic, traffic shaping, self-similar network traffic |
| Divisions: | ?? GlyndwrUniversity ?? |
| Depositing User: | ULCC Admin |
| Date Deposited: | 05 Oct 2011 09:13 |
| Last Modified: | 11 Dec 2017 20:05 |
| URI: | https://wrexham.repository.guildhe.ac.uk/id/eprint/101 |
Actions (login required)
 |
Edit Item |