Multiscale Analysis and Data Networks

22Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The empirical finding of self-similarity in data network traffic over many time scales motivates the need for analysis tools that are particularly well adapted for identifying structures in network traffic. These structures span a range of time scales or are scale-dependent. Wavelet-based scaling analysis methods are especially successful, both collecting summary statistics from scale to scale and probing the local structure of packet traces. They include both spectral density estimation to identify large time-scale features and multifractal estimation for small time-scale bursts. While these methods are primarily statistical in nature, we may also adapt them to visualize the "burstiness" or the instantaneous scaling features of network traffic. This expository paper discusses the theoretical and implementation issues of wavelet-based scaling analysis for network traffic. Because data network traffic research does not consist solely of analysis, we show how these wavelet-based methods may be used to monitor and infer network properties (in conjunction with on-line algorithms and careful network experimentation). More importantly, we address what types of networking questions we can and cannot investigate with such tools. © 2001 Academic Press.

Cite

CITATION STYLE

APA

Gilbert, A. C. (2001). Multiscale Analysis and Data Networks. Applied and Computational Harmonic Analysis, 10(3), 185–202. https://doi.org/10.1006/acha.2000.0342

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free