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.
- 7-zip. [n. d.]. https://www.7-zip.org/.Google Scholar
- 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.1402967Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.2486031Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- Chen Avin, Kaushik Mondal, and Stefan Schmid. 2017. Demand-Aware Network Designs of Bounded Degree. Distributed Computing (2017), 1--15.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Chen Avin, Iosif Salem, and Stefan Schmid. 2020. Working Set Theorems for Routing in Self-Adjusting Skip List Networks. In Proc. IEEE INFOCOM .Google Scholar
Digital Library
- Chen Avin and Stefan Schmid. 2019 a. ReNets: Toward Statically Optimal Self-Adjusting Networks. arXiv preprint arXiv:1904.03263 (2019).Google Scholar
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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.Google Scholar
Digital Library
- Thomas M Cover and Joy A Thomas. 2012. Elements of information theory .John Wiley & Sons.Google Scholar
Digital Library
- David Roxbee Cox and Valerie Isham. 1980. Point Processes . Vol. 12. CRC Press.Google Scholar
- Noel Cressie. 1992. Statistics for Spatial Data. Terra Nova , Vol. 4, 5 (1992), 613--617.Google Scholar
Cross Ref
- 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.Google Scholar
- Siddharth Das. 2017. CNN Architectures . https://medium.com/@sidereal/cnns-architectures-lenet-alexnet-vgg-googlenet-resnet-and-more-666091488df5Google Scholar
- 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.Google Scholar
Digital Library
- Peter Deutsch. 1996. DEFLATE compressed data format specification version 1.3 . Technical Report.Google Scholar
- US DOE. 2016. Characterization of the DOE Mini-apps. https://portal.nersc.gov/project/CAL/doe-miniapps.htm .Google Scholar
- 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).Google Scholar
- 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.Google Scholar
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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.Google Scholar
Digital Library
- Meir Feder, Neri Merhav, and Michael Gutman. 1992. Universal Prediction of Individual Sequences. IEEE Transactions on Information Theory , Vol. 38, 4 (1992), 1258--1270.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- Klaus-Tycho Foerster and Stefan Schmid. 2019. Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity. In SIGACT News .Google Scholar
- 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.Google Scholar
- 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.2934911Google Scholar
Digital Library
- 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 .Google Scholar
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
Cross Ref
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- Abraham Lempel and Jacob Ziv. 1976. On the Complexity of Finite Sequences. IEEE Transactions on information theory , Vol. 22, 1 (1976), 75--81.Google Scholar
Digital Library
- Ming Li and Paul Vitányi. 2008. An Introduction to Kolmogorov Complexity and its Applications. Vol. 3. Springer.Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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.Google Scholar
- 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.3098843Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
- 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.Google Scholar
Digital Library
- Pentti Pöyhönen. 1963. A Tentative Model for the Volume of Trade Between Countries. Weltwirtschaftliches Archiv (1963), 93--100.Google Scholar
- 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.Google Scholar
Digital Library
- 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.Google Scholar
- 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.2787472Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- Claude Elwood Shannon. 1948. A Mathematical Theory of Communication. Bell system technical journal , Vol. 27, 3 (1948), 379--423.Google Scholar
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- Murad S Taqqu, Vadim Teverovsky, and Walter Willinger. 1995. Estimators for Long-Range Dependence: an Empirical Study. Fractals , Vol. 3, 04 (1995), 785--798.Google Scholar
Cross Ref
- 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.3229552Google Scholar
Digital Library
- 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.3152441Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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).Google Scholar
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- Aaron D Wyner and Jacob Ziv. 1994. The Sliding-Window Lempel-Ziv Algorithm is Asymptotically Optimal. Proc. IEEE , Vol. 82, 6 (1994), 872--877.Google Scholar
Cross Ref
- 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.3229549Google Scholar
Digital Library
- 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.3131375Google Scholar
Digital Library
- Yin Zhang, Zihui Ge, Albert Greenberg, and Matthew Roughan. 2005. Network Anomography. In Proc. 5th ACM SIGCOMM Conference on Internet Measurement (IMC). 30--30.Google Scholar
- 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.781053Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- Jacob Ziv and Abraham Lempel. 1977. A Universal Algorithm for Sequential Data Compression. IEEE Transactions on information theory , Vol. 23, 3 (1977), 337--343.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
Index Terms
On the Complexity of Traffic Traces and Implications
Recommendations
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 SystemsThis 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
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 GenerationsExploring 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