{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:21:16Z","timestamp":1750220476277,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:00:00Z","timestamp":1633910400000},"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,10,11]]},"DOI":"10.1145\/3482898.3483367","type":"proceedings-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T11:07:28Z","timestamp":1636369648000},"page":"169-175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["How Much TCAM do we Need for Splitting Traffic?"],"prefix":"10.1145","author":[{"given":"Yaniv","family":"Sadeh","sequence":"first","affiliation":[{"name":"Tel-Aviv University"}]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[{"name":"Technion"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[{"name":"Tel-Aviv University"}]}],"member":"320","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"e_1_3_2_1_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_1_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_1_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_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219227"},{"key":"e_1_3_2_1_5_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_1_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_1_7_1","volume-title":"Traffic distribution over equal-cost-multi-paths. Computer Networks49, 4","author":"Chim Tat Wing","year":"2005","unstructured":"Tat Wing Chim , Kwan L. Yeung , and King-Shan Lui . 2005. Traffic distribution over equal-cost-multi-paths. Computer Networks49, 4 ( 2005 ), 465--475. Tat Wing Chim, Kwan L. Yeung, and King-Shan Lui. 2005. Traffic distribution over equal-cost-multi-paths. Computer Networks49, 4 (2005), 465--475."},{"key":"e_1_3_2_1_8_1","unstructured":"Prasanna Ganesan and Gurmeet Singh Manku. 2004. Optimal Routing in Chord. In ACM-SIAM SODA.176-185.  Prasanna Ganesan and Gurmeet Singh Manku. 2004. Optimal Routing in Chord. In ACM-SIAM SODA.176-185."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2992"},{"key":"e_1_3_2_1_10_1","volume-title":"Adaptive Weighted Traffic Splitting in Programmable Data Planes. In ACM Symposium on SDN Research (SOSR).","author":"Hsu Kuo-Feng","year":"2020","unstructured":"Kuo-Feng Hsu , Praveen Tammana , Ryan Beckett , Ang Chen , Jennifer Rexford , and David Walker . 2020 . Adaptive Weighted Traffic Splitting in Programmable Data Planes. In ACM Symposium on SDN Research (SOSR). Kuo-Feng Hsu, Praveen Tammana, Ryan Beckett, Ang Chen, Jennifer Rexford, and David Walker. 2020. Adaptive Weighted Traffic Splitting in Programmable Data Planes. In ACM Symposium on SDN Research (SOSR)."},{"key":"e_1_3_2_1_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_1_12_1","volume-title":"Berger","author":"Kandula Srikanth","year":"2007","unstructured":"Srikanth Kandula , Dina Katabi , Shantanu Sinha , and Arthur W . Berger . 2007 . Dynamic load balancing without packet reordering. Computer Communication Review 37, 2 (2007), 51--62. Srikanth Kandula, Dina Katabi, Shantanu Sinha, and Arthur W. Berger. 2007. Dynamic load balancing without packet reordering. Computer Communication Review37, 2 (2007), 51--62."},{"key":"e_1_3_2_1_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_1_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_1_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."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_40"},{"volume-title":"Minimizing Rulesets for TCAM Implementation","author":"McGeer Rick","key":"e_1_3_2_1_17_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_1_18_1","volume-title":"Turner","author":"McKeown Nick","year":"2008","unstructured":"Nick McKeown , Tom Anderson , Hari Balakrishnan , Guru M. Parulkar , Larry L. Peterson , Jennifer Rexford , Scott Shenker , and Jonathan S . Turner . 2008 . OpenFlow: Enabling innovation in campus networks. Computer Communication Review 38, 2 (2008), 69--74. Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru M. Parulkar, Larry L. Peterson, Jennifer Rexford, Scott Shenker, and Jonathan S. Turner. 2008. OpenFlow: Enabling innovation in campus networks. Computer Communication Review38, 2 (2008), 69--74."},{"key":"e_1_3_2_1_19_1","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_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486026"},{"volume-title":"Advances in Computers","author":"Reitwiesner George W.","key":"e_1_3_2_1_21_1","unstructured":"George W. Reitwiesner . 1960. Binary Arithmetic . Advances in Computers , Vol. 1 . Elsevier , 231--308. George W. Reitwiesner. 1960. Binary Arithmetic. Advances in Computers, Vol. 1. Elsevier, 231--308."},{"key":"e_1_3_2_1_22_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_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2977477"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Yaniv Sadeh Ori Rottenstreich and Haim Kaplan. 2020. Optimal Approximations for Traffic Distribution in Bounded Switch Memories. In ACM CoNEXT.  Yaniv Sadeh Ori Rottenstreich and Haim Kaplan. 2020. Optimal Approximations for Traffic Distribution in Bounded Switch Memories. In ACM CoNEXT.","DOI":"10.1145\/3386367.3431297"},{"key":"e_1_3_2_1_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_1_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_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592803"}],"event":{"name":"SOSR '21: The ACM SIGCOMM Symposium on SDN Research","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Virtual Event USA","acronym":"SOSR '21"},"container-title":["Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3482898.3483367","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3482898.3483367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:45Z","timestamp":1750193325000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3482898.3483367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,11]]},"references-count":27,"alternative-id":["10.1145\/3482898.3483367","10.1145\/3482898"],"URL":"https:\/\/doi.org\/10.1145\/3482898.3483367","relation":{},"subject":[],"published":{"date-parts":[[2021,10,11]]},"assertion":[{"value":"2021-11-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}