Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/505202.505215acmconferencesArticle/Chapter ViewAbstractPublication PagesimcConference Proceedingsconference-collections
Article

Connection-level analysis and modeling of network traffic

Published: 01 November 2001 Publication History

Abstract

Most network traffic analysis and modeling studies lump all connections together into a single flow. Such aggregate traffic typically exhibits long-range-dependent (LRD) correlations and non-Gaussian marginal distributions. Importantly, in a typical aggregate traffic model, traffic bursts arise from many connections being active simultaneously. In this paper, we develop a new framework for analyzing and modeling network traffic that moves beyond aggregation by incorporating connection-level information. A careful study of many traffic traces acquired in different networking situations reveals (in opposition to the aggregate modeling ideal) that traffic bursts typically arise from just a few high-volume connections that dominate all others. We term such dominating connections alpha traffic. Alpha traffic is caused by large file transmissions over high bandwidth links and is extremely bursty (non-Gaussian). Stripping the alpha traffic from an aggregate trace leaves a beta traffic residual that is Gaussian, LRD, and shares the same fractal scaling exponent as the aggregate traffic. Beta traffic is caused by both small and large file transmissions over low bandwidth links. In our alpha/beta traffic model, the heterogeneity of the network resources give rise to burstiness and heavy-tailed connection durations give rise to LRD. Queuing experiments suggest that the alpha component dictates the tail queue behavior for large queue sizes, whereas the beta component controls the tail queue behavior for small queue sizes.

References

[1]
W. Leland, M. Taqqu, W. Willinger, and D. Wilson, "On the selfsimilar nature of Ethernet traffic (extended version)," IEEE/ACM Trans. Networking, pp. 1-15, 1994.
[2]
R. H. Riedi, M. S. Crouse, V. Ribiero, and R. G. Baraniuk, "A multifractal wavelet model with application to TCP network traffic," IEEE Trans. Inform. Theory, vol. 45, no. 3, pp. 992-1018, April 1999.
[3]
A. Erramilli, O. Narayan, and W. Willinger, "Experimental queueing analysis with long-range dependent traffic," IEEE/ACM Trans. Networking, pp. 209223, April 1996.
[4]
F. Brichet, J. Roberts, A. Simonian, and D. Veitch, "Heavy traffic analysis of a fluid queue fed by a superposition of ON/OFF sources," COST, vol. 242, 1994.
[5]
M. Taqqu and J. Levy, Using renewal processes to generate LRD and high variability. In: Progress in probability and statistics, E. Eberlein and M. Taqqu eds., vol. 11, Birkhaeuser, Boston, 1986, pp 73389.
[6]
M. Crovella and A. Bestavros, "Self-similarity in World Wide Web traffic. Evidence and possible causes," IEEE/ACM Transactions on Networking, vol. 5, pp. 835-846, December 1997.
[7]
W. Willinger, M. Taqqu, R. Sherman, and D. Wilson, "Selfsimilarity through high-variability: Statistical analysis of Ethernet LAN traffic at the source level," IEEE/ACM Trans. Networking (Extended Version), vol. 5, no. 1, pp. 71-86, Feb. 1997.
[8]
A. Feldmann, A. C. Gilbert, and W. Willinger, "Data networks as cascades: Investigating the multifractal nature of Internet WAN traffic," Proc. ACM/Sigcomm 98, vol. 28, pp. 42-55, 1998.
[9]
NLANR, "Auckland-II trace archive," http://moat.nlanr.net/Traces/Kiwitraces, 2000.
[10]
S. Sarvotham, R. Riedi, and R. Baraniuk, "Connection-level analysis and modeling of network traffic," Tech. Rep., ECE Dept., Rice Univ., July 2001.
[11]
LBL, "Internet traffic archive," http://ita.ee.lbl.gov/html/traces.html.
[12]
K. Fall and K. Varadhan, "ns notes and documentation," http://www-mash.cs.berkeley.edu/ns, 2000.
[13]
S. McCane and S. Floyd, "ns- network simulator," http://wwwmash.cs.berkeley.edu/ns.
[14]
J. Levy Vehel and R. Riedi, "Fractional Brownian motion and data traffic modeling: The other end of the spectrum," Fractals in Engineering, pp. 185-202, Springer 1997.

Cited By

View all
  • (2024)Parm: Efficient Training of Large Sparsely-Activated Models with Dedicated SchedulesIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621327(1880-1889)Online publication date: 20-May-2024
  • (2024)SparDL: Distributed Deep Learning Training with Efficient Sparse Communication2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00142(1752-1764)Online publication date: 13-May-2024
  • (2023)Baileys: An Efficient Distributed Machine Learning Framework by Dynamic GroupingProceedings of the 2023 15th International Conference on Machine Learning and Computing10.1145/3587716.3587731(92-96)Online publication date: 17-Feb-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
IMW '01: Proceedings of the 1st ACM SIGCOMM Workshop on Internet measurement
November 2001
319 pages
ISBN:1581134355
DOI:10.1145/505202
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 2001

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. animal kingdom
  2. network traffic modeling

Qualifiers

  • Article

Conference

SIGCOMM WS'01
Sponsor:
SIGCOMM WS'01: ACM SIGCOMM Internet Measurement Workshop 2001
November 1 - 2, 2001
California, San Francisco, USA

Acceptance Rates

IMW '01 Paper Acceptance Rate 29 of 80 submissions, 36%;
Overall Acceptance Rate 29 of 80 submissions, 36%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)36
  • Downloads (Last 6 weeks)2
Reflects downloads up to 10 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Parm: Efficient Training of Large Sparsely-Activated Models with Dedicated SchedulesIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621327(1880-1889)Online publication date: 20-May-2024
  • (2024)SparDL: Distributed Deep Learning Training with Efficient Sparse Communication2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00142(1752-1764)Online publication date: 13-May-2024
  • (2023)Baileys: An Efficient Distributed Machine Learning Framework by Dynamic GroupingProceedings of the 2023 15th International Conference on Machine Learning and Computing10.1145/3587716.3587731(92-96)Online publication date: 17-Feb-2023
  • (2023)PipeMoE: Accelerating Mixture-of-Experts through Adaptive PipeliningIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228874(1-10)Online publication date: 17-May-2023
  • (2023)Flexible Communication for Optimal Distributed Learning over Unpredictable Networks2023 IEEE International Conference on Big Data (BigData)10.1109/BigData59044.2023.10386724(925-935)Online publication date: 15-Dec-2023
  • (2022)SDN-Based Traffic Monitoring in Data Center Network Using Floodlight ControllerInternational Journal of Intelligent Information Technologies10.4018/IJIIT.30959018:3(1-13)Online publication date: 22-Sep-2022
  • (2022)Optimizing All-to-All Collective Communication on Tianhe Supercomputer2022 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)10.1109/ISPA-BDCloud-SocialCom-SustainCom57177.2022.00058(402-409)Online publication date: Dec-2022
  • (2022)Addressing Network Bottlenecks with Divide-and-Shuffle Synchronization for Distributed DNN TrainingIEEE INFOCOM 2022 - IEEE Conference on Computer Communications10.1109/INFOCOM48880.2022.9796688(320-329)Online publication date: 2-May-2022
  • (2021)Novel HTTPS classifier driven by packet bursts, flows, and machine learning2021 17th International Conference on Network and Service Management (CNSM)10.23919/CNSM52442.2021.9615561(345-349)Online publication date: 25-Oct-2021
  • (2021)MG-WFBP: Merging Gradients Wisely for Efficient Communication in Distributed Deep LearningIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.305286232:8(1903-1917)Online publication date: 1-Aug-2021
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media