research-article

On the Complexity of Traffic Traces and Implications

Authors:

Stefan SchmidAuthors Info & Claims

Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 4, Issue 1

Article No.: 20, Pages 1 - 29

https://doi.org/10.1145/3379486

Published: 27 May 2020 Publication History

Abstract

This paper presents a systematic approach to identify and quantify the types of structures featured by packet traces in communication networks. Our approach leverages an information-theoretic methodology, based on iterative randomization and compression of the packet trace, which allows us to systematically remove and measure dimensions of structure in the trace. In particular, we introduce the notion of \emphtrace complexity which approximates the entropy rate of a packet trace. Considering several real-world traces, we show that trace complexity 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 levels of its corresponding real-world trace. Using a case study in the context of datacenters, we show that insights into the structure of packet traces can lead to improved demand-aware network designs: datacenter topologies that are optimized for specific traffic patterns.

References

[1]

7-zip. [n. d.]. https://www.7-zip.org/.

[2]

Mohammad Al-Fares, Alexander Loukissas, and Amin Vahdat. 2008. A Scalable, Commodity Data Center Network Architecture. Proc. SIGCOMM Computer Communication Review (CCR), Vol. 38, 4 (Aug. 2008), 63--74. https://doi.org/10.1145/1402946.1402967

Digital Library

[3]

Alaa R Alameldeen, Milo MK Martin, Carl J Mauer, Kevin E Moore, Min Xu, Mark D Hill, David A Wood, and Daniel J Sorin. 2003. Simulating a $2 M Commercial Server on a $2 K PC. IEEE Computer, Vol. 36, 2 (2003), 50--57.

Digital Library

[4]

Mohammad Alizadeh, Albert Greenberg, David A Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan. 2010. Data Center TCP (DCTCP). In Proc. ACM SIGCOMM Computer Communication Review (CCR), Vol. 40. 63--74.

Digital Library

[5]

Mohammad Alizadeh, Shuang Yang, Milad Sharif, Sachin Katti, Nick McKeown, Balaji Prabhakar, and Scott Shenker. 2013a. pFabric: Minimal near-optimal datacenter transport. In ACM SIGCOMM Computer Communication Review, Vol. 43. ACM, 435--446.

Digital Library

[6]

Mohammad Alizadeh, Shuang Yang, Milad Sharif, Sachin Katti, Nick McKeown, Balaji Prabhakar, and Scott Shenker. 2013b. pFabric: Minimal Near-optimal Datacenter Transport. In Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM (SIGCOMM '13). ACM, New York, NY, USA, 435--446. https://doi.org/10.1145/2486001.2486031

Digital Library

[7]

José M Amigó, Janusz Szczepa'nski, Elek Wajnryb, and Maria V Sanchez-Vives. 2004. Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity. Neural Computation, Vol. 16, 4 (2004), 717--736.

Digital Library

[8]

Chen Avin, Alexandr Hercules, Andreas Loukas, and Stefan Schmid. 2018. rDAN: Toward Robust Demand-Aware Network Designs. In Information Processing Letters (IPL), Vol. 133. 5--9.

[9]

Chen Avin, Kaushik Mondal, and Stefan Schmid. 2017. Demand-Aware Network Designs of Bounded Degree. Distributed Computing (2017), 1--15.

[10]

Chen Avin, Kaushik Mondal, and Stefan Schmid. 2019 a. Demand-Aware Network Design with Minimal Congestion and Route Lengths. In IEEE INFOCOM 2019-IEEE Conference on Computer Communications. IEEE, 1351--1359.

[11]

Chen Avin, Iosif Salem, and Stefan Schmid. 2019 b. Brief Announcement: On Self-Adjusting Skip List Networks. In Proc. 33rd International Symposium on Distributed Computing (DISC). Dagstuhl, Germany.

[12]

Chen Avin, Iosif Salem, and Stefan Schmid. 2020. Working Set Theorems for Routing in Self-Adjusting Skip List Networks. In Proc. IEEE INFOCOM .

Digital Library

[13]

Chen Avin and Stefan Schmid. 2019 a. ReNets: Toward Statically Optimal Self-Adjusting Networks. arXiv preprint arXiv:1904.03263 (2019).

[14]

Chen Avin and Stefan Schmid. 2019 b. Toward demand-aware networking: A theory for self-adjusting networks. ACM SIGCOMM Computer Communication Review, Vol. 48, 5 (2019), 31--40.

Digital Library

[15]

Paul Barford and Mark Crovella. 1998. Generating Representative Web Workloads for Network and Server Performance Evaluation. In ACM SIGMETRICS Performance Evaluation Review, Vol. 26. ACM, 151--160.

Digital Library

[16]

Theophilus Benson, Aditya Akella, and David A Maltz. 2010. Network Traffic Characteristics of Data Centers in the Wild. In Proc. ACM SIGCOMM Conference on Internet Measurement (IMC). ACM, 267--280.

Digital Library

[17]

Theophilus Benson, Ashok Anand, Aditya Akella, and Ming Zhang. 2009. Understanding Data Center Traffic Characteristics. In Proc. 1st ACM Workshop on Research on Enterprise Networking (WREN). ACM, 65--72.

Digital Library

[18]

Theophilus Benson, Ashok Anand, Aditya Akella, and Ming Zhang. 2011. MicroTE: Fine Grained Traffic Engineering for Data Centers. In Proc. 7th Conference on emerging Networking EXperiments and Technologies (CoNEXT). ACM, 8.

Digital Library

[19]

Andrej Bratko, Gordon V Cormack, Bogdan Filipivc, Thomas R Lynam, and Blavz Zupan. 2006. Spam Filtering Using Statistical Data Compression Models. Journal of machine learning research, Vol. 7, Dec (2006), 2673--2698.

Digital Library

[20]

Jin Cao, Drew Davis, Scott Vander Wiel, and Bin Yu. 2000. Time-Varying Network Tomography: Router Link Data. Journal of the American statistical association, Vol. 95, 452 (2000), 1063--1075.

[21]

Kai Chen, Ankit Singla, Atul Singh, Kishore Ramachandran, Lei Xu, Yueping Zhang, Xitao Wen, and Yan Chen. 2014. OSA: An Optical Switching Architecture for Data Center Networks With Unprecedented Flexibility. IEEE/ACM Transactions on Networking (TON), Vol. 22, 2 (2014), 498--511.

Digital Library

[22]

Thomas M Cover and Joy A Thomas. 2012. Elements of information theory .John Wiley & Sons.

[23]

David Roxbee Cox and Valerie Isham. 1980. Point Processes . Vol. 12. CRC Press.

[24]

Noel Cressie. 1992. Statistics for Spatial Data. Terra Nova, Vol. 4, 5 (1992), 613--617.

[25]

Mark E Crovella and Azer Bestavros. 1997. Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes. IEEE/ACM Transactions on networking, Vol. 5, 6 (1997), 835--846.

[26]

Siddharth Das. 2017. CNN Architectures . https://medium.com/@sidereal/cnns-architectures-lenet-alexnet-vgg-googlenet-resnet-and-more-666091488df5

[27]

Christina Delimitrou, Sriram Sankar, Aman Kansal, and Christos Kozyrakis. 2012. ECHO: Recreating Network Traffic Maps for Datacenters with Tens of Thousands of Servers. In Proc. IEEE International Symposium on Workload Characterization (IISWC). IEEE, 14--24.

Digital Library

[28]

Peter Deutsch. 1996. DEFLATE compressed data format specification version 1.3 . Technical Report.

[29]

US DOE. 2016. Characterization of the DOE Mini-apps. https://portal.nersc.gov/project/CAL/doe-miniapps.htm .

[30]

Garry A Einicke, Haider A Sabti, David V Thiel, and Marta Fernandez. 2017. Maximum-Entropy-Rate Selection of Features for Classifying Changes in Knee and Ankle Dynamics During Running. IEEE Journal of Biomedical and Health Informatics (2017).

[31]

Amr Elmasry, Arash Farzan, and John Iacono. 2013. On the Hierarchy of Distribution-Sensitive Properties for Data Structures. Acta informatica, Vol. 50, 4 (2013), 289--295.

[32]

Deniz Ersoz, Mazin S Yousif, and Chita R Das. 2007. Characterizing Network Traffic in a Cluster-Based, Multi-Tier Data Center. In Proc. IEEE 27th International Conference on Distributed Computing Systems (ICDCS). IEEE, 59.

Digital Library

[33]

E Estevez-Rams, R Lora Serrano, B Aragon Fernandez, and I Brito Reyes. 2013. On the Non-Randomness of Maximum Lempel Ziv Complexity Sequences of Finite Size. Chaos: An Interdisciplinary Journal of Nonlinear Science, Vol. 23, 2 (2013), 023118.

[34]

Nathan Farrington, George Porter, Sivasankar Radhakrishnan, Hamid Hajabdolali Bazzaz, Vikram Subramanya, Yeshaiahu Fainman, George Papen, and Amin Vahdat. 2010. Helios: a Hybrid Electrical/Optical Switch Architecture for Modular Data Centers. Proc. ACM SIGCOMM Computer Communication Review (CCR), Vol. 40, 4 (2010), 339--350.

Digital Library

[35]

Meir Feder, Neri Merhav, and Michael Gutman. 1992. Universal Prediction of Individual Sequences. IEEE Transactions on Information Theory, Vol. 38, 4 (1992), 1258--1270.

Digital Library

[36]

Klaus-Tycho Foerster, Monia Ghobadi, and Stefan Schmid. 2018. Characterizing the Algorithmic Complexity of Reconfigurable Data Center Architectures. In Proc. ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS). 89--96.

Digital Library

[37]

Klaus-Tycho Foerster and Stefan Schmid. 2019. Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity. In SIGACT News .

[38]

Mark W Garrett and Walter Willinger. 1994. Analysis, Modeling and Generation of Self-Similar VBR Video traffic. In ACM SIGCOMM computer communication review, Vol. 24. ACM, 269--280.

[39]

Monia Ghobadi, Ratul Mahajan, Amar Phanishayee, Nikhil Devanur, Janardhan Kulkarni, Gireeja Ranade, Pierre-Alexandre Blanche, Houman Rastegarfar, Madeleine Glick, and Daniel Kilper. 2016. ProjecToR: Agile Reconfigurable Data Center Interconnect. In Proc. ACM SIGCOMM . ACM, New York, NY, USA, 216--229. https://doi.org/10.1145/2934872.2934911

Digital Library

[40]

Geoffrey Gunow, John Tramm, Benoit Forget, Kord Smith, and Tim He. 2015. SimpleMOC -- A Performance Abstraction for 3D MOC. In ANS & M&C 2015 - Joint International Conference on Mathematics and Computation (M&C), Supercomputing in Nuclear Applications (SNA) and the Monte Carlo (MC) Method .

[41]

Daniel Halperin, Srikanth Kandula, Jitendra Padhye, Paramvir Bahl, and David Wetherall. 2011. Augmenting Data Center Networks with Multi-Gigabit Wireless Links. ACM SIGCOMM Computer Communication Review, Vol. 41, 4, 38--49.

Digital Library

[42]

Navid Hamedazimi, Zafar Qazi, Himanshu Gupta, Vyas Sekar, Samir R Das, Jon P Longtin, Himanshu Shah, and Ashish Tanwer. 2014. Firefly: A Reconfigurable Wireless Data Center Fabric Using Free-Space Optics. In Proc. ACM SIGCOMM Computer Communication Review (CCR), Vol. 44. 319--330.

Digital Library

[43]

Su Jia, Xin Jin, Golnaz Ghasemiesfeh, Jiaxin Ding, and Jie Gao. 2017. Competitive Analysis for Online Scheduling in Software-Defined Optical WAN. In IEEE INFOCOM 2017-IEEE Conference on Computer Communications. IEEE, 1--9.

[44]

Glenn Judd. 2015. Attaining the Promise and Avoiding the Pitfalls of TCP in the Datacenter. In Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI) . 145--157.

[45]

A Kaitchenko. 2004. Algorithms for Estimating Information Distance with Application to Bioinformatics and Linguistics. In Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No. 04CH37513), Vol. 4. IEEE, 2255--2258.

[46]

Srikanth Kandula, Sudipta Sengupta, Albert Greenberg, Parveen Patel, and Ronnie Chaiken. 2009. The Nature of Data Center Traffic: Measurements & Analysis. In Proc. 9th ACM Internet Measurement Conference (IMC). 202--208.

Digital Library

[47]

Alex Kantchelian, Justin Ma, Ling Huang, Sadia Afroz, Anthony Joseph, and JD Tygar. 2012. Robust Detection of Comment Spam Using Entropy Rate. In Proc. 5th ACM Workshop on Security and Artificial Intelligence. ACM, 59--70.

Digital Library

[48]

Simon Kassing, Asaf Valadarsky, Gal Shahaf, Michael Schapira, and Ankit Singla. 2017. Beyond Fat-Trees Without Antennae, Mirrors, and Disco-Balls. In Proc. ACM SIGCOMM . 281--294.

Digital Library

[49]

Matthew B Kennel, Jonathon Shlens, Henry DI Abarbanel, and EJ Chichilnisky. 2005. Estimating Entropy Rates with Bayesian Confidence Intervals. Neural Computation, Vol. 17, 7 (2005), 1531--1576.

Digital Library

[50]

Will E Leland, Murad S Taqqu, Walter Willinger, and Daniel V Wilson. 1994. On the Self-Similar Nature of Ethernet Traffic (extended version). IEEE/ACM Transactions on Networking (ToN), Vol. 2, 1 (1994), 1--15.

Digital Library

[51]

Abraham Lempel and Jacob Ziv. 1976. On the Complexity of Finite Sequences. IEEE Transactions on information theory, Vol. 22, 1 (1976), 75--81.

Digital Library

[52]

Ming Li and Paul Vitányi. 2008. An Introduction to Kolmogorov Complexity and its Applications. Vol. 3. Springer.

Digital Library

[53]

Nikolai Likhanov, Boris Tsybakov, and Nicolas D Georganas. 1995. Analysis of an ATM Buffer with Self-Similar ("Fractal") Input Traffic. In Proc. IEEE INFOCOM, Vol. 3. IEEE, 985--992.

[54]

He Liu, Feng Lu, Alex Forencich, Rishi Kapoor, Malveeka Tewari, Geoffrey M Voelker, George Papen, Alex C Snoeren, and George Porter. 2014. Circuit Switching Under the Radar with REACToR. In Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI), Vol. 14. 1--15.

[55]

Hongzi Mao, Ravi Netravali, and Mohammad Alizadeh. 2017. Neural Adaptive Video Streaming with Pensieve. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication (SIGCOMM '17). ACM, New York, NY, USA, 197--210. https://doi.org/10.1145/3098822.3098843

Digital Library

[56]

Alberto Medina, Nina Taft, Kave Salamatian, Supratik Bhattacharyya, and Christophe Diot. 2002. Traffic Matrix Estimation: Existing Techniques and New Directions. In ACM SIGCOMM Computer Communication Review, Vol. 32. ACM, 161--174.

Digital Library

[57]

William M Mellette, Rob McGuinness, Arjun Roy, Alex Forencich, George Papen, Alex C Snoeren, and George Porter. 2017. RotorNet: A Scalable, Low-complexity, Optical Datacenter Network. In Proc. ACM SIGCOMM . 267--280.

Digital Library

[58]

Kihong Park, Gitae Kim, and Mark Crovella. 1996. On the Relationship Between File Sizes, Transport Protocols, and Self-Similar Network Traffic. In Network Protocols, 1996. Proceedings., 1996 International Conference on. IEEE, 171--180.

[59]

Lucian Popa, Sylvia Ratnasamy, Gianluca Iannaccone, Arvind Krishnamurthy, and Ion Stoica. 2010. A Cost Comparison of Datacenter Network Architectures. In Proc. ACM CoNEXT. ACM, 16.

Digital Library

[60]

Pentti Pöyhönen. 1963. A Tentative Model for the Volume of Trade Between Countries. Weltwirtschaftliches Archiv (1963), 93--100.

[61]

Rudolf H Riedi, Matthew S Crouse, Vinay J Ribeiro, and Richard G Baraniuk. 1999. A Multifractal Wavelet Model with Application to Network Traffic. IEEE Transactions on Information Theory, Vol. 45, 3 (1999), 992--1018.

Digital Library

[62]

Matthew Roughan, Albert Greenberg, Charles Kalmanek, Michael Rumsewicz, Jennifer Yates, and Yin Zhang. 2003. Experience in Measuring Internet Backbone Traffic Variability: Models Metrics, Measurements and Meaning. In Teletraffic Science and Engineering . Vol. 5. Elsevier, 379--388.

[63]

Arjun Roy, Hongyi Zeng, Jasmeet Bagga, George Porter, and Alex C. Snoeren. 2015. Inside the Social Network's (Datacenter) Network. In Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication (Proc. ACM SIGCOMM). ACM, New York, NY, USA, 123--137. https://doi.org/10.1145/2785956.2787472

Digital Library

[64]

Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. 2015. SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Transactions on Networking, Vol. 24, 3 (2015), 1421--1433.

Digital Library

[65]

Claude Elwood Shannon. 1948. A Mathematical Theory of Communication. Bell system technical journal, Vol. 27, 3 (1948), 379--423.

[66]

Elizabeth Shriver, Arif Merchant, and John Wilkes. 1998. An Analytic Behavior Model for Disk Drives with Readahead Caches and Request Reordering. In ACM SIGMETRICS Performance Evaluation Review, Vol. 26. ACM, 182--191.

Digital Library

[67]

Ankit Singla, Atul Singh, Kishore Ramachandran, Lei Xu, and Yueping Zhang. 2010. Proteus: a Topology Malleable Data Center Network. In Proc. ACM Workshop on Hot Topics in Networks (HotNets). ACM, 8.

Digital Library

[68]

Murad S Taqqu, Vadim Teverovsky, and Walter Willinger. 1995. Estimators for Long-Range Dependence: an Empirical Study. Fractals, Vol. 3, 04 (1995), 785--798.

[69]

Kun Tu, Bruno Ribeiro, Ananthram Swami, and Don Towsley. 2018. Tracking Groups in Mobile Network Traces. In Proceedings of the 2018 Workshop on Network Meets AI & ML (NetAI'18). ACM, New York, NY, USA, 35--40. https://doi.org/10.1145/3229543.3229552

Digital Library

[70]

Asaf Valadarsky, Michael Schapira, Dafna Shahaf, and Aviv Tamar. 2017. Learning to Route. In Proceedings of the 16th ACM Workshop on Hot Topics in Networks (HotNets-XVI). ACM, New York, NY, USA, 185--191. https://doi.org/10.1145/3152434.3152441

Digital Library

[71]

Yehuda Vardi. 1996. Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data. Journal of the American statistical association, Vol. 91, 433 (1996), 365--377.

[72]

Brian Vegetabile, Jenny Molet, Tallie Z Baram, and Hal Stern. 2017. Estimating the Entropy Rate of Finite Markov Chains with Application to Behavior Studies. arXiv preprint arXiv:1711.03962 (2017).

[73]

Mengzhi Wang, Anastassia Ailamaki, and Christos Faloutsos. 2002 a. Capturing the Spatio-Temporal Behavior of Real Traffic Data. Performance Evaluation, Vol. 49, 1--4 (2002), 147--163.

Digital Library

[74]

Mengzhi Wang, Tara Madhyastha, Ngai Hang Chan, Spiros Papadimitriou, and Christos Faloutsos. 2002 b. Data Mining Meets Performance Evaluation: Fast Algorithms For Modeling Bursty Traffic. In Proceedings 18th International Conference on Data Engineering. IEEE, 507--516.

[75]

Aaron D Wyner and Jacob Ziv. 1994. The Sliding-Window Lempel-Ziv Algorithm is Asymptotically Optimal. Proc. IEEE, Vol. 82, 6 (1994), 872--877.

[76]

Shihan Xiao, Dongdong He, and Zhibo Gong. 2018. Deep-Q: Traffic-driven QoS Inference Using Deep Generative Network. In Proceedings of the 2018 Workshop on Network Meets AI & ML (NetAI'18). ACM, New York, NY, USA, 67--73. https://doi.org/10.1145/3229543.3229549

Digital Library

[77]

Qiao Zhang, Vincent Liu, Hongyi Zeng, and Arvind Krishnamurthy. 2017. High-resolution Measurement of Data Center Microbursts. In Proceedings of the 2017 Internet Measurement Conference (IMC '17). ACM, New York, NY, USA, 78--85. https://doi.org/10.1145/3131365.3131375

Digital Library

[78]

Yin Zhang, Zihui Ge, Albert Greenberg, and Matthew Roughan. 2005. Network Anomography. In Proc. 5th ACM SIGCOMM Conference on Internet Measurement (IMC). 30--30.

[79]

Yin Zhang, Matthew Roughan, Nick Duffield, and Albert Greenberg. 2003. Fast Accurate Computation of Large-scale IP Traffic Matrices from Link Loads. In Proc ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems . ACM, New York, NY, USA, 206--217. https://doi.org/10.1145/781027.781053

Digital Library

[80]

Xia Zhou, Zengbin Zhang, Yibo Zhu, Yubo Li, Saipriya Kumar, Amin Vahdat, Ben Y Zhao, and Haitao Zheng. 2012. Mirror Mirror on the Ceiling: Flexible Wireless Links for Data Centers. Proc. ACM SIGCOMM Computer Communication Review (CCR), Vol. 42, 4 (2012), 443--454.

Digital Library

[81]

Jacob Ziv and Abraham Lempel. 1977. A Universal Algorithm for Sequential Data Compression. IEEE Transactions on information theory, Vol. 23, 3 (1977), 337--343.

Digital Library

[82]

Jacob Ziv and Abraham Lempel. 1978. Compression of Individual Sequences Via Variable-Rate Coding. IEEE Transactions on Information Theory, Vol. 24, 5 (1978), 530--536.

Digital Library

[83]

Shihong Zou, Xitao Wen, Kai Chen, Shan Huang, Yan Chen, Yongqiang Liu, Yong Xia, and Chengchen Hu. 2014. VirtualKnotter: Online Virtual Machine Shuffling for Congestion Resolving in Virtualized Datacenter. Computer Networks, Vol. 67 (2014), 141--153.

Cited By

Feder EParamonov AMavrin PSalem ISchmid SAksenov V(2024)Toward Self-Adjusting $k$-Ary Search Tree Networks2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00209(1209-1211)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00209
Dai WDinitz MFoerster KLuo LSchmid S(2024)Approximation Algorithms for Minimizing Congestion in Demand-Aware NetworksIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621340(1461-1470)Online publication date: 20-May-2024
https://doi.org/10.1109/INFOCOM52122.2024.10621340
Griner CAvin CEinziger G(2024)Beyond matchings: Dynamic multi-hop topology for demand-aware datacentersComputer Networks10.1016/j.comnet.2023.110143240(110143)Online publication date: Feb-2024
https://doi.org/10.1016/j.comnet.2023.110143
Show More Cited By

Index Terms

On the Complexity of Traffic Traces and Implications
1. Mathematics of computing
  1. Information theory
2. Networks

Recommendations

On the Complexity of Traffic Traces and Implications

This paper presents a systematic approach to identify and quantify the types of structures featured by packet traces in communication networks. Our approach leverages an information-theoretic methodology, based on iterative randomization and compression ...
On the Complexity of Traffic Traces and Implications
SIGMETRICS '20: Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems

This paper presents a systematic approach to identify and quantify the types of structures featured by packet traces in communication networks. Our approach leverages an information-theoretic methodology, based on iterative randomization and compression ...
Measuring the Complexity of Traces Using Shannon Entropy
ITNG '08: Proceedings of the Fifth International Conference on Information Technology: New Generations

Exploring the content of large execution traces can be a tedious task without efficient tool support. Building efficient trace analysis tools, however, requires a good understanding of the complexity embedded in traces. Trace complexity has ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the ACM on Measurement and Analysis of Computing Systems

Proceedings of the ACM on Measurement and Analysis of Computing Systems Volume 4, Issue 1

SIGMETRICS

March 2020

467 pages

EISSN:2476-1249

DOI:10.1145/3402934

Editors:
Augustin Chaintreau
Columbia University
,
Leana Golubchik
University of Southern California
,
Zhi-Li Zhang
University of Minnesota

Issue’s Table of Contents

Copyright © 2020 ACM.

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 the author(s) 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].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 May 2020

Online AM: 07 May 2020

Published in POMACS Volume 4, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

H2020 European Research Council

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
576
Total Downloads

Downloads (Last 12 months)130
Downloads (Last 6 weeks)8

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Feder EParamonov AMavrin PSalem ISchmid SAksenov V(2024)Toward Self-Adjusting $k$-Ary Search Tree Networks2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00209(1209-1211)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00209
Dai WDinitz MFoerster KLuo LSchmid S(2024)Approximation Algorithms for Minimizing Congestion in Demand-Aware NetworksIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621340(1461-1470)Online publication date: 20-May-2024
https://doi.org/10.1109/INFOCOM52122.2024.10621340
Griner CAvin CEinziger G(2024)Beyond matchings: Dynamic multi-hop topology for demand-aware datacentersComputer Networks10.1016/j.comnet.2023.110143240(110143)Online publication date: Feb-2024
https://doi.org/10.1016/j.comnet.2023.110143
Yan FXie CZhang JXi YYao ZLiu YLin XHuang JCe YZhang XCalabretta N(2023)Network traffic characteristics of hyperscale data centers in the era of cloud applicationsJournal of Optical Communications and Networking10.1364/JOCN.49429115:10(736)Online publication date: 19-Sep-2023
https://doi.org/10.1364/JOCN.494291
Feng YXiang DMa K(2023)Heterogeneous Die-to-Die Interfaces: Enabling More Flexible Chiplet Interconnection SystemsProceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture10.1145/3613424.3614310(930-943)Online publication date: 28-Oct-2023
https://dl.acm.org/doi/10.1145/3613424.3614310
Zhang SShan SZhao S(2023)Reducing Reconfiguration Time in Hybrid Optical-Electrical Datacenter NetworksProceedings of the 7th Asia-Pacific Workshop on Networking10.1145/3600061.3600071(41-46)Online publication date: 29-Jun-2023
https://dl.acm.org/doi/10.1145/3600061.3600071
Peres BSouza OGoussevskaia OAvin CSchmid S(2023)Distributed Self-Adjusting Tree NetworksIEEE Transactions on Cloud Computing10.1109/TCC.2021.311206711:1(716-729)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TCC.2021.3112067
Hanauer KHenzinger MOst LSchmid S(2023)Dynamic Demand-Aware Link Scheduling for Reconfigurable DatacentersIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10229050(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10229050
Caldeira Cde O. Souza OGoussevskaia OSchmid S(2023)OpticNet: Self-Adjusting Networks for ToR-Matching-ToR Optical Switching ArchitecturesIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228883(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228883
Aksenov VParamonov ASalem ISchmid S(2023)Self-adjusting Linear Networks with Ladder Demand GraphStructural Information and Communication Complexity10.1007/978-3-031-32733-9_7(132-148)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1007/978-3-031-32733-9_7
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents