On the Complexity of Traffic Traces and Implications
This paper presents a systematic approach to identify and quantify the types of structures featured by packettraces in communication networks. Our approach leverages an information-theoretic methodology, based oniterative randomization and compression of the packet trace, which allows us to systemat...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/129523 |
| _version_ | 1826216346798522368 |
|---|---|
| author | Ghobadi, Manya |
| author_facet | Ghobadi, Manya |
| author_sort | Ghobadi, Manya |
| collection | MIT |
| description | This paper presents a systematic approach to identify and quantify the types of structures featured by packettraces in communication networks. Our approach leverages an information-theoretic methodology, based oniterative randomization and compression of the packet trace, which allows us to systematically remove andmeasure dimensions of structure in the trace. In particular, we introduce the notion oftrace complexitywhichapproximates the entropy rate of a packet trace. Considering several real-world traces, we show that tracecomplexity can provide unique insights into the characteristics of various applications. Based on our approach,we also propose a traffic generator model able to produce a synthetic trace that matches the complexity levelsof its corresponding real-world trace. Using a case study in the context of datacenters, we show that insightsinto the structure of packet traces can lead to improved demand-aware network designs: datacenter topologiesthat are optimized for specific traffic patterns. |
| first_indexed | 2024-09-23T16:46:11Z |
| format | Article |
| id | mit-1721.1/129523 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T16:46:11Z |
| publishDate | 2021 |
| publisher | Association for Computing Machinery (ACM) |
| record_format | dspace |
| spelling | mit-1721.1/1295232022-09-29T21:22:41Z On the Complexity of Traffic Traces and Implications Ghobadi, Manya This paper presents a systematic approach to identify and quantify the types of structures featured by packettraces in communication networks. Our approach leverages an information-theoretic methodology, based oniterative randomization and compression of the packet trace, which allows us to systematically remove andmeasure dimensions of structure in the trace. In particular, we introduce the notion oftrace complexitywhichapproximates the entropy rate of a packet trace. Considering several real-world traces, we show that tracecomplexity can provide unique insights into the characteristics of various applications. Based on our approach,we also propose a traffic generator model able to produce a synthetic trace that matches the complexity levelsof its corresponding real-world trace. Using a case study in the context of datacenters, we show that insightsinto the structure of packet traces can lead to improved demand-aware network designs: datacenter topologiesthat are optimized for specific traffic patterns. European Union. Horizon 2020 Research and Innovation Programme (Agreement 864228 AdjustNet: Self-Adjusting Networks) 2021-01-22T13:42:25Z 2021-01-22T13:42:25Z 2020-03 2020-12-15T16:14:49Z Article http://purl.org/eprint/type/ConferencePaper 2476-1249 https://hdl.handle.net/1721.1/129523 Chen, Avin et al. “On the Complexity of Traffic Traces and Implications.” Proceedings of the ACM on Measurement and Analysis of Computing Systems, 4, 1 (March 2020): Article 20 © 2020 The Author(s) en 10.1145/3379486 Proceedings of the ACM on Measurement and Analysis of Computing Systems Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Association for Computing Machinery (ACM) MIT web domain |
| spellingShingle | Ghobadi, Manya On the Complexity of Traffic Traces and Implications |
| title | On the Complexity of Traffic Traces and Implications |
| title_full | On the Complexity of Traffic Traces and Implications |
| title_fullStr | On the Complexity of Traffic Traces and Implications |
| title_full_unstemmed | On the Complexity of Traffic Traces and Implications |
| title_short | On the Complexity of Traffic Traces and Implications |
| title_sort | on the complexity of traffic traces and implications |
| url | https://hdl.handle.net/1721.1/129523 |
| work_keys_str_mv | AT ghobadimanya onthecomplexityoftraffictracesandimplications |