Abstract
With the proliferation of packet-switched networks in the 1980s and a strong preference in parts of the engineering and communications research communities to work on ATM (asynchronous transfer mode) related problems, teletraffic theory, that is, the application of queueing theory to the performance analysis and evaluation of communication networks, faced a new set of challenges, some of which questioned its very foundations. Originally developed to supply engineers with adequate quantitative methods and techniques for designing, managing and controlling circuit switched networks providing plain old telephone service (POTS), teletraffic theory had become arguably one of the most successful applications of mathematical modeling in industry. However, in view of the widespread and rapid deployment of packet switching based technologies and new services, and especially because of the explosive growth of the Internet, traditional teletraffic theory found itself under intense scrutiny. In particular, as some of the arguments went, performance models are only as good as their underlying assumptions - although teletraffic theory had produced a steady supply of new and ever more complex models for packet traffic, the models’ foundations had generally been based on POTS-based tradition, on good faith, or on the modelers’ own (mis)conceptions about the presumed dynamics of traffic in a packet-switched networking environment. Put differently, since traffic modeling is considered to be an essential ingredient of teletraffic theory and since describing packet traffic had become largely a theoretical exercise that was essentially disconnected from reality during the emergence of packet-switched networks, the question of whether or not all these theoretical models had anything in common with measured traffic as observed on links within “live” packet networks could be heard more and more frequently.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Abry and D. Veitch. Wavelet analysis of long-range dependent traffic, IEEE Transactions on Information Theory 44, pp. 2–15, 1998.
J. Beran. Statistics for Long-Memory Processes Chapman & Hall, New York, 1994.
J. Beran and N. Terrin. Estimation of the long-memory parameter based on a multivariate central limit theorem, J. Time Ser. Anal. 15, pp. 269–278, 1994.
D. R. Cox and M. W. H. Townsend. The use of the correlogram in measuring yarn irregularities, Proc. Roy. Soc. Edinburgh Sec. A 63, pp. 290–311, 1947.
M. Crovella and A. Bestavros. Self-similarity in World Wide Web traffic — evidence and possible causes, Proc. ACM/SIGMETRICS’96, Philadelphia, PA, pp. 160–169, 1996.
M. Crovella and A. Bestavros. Self-similarity in World Wide Web traffic — evidence and possible causes, IEEE/ACM Transactions on Networking 5, pp. 835–846, 1997.
R. Dahlhaus. Efficient parameter estimation of self-similar processes, Ann. Statist. 17, pp. 1749–1766, 1989.
N. G. Duffield and N. O’Connell. Large deviations and overflow probabilities for the general single-server queue, with applications, Mathematical Proceedings of the Cambridge Philosophical Society 118, pp. 363–374, 1995.
A. Erramilli and R. P. Singh. The application of deterministic chaotic maps to characterize traffic in broadband packet networks, Proc. of the 7th ITC Specialist Seminar, Morristown, NJ, October 1990.
A. Erramilli, R. P. Singh and P. Pruthi. An application of deterministic chaotic maps to model packet traffic, Queueing Systems 20, pp. 171–206, 1995.
A. Feldmann, A. C. Gilbert and W. Willinger. Data networks as cascades: Investigating the multifractal nature of Internet WAN traffic, Proc. of ACM/SIGCOMM’98, Vancouver, Canada, September 1998, pp. 42–55, 1998.
H. J. Fowler and W. E. Leland. Local area network traffic characteristics, with implications for broadband network congestion management, IEEE Journal on Selected Areas in Communication 9, pp. 1139–1149, 1991.
C. W. J. Granger and R. Joyeux. An introduction to long-memory time series models and fractional differencing, J. Time Ser. Anal. 1, pp. 15–29, 1981.
H. E. Hurst. Methods of using long-term storage in reservoirs, Proc. Instit. Civil Eng. Part I 5, pp. 519–590, 1956.
A. N. Kolmogorov. The local structure of turbulence in incompressible viscous fluid for very large Reynolds numbers, C. R. Acad. Sci. URSS (N.S.) 30, 1941. (Translation in Turbulence (S.K. Friedlander and L. Topper, Eds.), pp. 151–155, Interscience, New York, 1961.)
W. E. Leland. LAN traffic behavior from milliseconds to days, Proc. of the 7th ITC Specialist Seminar, Morristown, NJ, October 1990.
W. E. Leland and D. V. Wilson. High time-resolution measurements and analysis of LAN traffic: Implications for LAN interconnection, Proc. of IEEE Infocom’91, Bal Harbor, FL, April 1991.
W. E. Leland, M. S. Taqqu, W. Willinger, and D. V.Wilson. On the self-similar nature of Ethernet traffic, Proc. of ACM/SIGCOMM’93, San Francisco, CA, September 1993, pp. 183–193, 1993.
W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson. On the self-similar nature of Ethernet traffic (Extended version), IEEE/ACM Transactions on Networking 2, pp. 1–15, 1994.
T. G. Kurtz. Limit theorems for workload input models, in: Stochastic Networks: Theory and Applications, F.P. Kelly, S. Zachary and I. Ziedins (Eds.), Clarendon Press, 1996.
B. B. Mandelbrot. Self-similar error clusters in communication systems and the concept of conditional stationarity, IEEE trans. Commun. Techn. COM-13, pp. 71–90, 1995.
B. B. Mandelbrot. The Fractal Geometry of Nature. W.H. Freeman and Co., New York, 1983
I. Norros. A storage model with self-similar input, Queueing Systems 16, pp. 387–396, 1994.
V. Paxson and S. Floyd. Wide-area traffic: The failure of Poisson modeling, Proc. of ACM/SIGCOMM’94, London, UK, September 1994, pp. 257–268, 1994.
V. Paxson and S. Floyd. Wide-area traffic: The failure of Poisson modeling, IEEE/ACM Transactions on Networking 3, pp. 226–244, 1995.
S. Shimogawa, S. Nojo and T. Betchaku. A fractal property in an ATM video statistical multiplexing, The 1992 Fall National Conference of ORSJ, 1-C-6, 1992 (in Japanese).
S. Shimogawa, S. Nojo and T. Betchaku. Self-similar phenomena in an ATM video cell flow, Proc. of Symp. for Performance Models in Information and Communication Networks, M. Mori et a., (Eds.), Namazu, Japan, 1993.
W. Willinger, M. S. Taqqu, R. Sherman, and D. V. Wilson. Self-similarity through high-variability: Statistical analysis of Ethernet LAN traffic at the source level, Proc. of ACM/SIGCOMM’95, Cambridge, MA, August 1995, pp. 100–113, 1995.
W. Willinger, M. S. Taqqu, R. Sherman, and D. V. Wilson. Self-similarity through high-variability: Statistical analysis of Ethernet LAN traffic at the source level, IEEE/ACM Transactions on Networking 5, pp. 71–86, 1997.
W. Willinger, V. Paxson and M. S. Taqqu. Self-similarity and heavy tails: Structural modeling of network traffic, in: A Practical Guide to Heavy Tails: Statistical Techniques for Analyzing Heavy-Tailed Distributions, R. Adler, R. Feldman and M.S. Taqqu (Eds.), Birkhauser Verlag, Boston, MA, pp. 27–53, 1998.
W. Willinger and V. Paxson. Where mathematics meets the Internet, Notices of the AMS 45, pp. 961–970, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Willinger, W. (2000). The Discovery of Self-Similar Traffic. In: Haring, G., Lindemann, C., Reiser, M. (eds) Performance Evaluation: Origins and Directions. Lecture Notes in Computer Science, vol 1769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46506-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-46506-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67193-0
Online ISBN: 978-3-540-46506-5
eBook Packages: Springer Book Archive