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: | Ghobadi, Manya |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2022
|
Online Access: | https://hdl.handle.net/1721.1/129523.2 |
Similar Items
-
On the Complexity of Traffic Traces and Implications
by: Ghobadi, Manya
Published: (2021) -
On the Complexity of Traffic Traces and Implications
by: Avin, Chen, et al.
Published: (2022) -
TEAVAR: striking the right utilization-availability balance in WAN traffic engineering
by: Bogle, Jeremy(Jeremy P.), et al.
Published: (2021) -
ARROW: restoration-aware traffic engineering
by: Zhong, Zhizhen, et al.
Published: (2022) -
OptFlow: A Flow-based Abstraction for Programmable Topologies
by: Ghobadi, Manya
Published: (2022)