{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:24Z","timestamp":1750220604419,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T00:00:00Z","timestamp":1606089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Science Foundation (GIF)","award":["1367"],"award-info":[{"award-number":["1367"]}]},{"name":"Tel Aviv University"},{"name":"Israel Science Foundation (ISF)","award":["1841-14, 1595-19"],"award-info":[{"award-number":["1841-14, 1595-19"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,23]]},"DOI":"10.1145\/3386367.3431297","type":"proceedings-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:53:05Z","timestamp":1606258385000},"page":"309-322","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal approximations for traffic distribution in bounded switch memories"],"prefix":"10.1145","author":[{"given":"Yaniv","family":"Sadeh","sequence":"first","affiliation":[{"name":"Tel-Aviv University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[{"name":"Technion"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[{"name":"Tel-Aviv University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Mohammad Al-Fares Alexander Loukissas and Amin Vahdat. 2008. A scalable commodity data center network architecture. In ACM SIGCOMM.  Mohammad Al-Fares Alexander Loukissas and Amin Vahdat. 2008. A scalable commodity data center network architecture. In ACM SIGCOMM.","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_2_2_1","volume-title":"Performance analysis of OpenFlow hardware","author":"Appelman Michiel","year":"2012","unstructured":"Michiel Appelman and Maikel de Boer . 2012. Performance analysis of OpenFlow hardware . University of Amsterdam , Tech. Rep ( 2012 ). Michiel Appelman and Maikel de Boer. 2012. Performance analysis of OpenFlow hardware. University of Amsterdam, Tech. Rep (2012)."},{"volume-title":"A Dynamic Load-Balanced Hashing Scheme for Networking Applications","author":"Artan N. Sertac","key":"e_1_3_2_2_3_1","unstructured":"N. Sertac Artan , Haowei Yuan , and H. Jonathan Chao . 2008. A Dynamic Load-Balanced Hashing Scheme for Networking Applications . In IEEE GLOBECOM. N. Sertac Artan, Haowei Yuan, and H. Jonathan Chao. 2008. A Dynamic Load-Balanced Hashing Scheme for Networking Applications. In IEEE GLOBECOM."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Pat Bosshart Glen Gibb Hun-Seok Kim George Varghese Nick McKeown Martin Izzard Fernando A. Mujica and Mark Horowitz. 2013. Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN. In ACM SIGCOMM.  Pat Bosshart Glen Gibb Hun-Seok Kim George Varghese Nick McKeown Martin Izzard Fernando A. Mujica and Mark Horowitz. 2013. Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN. In ACM SIGCOMM.","DOI":"10.1145\/2486001.2486011"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.267"},{"key":"e_1_3_2_2_6_1","volume-title":"Zegura","author":"Cao Zhiruo","year":"2000","unstructured":"Zhiruo Cao , Zheng Wang , and Ellen W . Zegura . 2000 . Performance of Hashing-Based Schemes for Internet Load Balancing. In IEEE INFOCOM. Zhiruo Cao, Zheng Wang, and Ellen W. Zegura. 2000. Performance of Hashing-Based Schemes for Internet Load Balancing. In IEEE INFOCOM."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.01.011"},{"volume-title":"Constructing optimal IP routing tables","author":"Draves Richard","key":"e_1_3_2_2_8_1","unstructured":"Richard Draves , Christopher King , Srinivasan Venkatachary , and Brian Zill . 1999. Constructing optimal IP routing tables . In IEEE Infocom . Richard Draves, Christopher King, Srinivasan Venkatachary, and Brian Zill. 1999. Constructing optimal IP routing tables. In IEEE Infocom."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2992"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373360.3380841"},{"key":"e_1_3_2_2_11_1","unstructured":"Lavanya Jose Lisa Yan George Varghese and Nick McKeown. 2015. Compiling Packet Programs to Reconfigurable Switches. In USENIX NSDI.  Lavanya Jose Lisa Yan George Varghese and Nick McKeown. 2015. Compiling Packet Programs to Reconfigurable Switches. In USENIX NSDI."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232919.1232925"},{"key":"e_1_3_2_2_13_1","volume-title":"Niagara: Scalable Load Balancing on Commodity Switches. Technical Report TR-973-14.","author":"Kang Nanxi","year":"2014","unstructured":"Nanxi Kang , Monia Ghobadi , J. Reumann , A. Shraer , and J. Rexford . 2014 . Niagara: Scalable Load Balancing on Commodity Switches. Technical Report TR-973-14. Princeton . Nanxi Kang, Monia Ghobadi, J. Reumann, A. Shraer, and J. Rexford. 2014. Niagara: Scalable Load Balancing on Commodity Switches. Technical Report TR-973-14. Princeton."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Nanxi Kang Monia Ghobadi John Reumann Alexander Shraer and Jennifer Rexford. 2015. Efficient traffic splitting on commodity switches. In ACM CoNEXT.  Nanxi Kang Monia Ghobadi John Reumann Alexander Shraer and Jennifer Rexford. 2015. Efficient traffic splitting on commodity switches. In ACM CoNEXT.","DOI":"10.1145\/2716281.2836091"},{"volume-title":"IEEE International Symposium on Circuits and Systems.","author":"Kasnavi Soraya","key":"e_1_3_2_2_15_1","unstructured":"Soraya Kasnavi , Vincent C. Gaudet , Paul Berube , and Jose N. Amaral . 2005. A hardware-based longest prefix matching scheme for TCAMs . In IEEE International Symposium on Circuits and Systems. Soraya Kasnavi, Vincent C. Gaudet, Paul Berube, and Jose N. Amaral. 2005. A hardware-based longest prefix matching scheme for TCAMs. In IEEE International Symposium on Circuits and Systems."},{"volume-title":"Minimizing Rulesets for TCAM Implementation","author":"McGeer Rick","key":"e_1_3_2_2_16_1","unstructured":"Rick McGeer and Praveen Yalagandula . 2009. Minimizing Rulesets for TCAM Implementation . In IEEE INFOCOM. Rick McGeer and Praveen Yalagandula. 2009. Minimizing Rulesets for TCAM Implementation. In IEEE INFOCOM."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_2_18_1","volume-title":"Intel\u00aeEthernet Switch FM6000 Series-Software Defined Networking. Intel Coroporation","author":"Ozdag Recep","year":"2012","unstructured":"Recep Ozdag . 2012. Intel\u00aeEthernet Switch FM6000 Series-Software Defined Networking. Intel Coroporation ( 2012 ). Recep Ozdag. 2012. Intel\u00aeEthernet Switch FM6000 Series-Software Defined Networking. Intel Coroporation (2012)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486026"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Ori Rottenstreich Yossi Kanizo Haim Kaplan and Jennifer Rexford. 2018. Accurate Traffic Splitting on Commodity Switches. In ACM SPAA.  Ori Rottenstreich Yossi Kanizo Haim Kaplan and Jennifer Rexford. 2018. Accurate Traffic Splitting on Commodity Switches. In ACM SPAA.","DOI":"10.1145\/3210377.3210412"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2977477"},{"volume-title":"ORange: Multi Field OpenFlow based Range Classifier","author":"Schiff Liron","key":"e_1_3_2_2_22_1","unstructured":"Liron Schiff , Yehuda Afek , and Anat Bremler-Barr . 2015. ORange: Multi Field OpenFlow based Range Classifier . In ACM\/IEEE ANCS. Liron Schiff, Yehuda Afek, and Anat Bremler-Barr. 2015. ORange: Multi Field OpenFlow based Range Classifier. In ACM\/IEEE ANCS."},{"key":"e_1_3_2_2_23_1","volume-title":"The Encyclopedia of Integer Sequences","author":"Sloane N. J. A.","year":"1995","unstructured":"N. J. A. Sloane and Simon Plouffe . 1995. The Encyclopedia of Integer Sequences . Academic Press ( 1995 ). N. J. A. Sloane and Simon Plouffe. 1995. The Encyclopedia of Integer Sequences. Academic Press (1995)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-1000-7"},{"key":"e_1_3_2_2_25_1","unstructured":"Richard Wang Dana Butnariu and Jennifer Rexford. 2011. OpenFlow-based server load balancing gone wild. In USENIX Hot-ICE.  Richard Wang Dana Butnariu and Jennifer Rexford. 2011. OpenFlow-based server load balancing gone wild. In USENIX Hot-ICE."},{"key":"e_1_3_2_2_26_1","volume-title":"Accurate Rate-Aware Flow-level Traffic Splitting. In Allerton Conference on Communication, Control, and Computing.","author":"Wu Ning","year":"2018","unstructured":"Ning Wu , Shih-Hao Tseng , and Ao Tang . 2018 . Accurate Rate-Aware Flow-level Traffic Splitting. In Allerton Conference on Communication, Control, and Computing. Ning Wu, Shih-Hao Tseng, and Ao Tang. 2018. Accurate Rate-Aware Flow-level Traffic Splitting. In Allerton Conference on Communication, Control, and Computing."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592803"}],"event":{"name":"CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Barcelona Spain","acronym":"CoNEXT '20"},"container-title":["Proceedings of the 16th International Conference on emerging Networking EXperiments and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386367.3431297","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3386367.3431297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:32:04Z","timestamp":1750195924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386367.3431297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,23]]},"references-count":27,"alternative-id":["10.1145\/3386367.3431297","10.1145\/3386367"],"URL":"https:\/\/doi.org\/10.1145\/3386367.3431297","relation":{},"subject":[],"published":{"date-parts":[[2020,11,23]]},"assertion":[{"value":"2020-11-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}