{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:21:01Z","timestamp":1750220461163,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3472456.3472465","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:46:04Z","timestamp":1633459564000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["sRouting: Towards a Better Flow Size Estimation Performance through Routing and Sketch Configuration"],"prefix":"10.1145","author":[{"given":"Yang","family":"Shi","sequence":"first","affiliation":[{"name":"National University of Defense Technology, China"}]},{"given":"Mei","family":"Wen","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, China"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Lei Cai Dianjun Chen and Luyong Zhang. 2017. A strategy of dynamic routing based on SDN. Infinite Study.  Lei Cai Dianjun Chen and Luyong Zhang. 2017. A strategy of dynamic routing based on SDN. Infinite Study.","DOI":"10.12783\/dtcse\/icmsie2017\/18681"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.231911"},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Charikar Moses","key":"e_1_3_2_1_4_1","unstructured":"Moses Charikar , Kevin Chen , and Martin Farach-Colton . 2002. Finding frequent items in data streams . In International Colloquium on Automata, Languages, and Programming . Springer , 693\u2013703. Moses Charikar, Kevin Chen, and Martin Farach-Colton. 2002. Finding frequent items in data streams. In International Colloquium on Automata, Languages, and Programming. Springer, 693\u2013703."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848111"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_7_1","unstructured":"Count-Min Sketch 2019. An open source implementation of Count-Min Sketch. https:\/\/github.com\/rafacarrascosa\/countminsketch.  Count-Min Sketch 2019. An open source implementation of Count-Min Sketch. https:\/\/github.com\/rafacarrascosa\/countminsketch."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.2968979"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015495"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/859716.859719"},{"volume-title":"Annals of discrete mathematics. Vol.\u00a05","author":"Graham L","key":"e_1_3_2_1_11_1","unstructured":"Ronald\u00a0 L Graham , Eugene\u00a0 L Lawler , Jan\u00a0Karel Lenstra , and AH G\u00a0Rinnooy Kan . 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey . In Annals of discrete mathematics. Vol.\u00a05 . Elsevier , 287\u2013326. Ronald\u00a0L Graham, Eugene\u00a0L Lawler, Jan\u00a0Karel Lenstra, and AHG\u00a0Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. In Annals of discrete mathematics. Vol.\u00a05. Elsevier, 287\u2013326."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2011.5772058"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524613"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098831"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626307"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890969"},{"key":"e_1_3_2_1_17_1","volume-title":"13th USENIX Symposium on Networked Systems Design and Implementation NSDI 16)","author":"Li Yuliang","year":"2016","unstructured":"Yuliang Li , Rui Miao , Changhoon Kim , and Minlan Yu . 2016 . Flowradar: A better netflow for data centers . In 13th USENIX Symposium on Networked Systems Design and Implementation NSDI 16) . 311\u2013324. Yuliang Li, Rui Miao, Changhoon Kim, and Minlan Yu. 2016. Flowradar: A better netflow for data centers. In 13th USENIX Symposium on Networked Systems Design and Implementation NSDI 16). 311\u2013324."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342076"},{"volume-title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","author":"Mitzenmacher Michael","key":"e_1_3_2_1_19_1","unstructured":"Michael Mitzenmacher and Eli Upfal . 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis . Cambridge University Press . Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge University Press."},{"key":"e_1_3_2_1_20_1","unstructured":"Monash networks 2020. The Network Topology From the Monash University. http:\/\/www.ecse.monash.edu.au\/twiki\/bin\/view\/InFocus\/LargePacketswitchingNetworkTopologies  Monash networks 2020. The Network Topology From the Monash University. http:\/\/www.ecse.monash.edu.au\/twiki\/bin\/view\/InFocus\/LargePacketswitchingNetworkTopologies"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836099"},{"key":"e_1_3_2_1_22_1","volume-title":"Gurobi optimizer reference manual","author":"GUROBI OPTIMIZATION.","year":"2015","unstructured":"GUROBI OPTIMIZATION. 2014. INC. Gurobi optimizer reference manual , 2015 . URL : http:\/\/www. gurobi. com(2014), 29. GUROBI OPTIMIZATION. 2014. INC. Gurobi optimizer reference manual, 2015. URL: http:\/\/www. gurobi. com(2014), 29."},{"key":"e_1_3_2_1_23_1","unstructured":"P. Phaal and M. Lavine.2019. sFlow.https:\/\/sflow.org\/  P. Phaal and M. Lavine.2019. sFlow.https:\/\/sflow.org\/"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737385"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159991"},{"key":"e_1_3_2_1_27_1","volume-title":"Incremental Deployment of Programmable Switches for Sketch-based Network Measurement. In 2020 IEEE Symposium on Computers and Communications (ISCC). IEEE, 1\u20137.","author":"Shi Yang","year":"2020","unstructured":"Yang Shi , Mei Wen , and Chunyuan Zhang . 2020 . Incremental Deployment of Programmable Switches for Sketch-based Network Measurement. In 2020 IEEE Symposium on Computers and Communications (ISCC). IEEE, 1\u20137. Yang Shi, Mei Wen, and Chunyuan Zhang. 2020. Incremental Deployment of Programmable Switches for Sketch-based Network Measurement. In 2020 IEEE Symposium on Computers and Communications (ISCC). IEEE, 1\u20137."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2017.02.009"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737499"},{"key":"e_1_3_2_1_30_1","first-page":"944","article-title":"System and method for network recovery from multiple link failures","volume":"7","author":"Thomson Graeme","year":"2011","unstructured":"Graeme Thomson , Cristian Radu , Andrew Riddell , and Frank Wei . 2011 . System and method for network recovery from multiple link failures . US Patent 7 , 944 ,815. Graeme Thomson, Cristian Radu, Andrew Riddell, and Frank Wei. 2011. System and method for network recovery from multiple link failures. US Patent 7,944,815.","journal-title":"US Patent"},{"key":"e_1_3_2_1_31_1","unstructured":"Intel Tofino. 2020. P4-programmable Ethernet switch ASIC that delivers better performance at lower power. https:\/\/www.intel.com\/content\/www\/us\/en\/products\/network-io\/programmable-ethernet-switch\/tofino-series.html.  Intel Tofino. 2020. P4-programmable Ethernet switch ASIC that delivers better performance at lower power. https:\/\/www.intel.com\/content\/www\/us\/en\/products\/network-io\/programmable-ethernet-switch\/tofino-series.html."},{"key":"e_1_3_2_1_32_1","unstructured":"C Walsworth E Aben KC Claffy and D Andersen. 2016. The caida anonymized internet traces.  C Walsworth E Aben KC Claffy and D Andersen. 2016. The caida anonymized internet traces."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934996"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2016.41"},{"key":"e_1_3_2_1_35_1","unstructured":"XPliant Ethernet Switch Product Family 2019. XPliant Ethernet Switch Product Family. http:\/\/www.cavium.com\/XPliant-Ethernet-Switch-Product-Family.html.  XPliant Ethernet Switch Product Family 2019. XPliant Ethernet Switch Product Family. http:\/\/www.cavium.com\/XPliant-Ethernet-Switch-Product-Family.html."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3002783"}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","acronym":"ICPP 2021","location":"Lemont IL USA"},"container-title":["50th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472465","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3472465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:11Z","timestamp":1750193291000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":37,"alternative-id":["10.1145\/3472456.3472465","10.1145\/3472456"],"URL":"https:\/\/doi.org\/10.1145\/3472456.3472465","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}