{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T13:49:43Z","timestamp":1767016183102,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T00:00:00Z","timestamp":1583193600000},"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":[[2020,3,3]]},"DOI":"10.1145\/3373360.3380841","type":"proceedings-article","created":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T17:35:21Z","timestamp":1583343321000},"page":"103-109","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Adaptive Weighted Traffic Splitting in Programmable Data Planes"],"prefix":"10.1145","author":[{"given":"Kuo-Feng","family":"Hsu","sequence":"first","affiliation":[{"name":"Rice University"}]},{"given":"Praveen","family":"Tammana","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Ryan","family":"Beckett","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"Ang","family":"Chen","sequence":"additional","affiliation":[{"name":"Rice University"}]},{"given":"Jennifer","family":"Rexford","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"David","family":"Walker","sequence":"additional","affiliation":[{"name":"Princeton University"}]}],"member":"320","published-online":{"date-parts":[[2020,3,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"P4-Programmable Ethernet Switch ASIC. https:\/\/www.barefootnetworks.com\/products\/brief-tofino\/.  P4-Programmable Ethernet Switch ASIC. https:\/\/www.barefootnetworks.com\/products\/brief-tofino\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Mpls traffic engineering. https:\/\/blog.ipspace.net\/2007\/02\/unequal-cost-load-sharing.html.  Mpls traffic engineering. https:\/\/blog.ipspace.net\/2007\/02\/unequal-cost-load-sharing.html."},{"key":"e_1_3_2_1_3_1","unstructured":"Ns-3 simulator. https:\/\/www.nsnam.org\/.  Ns-3 simulator. https:\/\/www.nsnam.org\/."},{"key":"e_1_3_2_1_4_1","volume-title":"USENIX NSDI","author":"Al-Fares M.","year":"2010","unstructured":"M. Al-Fares , S. Radhakrishnan , B. Raghavan , N. Huang , and A. Vahdat . Hedera: Dynamic flow scheduling for data center networks . In USENIX NSDI , 2010 . M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat. Hedera: Dynamic flow scheduling for data center networks. In USENIX NSDI, 2010."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626316"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229591.3229596"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486011"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486011"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916625"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093711"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364654.1364676"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2992"},{"key":"e_1_3_2_1_15_1","volume-title":"Contra: A programmable system for performance-aware routing, to appear in NSDI","author":"Hsu K.-F.","year":"2020","unstructured":"K.-F. Hsu , R. Beckett , A. Chen , J. Rexford , P. Tammana , and D. Walker . Contra: A programmable system for performance-aware routing, to appear in NSDI , 2020 . K.-F. Hsu, R. Beckett, A. Chen, J. Rexford, P. Tammana, and D. Walker. Contra: A programmable system for performance-aware routing, to appear in NSDI, 2020."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"e_1_3_2_1_18_1","unstructured":"S. Kandula D. Katabi S. Sinha and A. Berger. Dynamic load balancing without packet reordering. SIGCOMM Comput. Commun. Rev.  S. Kandula D. Katabi S. Sinha and A. Berger. Dynamic load balancing without packet reordering. SIGCOMM Comput. Commun. Rev."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836091"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890968"},{"key":"e_1_3_2_1_21_1","volume-title":"USENIX NSDI","author":"Kumar P.","year":"2018","unstructured":"P. Kumar , Y. Yuan , C. Yu , N. Foster , R. Kleinberg , P. Lapukhov , C. L. Lim , and R. Soul\u00e9 . Semi-oblivious traffic engineering: The road not taken . In USENIX NSDI , 2018 . P. Kumar, Y. Yuan, C. Yu, N. Foster, R. Kleinberg, P. Lapukhov, C. L. Lim, and R. Soul\u00e9. Semi-oblivious traffic engineering: The road not taken. In USENIX NSDI, 2018."},{"key":"e_1_3_2_1_22_1","author":"Michael N.","year":"2015","unstructured":"N. Michael and A. Tang . Halo: Hop-by-hop adaptive link-state optimal routing. IEEE\/ACM Transactions on Networking , 2015 . N. Michael and A. Tang. Halo: Hop-by-hop adaptive link-state optimal routing. IEEE\/ACM Transactions on Networking, 2015.","journal-title":"Halo: Hop-by-hop adaptive link-state optimal routing. IEEE\/ACM Transactions on Networking"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.94"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592803"}],"event":{"name":"SOSR '20: Symposium on SDN Research","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"San Jose CA USA","acronym":"SOSR '20"},"container-title":["Proceedings of the Symposium on SDN Research"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373360.3380841","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373360.3380841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:59Z","timestamp":1750199579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373360.3380841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,3]]},"references-count":24,"alternative-id":["10.1145\/3373360.3380841","10.1145\/3373360"],"URL":"https:\/\/doi.org\/10.1145\/3373360.3380841","relation":{},"subject":[],"published":{"date-parts":[[2020,3,3]]},"assertion":[{"value":"2020-03-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}