Skip to main content
SpringerLink
Log in

On the complexity of Internet traffic dynamics on its topology

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Most studies of Internet traffic rely on observations from a single link. The corresponding traffic dynamics has been studied for more than a decade and is well understood. The study of how traffic on the Internet topology, on the other hand, is poorly understood and has been largely limited to the distribution of traffic among source-destination pairs inside the studied network, also called the traffic matrix. In this paper, we make a first step towards understanding the way traffic gets distributed onto the whole topology of the Internet. For this, we rely on the traffic seen by a transit network, for a period of more than a week. As we are still at the stage of understanding the topological traffic distribution, we do not try to model the traffic dynamics. Rather we concentrate on understanding the complexity of describing the traffic observed by a transit network, how it maps onto the AS-level topology of the Internet and how it changes over time. For this, we rely on well-known tools of multi-variate analysis and multi-resolution analysis.

Our first observation is that the structure of the Internet topology highly impacts the traffic distribution. Second, our attempts at compressing the traffic on the topology through dimension reduction suggests two options for traffic modeling: (1) to ignore links on the topology for which we do not see much traffic, or (2) to ignore time scales smaller than a few hours. In either case, important properties of the traffic might be lost, so might not be an option to build realistic models of Internet traffic.

Realistic models of Internet traffic on the topology are not out of reach though. In this paper, we identify two properties such models should have: (1) use a compact representation of the dependencies of the traffic on the topology, and (2) be able to capture the complex multi-scale nature of traffic dynamics on different types of links.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. GNU Zebra Routing Suite (2003). http://www.zebra.org.

  2. Abry, P., Baraniuk, R., Flandrin, P., Riedi, R., & Veitch, D. (May 2002). The multiscale nature of network traffic: discovery, analysis, and modelling. IEEE Signal Processing Magazine.

  3. Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (March 2004). The architecture of complex weighted networks. In Proc. natl. acad. sci. U.S.A.

  4. Cao, J., Cleveland, W., Lin, D., & Sun, D. (June 2001). On the nonstationarity of Internet traffic. In Proc. of ACM SIGMETRICS.

  5. Cisco (1999). NetFlow services and applications. White paper, available from http://www.cisco.com/warp/public/732/netflow.

  6. Claffy, K., Braun, H., & Polyzos, G. (1993). Traffic characteristics of the T1 NSFNET backbone. In INFOCOM’93.

  7. Crovella, M., & Kolaczyk, E. (April 2003). Graph wavelets for spatial traffic analysis. In Proc. of IEEE INFOCOM.

  8. Daubechies, I. (1992). In CMBS-NSF series in applied mathematics : Vol. 61. Ten lectures on wavelets. Philadelphia: SIAM.

    Google Scholar 

  9. Fang, W., & Peterson, L. (December 1999). Inter-AS traffic patterns and their implications. In IEEE global Internet symposium.

  10. Feamster, N., & Rexford, J. (August 2002). Network-Wide BGP Route Prediction for Traffic Engineering. In Proc. of ITCOM 2002, Boston, MA.

  11. Jolliffe, I. (2002). Principal component analysis. New-York: Springer.

    Google Scholar 

  12. Kleinrock, L., & Naylor, W. (1974). On measured behavior of the ARPA network. In AFIS proceedings, 1974 national computer conference (pp. 767–780).

  13. Kowalski, J., & Warfield, B. (1995). Modeling traffic demand between nodes in a telecommunications network. In Proceedings of ATNAC’95.

  14. Lakhina, A., Crovella, M., & Diot, C. (August 2004). Diagnosing network-wide traffic anomalies. In Proc. ACM SIGCOMM.

  15. Leland, W., Taqqu, M., Willinger, W., & Wilson, D. (1994). On the self-similar nature of ethernet traffic (Extended Version). IEEE/ACM Transactions on Networking.

  16. Leland, W., & Wilson, D. (1991). High time-resolution measurement and analysis of LAN traffic: Implications for LAN interconnection. In Proc. of IEEE INFOCOM’91.

  17. Malkin, G. (January 1993). Traceroute using an IP option. RFC 1393.

  18. Park, K., & Willinger, W. (2000). Self-similar network traffic and performance evaluation. New York: Wiley-Interscience.

    Book  Google Scholar 

  19. Paxson, V., & Floyd, S. (1995). Wide-area traffic: the failure of Poisson modeling. IEEE/ACM Transactions on Networking, 3(3), 226–244.

    Article  Google Scholar 

  20. Priestley, M. (1981). Spectral analysis and time series. San Diego: Academic Press.

    Google Scholar 

  21. Quoitin, B., & Uhlig, S. (2005). Modeling the routing of an autonomous system with C-BGP. IEEE Network, 19(6).

  22. Quoitin, B., Uhlig, S., Pelsser, C., Swinnen, L., & Bonaventure, O. (May 2003). Interdomain traffic engineering with BGP. IEEE Communications.

  23. Rekhter, Y., Li, T., & Hares, S. (January 2006). A border gateway protocol 4 (BGP-4). RFC4271.

  24. Rexford, J., Wang, J., Xiao, Z., & Zhang, Y. (November 2002). BGP routing stability of popular destinations. In Proc. of ACM SIGCOMM Internet measurement workshop.

  25. Ringberg, H., Soule, A., Rexford, J., & Diot, C. (2007). Sensitivity of pca for traffic anomaly detection. In Proc. of ACM SIGMETRICS (pp. 109–120).

  26. Soule, A., Lakhina, A., Taft, N., Papagiannaki, K., Salamatian, K., Nucci, A., Crovella, M., & Diot, C. (2005). Traffic matrices: balancing measurements, inference and modeling. In Proc. of ACM SIGMETRICS.

  27. Subramanian, L., Agarwal, S., Rexford, J., & Katz, R. (June 2002). Characterizing the Internet hierarchy from multiple vantage points. In INFOCOM 2002.

  28. Tewfik, A., & Kim, A. (1992). Correlation structure of the discrete wavelet coefficients of fractional Brownian motion. IEEE Transactions on Information Theory, 38, 904–909.

    Article  Google Scholar 

  29. Thompson, K., Miller, G., & Wilder, R. (1997). Wide-area Internet traffic patterns and characteristics. IEEE Network, 11(6), 10–23.

    Article  Google Scholar 

  30. Uhlig, S. (April 2004). Non-stationarity and high-order scaling in tcp flow arrivals: a methodological analysis. ACM SIGCOMM—Computer Communication Review, 34(2), 9–24.

    Article  Google Scholar 

  31. Uhlig, S., & Bonaventure, O. (January 2002). Implications of interdomain traffic characteristics on traffic engineering. European Transactions on Telecommunications.

  32. Uhlig, S., Magnin, V., Bonaventure, O., Rapier, C., & Deri, L. (March 2004). Implications of the topological properties of internet traffic on traffic engineering. In Proc. of ACM SAC’04.

  33. Willinger, W., Paxson, V., Riedi, R. H., & Taqqu, M. S. (2001). Long-range dependence and data network traffic. In Doukhan, Oppenheim & Taqqu (Eds.), Long range dependence: theory and applications.

  34. Yook, S., Jeong, H., Barabasi, A., & Tu, Y. (2001). Weighted evolving networks. Physical Review Letters, 86, 5835–5838.

    Article  Google Scholar 

  35. Zegura, E., Calvert, K., & Bhattacharjee, S. (March 1996). How to model an internetwork. In Proc. of IEEE INFOCOM.

Download references

Author information

Authors and Affiliations

  1. Deutsche Telekom Laboratories, Technische Universität Berlin, Ernst-Reuter-Platz 7, 10587, Berlin, Germany

    Steve Uhlig

Authors
  1. Steve Uhlig
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Steve Uhlig.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Uhlig, S. On the complexity of Internet traffic dynamics on its topology. Telecommun Syst 43, 167–180 (2010). https://doi.org/10.1007/s11235-009-9213-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-009-9213-6

Keywords

Search

Navigation