In a high-speed network such as asynchronous transfer mode Syk91, Uni94] (ATM) a user can specify traac parameters that describe the intended usage pattern in more detail. These include the peak and sustainable (mean) cell rate as well as the maximum burst size. Based on these parameters the network must decide whether to accept or refuse the connection, and it must reserve resources to guarantee the requested quality of service constraints. Because of the multiplexing of many connections on a link, a certain smoothing is expected that allows the reservation of less than the peak cell rate. Recent publications Lel93, Lel94, Arl95] have revealed the self-similar (fractal) nature Man77, Man83, Pei92] of networking traac. Owing to positive correlation, the multiplexing of several such traac streams onto a link can have a negative impact on queuing performance Geo94, Geo95] because the smoothing eeect appears more slowly than expected. This paper describes a new algorithm called WAAN to derive an eeective capacity based on periodic wavelet analysis applied to a window of traac measurements (cell counts), that can capture and even exploit correlation structures. To cope economically with the numerical complexity of the wavelet transformation, a DSP is required to implement the method. The algorithm is highly adaptive over a wide spectrum of parameters, e.g. workload and intensity of the correlation, thus making it capable of coping with the high traac dynamics expected of future broadband networks. In addition, the algorithm can be applied to diierent conglomerations of connections, making it scalable to very high-speed networks where monitoring and controlling individual connections on every link along the connection's path becomes extremely crucial.
[1]
Dietmar Saupe,et al.
Chaos and fractals - new frontiers of science
,
1992
.
[2]
Benoit B. Mandelbrot,et al.
Fractal Geometry of Nature
,
1984
.
[3]
Dieter Hogrefe,et al.
SDL - with applications from protocol specification
,
1991,
BCS practitioner series.
[4]
Murad S. Taqqu,et al.
On the Self-Similar Nature of Ethernet Traffic
,
1993,
SIGCOMM.
[5]
Martin Vetterli,et al.
Wavelets and filter banks: theory and design
,
1992,
IEEE Trans. Signal Process..
[6]
A. Haar.
Zur Theorie der orthogonalen Funktionensysteme
,
1910
.
[7]
Walter Willinger,et al.
On the self-similar nature of Ethernet traffic
,
1993,
SIGCOMM '93.
[8]
Amara Lynn Graps,et al.
An introduction to wavelets
,
1995
.
[9]
B. Mandelbrot.
Long-Run Linearity, Locally Gaussian Process, H-Spectra and Infinite Variances
,
1969
.
[10]
Efstathios D. Sykas,et al.
Overview of ATM networks: functions and procedures
,
1991,
Comput. Commun..
[11]
H. E. Hurst,et al.
Long-Term Storage Capacity of Reservoirs
,
1951
.
[12]
N. Georganas,et al.
Analysis of an Atm Buuer with Self-similar("fractal") Input Traac
,
1995
.
[13]
Nicolas D. Georganas.
Self-Similar ("Fractal") Traffic in ATM Networks
,
1994,
IWACA.
[14]
Stéphane Mallat,et al.
A Theory for Multiresolution Signal Decomposition: The Wavelet Representation
,
1989,
IEEE Trans. Pattern Anal. Mach. Intell..