{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T13:53:35Z","timestamp":1787061215984,"version":"build-2736575974"},"reference-count":82,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T00:00:00Z","timestamp":1590537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["864228"],"award-info":[{"award-number":["864228"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2020,5,27]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/3379486","type":"journal-article","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T00:29:21Z","timestamp":1590625761000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["On the Complexity of Traffic Traces and Implications"],"prefix":"10.1145","volume":"4","author":[{"given":"Chen","family":"Avin","sequence":"first","affiliation":[{"name":"Ben Gurion University of the Negev, Beer-Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manya","family":"Ghobadi","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Griner","sequence":"additional","affiliation":[{"name":"Ben Gurion University of the Negev, Beer-Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,5,27]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"7-zip. [n. d.]. https:\/\/www.7-zip.org\/.  7-zip. [n. d.]. https:\/\/www.7-zip.org\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2003.1178046"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851192"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486031"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486031"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976604322860677"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.12.008"},{"key":"e_1_2_1_9_1","volume-title":"Demand-Aware Network Designs of Bounded Degree. Distributed Computing","author":"Avin Chen","year":"2017","unstructured":"Chen Avin , Kaushik Mondal , and Stefan Schmid . 2017. Demand-Aware Network Designs of Bounded Degree. Distributed Computing ( 2017 ), 1--15. Chen Avin, Kaushik Mondal, and Stefan Schmid. 2017. Demand-Aware Network Designs of Bounded Degree. Distributed Computing (2017), 1--15."},{"key":"e_1_2_1_10_1","volume-title":"Demand-Aware Network Design with Minimal Congestion and Route Lengths. In IEEE INFOCOM 2019-IEEE Conference on Computer Communications. IEEE, 1351--1359","author":"Avin Chen","year":"2019","unstructured":"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 . 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."},{"key":"e_1_2_1_11_1","volume-title":"Proc. 33rd International Symposium on Distributed Computing (DISC)","author":"Avin Chen","year":"2019","unstructured":"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. 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."},{"key":"e_1_2_1_12_1","volume-title":"Proc. IEEE INFOCOM .","author":"Avin Chen","year":"2020","unstructured":"Chen Avin , Iosif Salem , and Stefan Schmid . 2020 . Working Set Theorems for Routing in Self-Adjusting Skip List Networks . In Proc. IEEE INFOCOM . Chen Avin, Iosif Salem, and Stefan Schmid. 2020. Working Set Theorems for Routing in Self-Adjusting Skip List Networks. In Proc. IEEE INFOCOM ."},{"key":"e_1_2_1_13_1","volume-title":"2019 a. ReNets: Toward Statically Optimal Self-Adjusting Networks. arXiv preprint arXiv:1904.03263","author":"Avin Chen","year":"2019","unstructured":"Chen Avin and Stefan Schmid . 2019 a. ReNets: Toward Statically Optimal Self-Adjusting Networks. arXiv preprint arXiv:1904.03263 ( 2019 ). Chen Avin and Stefan Schmid. 2019 a. ReNets: Toward Statically Optimal Self-Adjusting Networks. arXiv preprint arXiv:1904.03263 (2019)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3310165.3310170"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/277851.277897"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592681.1592692"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079304"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248644"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2000.10474303"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_2_1_22_1","volume-title":"Elements of information theory","author":"Cover Thomas M","unstructured":"Thomas M Cover and Joy A Thomas . 2012. Elements of information theory . John Wiley & Sons . Thomas M Cover and Joy A Thomas. 2012. Elements of information theory .John Wiley & Sons."},{"key":"e_1_2_1_23_1","volume-title":"Point Processes","author":"Cox David Roxbee","unstructured":"David Roxbee Cox and Valerie Isham . 1980. Point Processes . Vol. 12 . CRC Press . David Roxbee Cox and Valerie Isham. 1980. Point Processes . Vol. 12. CRC Press."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-3121.1992.tb00605.x"},{"key":"e_1_2_1_25_1","volume-title":"Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes","author":"Crovella Mark E","year":"1997","unstructured":"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. 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."},{"key":"e_1_2_1_26_1","unstructured":"Siddharth Das. 2017. CNN Architectures . https:\/\/medium.com\/@sidereal\/cnns-architectures-lenet-alexnet-vgg-googlenet-resnet-and-more-666091488df5  Siddharth Das. 2017. CNN Architectures . https:\/\/medium.com\/@sidereal\/cnns-architectures-lenet-alexnet-vgg-googlenet-resnet-and-more-666091488df5"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2012.6402896"},{"key":"e_1_2_1_29_1","unstructured":"US DOE. 2016. Characterization of the DOE Mini-apps. https:\/\/portal.nersc.gov\/project\/CAL\/doe-miniapps.htm .  US DOE. 2016. Characterization of the DOE Mini-apps. https:\/\/portal.nersc.gov\/project\/CAL\/doe-miniapps.htm ."},{"key":"e_1_2_1_30_1","volume-title":"Maximum-Entropy-Rate Selection of Features for Classifying Changes in Knee and Ankle Dynamics During Running","author":"Einicke Garry A","year":"2017","unstructured":"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 ). 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)."},{"key":"e_1_2_1_31_1","volume-title":"On the Hierarchy of Distribution-Sensitive Properties for Data Structures. Acta informatica","author":"Elmasry Amr","year":"2013","unstructured":"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. 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."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2007.90"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4808251"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851223"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.144706"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Klaus-Tycho Foerster and Stefan Schmid. 2019. Survey of Reconfigurable Data Center Networks: Enablers Algorithms Complexity. In SIGACT News .  Klaus-Tycho Foerster and Stefan Schmid. 2019. Survey of Reconfigurable Data Center Networks: Enablers Algorithms Complexity. In SIGACT News .","DOI":"10.1145\/3351452.3351464"},{"key":"e_1_2_1_38_1","volume-title":"ACM SIGCOMM computer communication review","author":"Garrett Mark W","unstructured":"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. 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."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"e_1_2_1_40_1","unstructured":"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 .  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 ."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018442"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626328"},{"key":"e_1_2_1_43_1","volume-title":"Competitive Analysis for Online Scheduling in Software-Defined Optical WAN. In IEEE INFOCOM 2017-IEEE Conference on Computer Communications. IEEE, 1--9.","author":"Jia Su","year":"2017","unstructured":"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. 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."},{"key":"e_1_2_1_44_1","volume-title":"Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI) . 145--157","author":"Judd Glenn","year":"2015","unstructured":"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 . 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."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCECE.2004.1347695"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2381896.2381907"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098836"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1162\/0899766053723050"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.282603"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055501"},{"key":"e_1_2_1_52_1","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li Ming","unstructured":"Ming Li and Paul Vit\u00e1nyi . 2008. An Introduction to Kolmogorov Complexity and its Applications . Vol. 3 . Springer . Ming Li and Paul Vit\u00e1nyi. 2008. An Introduction to Kolmogorov Complexity and its Applications. Vol. 3. Springer."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1995.515974"},{"key":"e_1_2_1_54_1","volume-title":"Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI)","volume":"14","author":"Liu He","year":"2014","unstructured":"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. 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."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098843"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633041"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"e_1_2_1_58_1","volume-title":"Network Protocols, 1996. Proceedings., 1996 International Conference on. IEEE, 171--180","author":"Park Kihong","year":"1996","unstructured":"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 . 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."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921189"},{"key":"e_1_2_1_60_1","volume-title":"A Tentative Model for the","author":"P\u00f6yh\u00f6nen Pentti","unstructured":"Pentti P\u00f6yh\u00f6nen . 1963. A Tentative Model for the Volume of Trade Between Countries. Weltwirtschaftliches Archiv (1963), 93-- 100 . Pentti P\u00f6yh\u00f6nen. 1963. A Tentative Model for the Volume of Trade Between Countries. Weltwirtschaftliches Archiv (1963), 93--100."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.761337"},{"key":"e_1_2_1_62_1","volume-title":"Teletraffic Science and Engineering .","author":"Roughan Matthew","unstructured":"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. 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."},{"key":"e_1_2_1_63_1","volume-title":"Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication (Proc. ACM SIGCOMM). ACM","author":"Roy Arjun","unstructured":"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 10.1145\/2785956.2787472 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"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2410313"},{"key":"e_1_2_1_65_1","volume-title":"A Mathematical Theory of Communication. Bell system technical journal","author":"Shannon Claude Elwood","year":"1948","unstructured":"Claude Elwood Shannon . 1948. A Mathematical Theory of Communication. Bell system technical journal , Vol. 27 , 3 ( 1948 ), 379--423. Claude Elwood Shannon. 1948. A Mathematical Theory of Communication. Bell system technical journal , Vol. 27, 3 (1948), 379--423."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/277851.277906"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868455"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218348X95000692"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229543.3229552"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3152434.3152441"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1996.10476697"},{"key":"e_1_2_1_72_1","volume-title":"Estimating the Entropy Rate of Finite Markov Chains with Application to Behavior Studies. arXiv preprint arXiv:1711.03962","author":"Vegetabile Brian","year":"2017","unstructured":"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 ). 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)."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(02)00108-6"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994770"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.286191"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229543.3229549"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131365.3131375"},{"key":"e_1_2_1_78_1","volume-title":"Network Anomography. In Proc. 5th ACM SIGCOMM Conference on Internet Measurement (IMC). 30--30","author":"Zhang Yin","year":"2005","unstructured":"Yin Zhang , Zihui Ge , Albert Greenberg , and Matthew Roughan . 2005 . Network Anomography. In Proc. 5th ACM SIGCOMM Conference on Internet Measurement (IMC). 30--30 . Yin Zhang, Zihui Ge, Albert Greenberg, and Matthew Roughan. 2005. Network Anomography. In Proc. 5th ACM SIGCOMM Conference on Internet Measurement (IMC). 30--30."},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781053"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377761"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.03.025"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3379486","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3379486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:02:22Z","timestamp":1750183342000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3379486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,27]]},"references-count":82,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,5,27]]}},"alternative-id":["10.1145\/3379486"],"URL":"https:\/\/doi.org\/10.1145\/3379486","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,27]]},"assertion":[{"value":"2020-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}