{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:45:38Z","timestamp":1778859938650,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T00:00:00Z","timestamp":1489449600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["TS-1111520"],"award-info":[{"award-number":["TS-1111520"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-12-1-0757"],"award-info":[{"award-number":["N00014-12-1-0757"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,3,14]]},"DOI":"10.1145\/2890955.2890968","type":"proceedings-article","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T08:23:45Z","timestamp":1467707025000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":342,"title":["HULA"],"prefix":"10.1145","author":[{"given":"Naga","family":"Katta","sequence":"first","affiliation":[{"name":"Princeton University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mukesh","family":"Hira","sequence":"additional","affiliation":[{"name":"VMware"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changhoon","family":"Kim","sequence":"additional","affiliation":[{"name":"Barefoot Networks"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirudh","family":"Sivaraman","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Rexford","sequence":"additional","affiliation":[{"name":"Princeton University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,3,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535373"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2013.23"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626309"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2482626.2482656"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070584"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486031"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626315"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855711.1855730"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079304"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535375"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232919.1232925"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535397"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626316"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486011"},{"key":"e_1_3_2_1_17_1","unstructured":"\"Intel FlexPipe.\" http:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/product-briefs\/ethernet-switch-fm6000-series-brief.pdf."},{"key":"e_1_3_2_1_18_1","unstructured":"\"Cavium and XPliant introduce a fully programmable switch silicon family scaling to 3.2 terabits per second.\" http:\/\/tinyurl.com\/nzbqtr3."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1952077"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592575"},{"key":"e_1_3_2_1_22_1","unstructured":"\"Cisco's massively scalable data center.\" http:\/\/www.cisco.com\/c\/dam\/en\/us\/td\/docs\/solutions\/Enterprise\/Data_Center\/MSDC\/1-0\/MSDC_AAG_1.pdf Sept 2015."},{"key":"e_1_3_2_1_23_1","unstructured":"\"High Capacity StrataXGS\u00aeTrident II Ethernet Switch Series.\" http:\/\/www.broadcom.com\/products\/Switching\/Data-Center\/BCM56850-Series."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789770.2789772"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592576"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2195503"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366841"},{"key":"e_1_3_2_1_29_1","unstructured":"\"P4 Specification.\" http:\/\/p4.org\/wp-content\/uploads\/2015\/11\/p4-v1.1rc-Nov-17.pdf."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2537857.2537865"},{"key":"e_1_3_2_1_31_1","first-page":"05023","article-title":"Packet transactions: A programming model for data-plane algorithms at hardware speed","volume":"1512","author":"Sivaraman A.","year":"2015","unstructured":"A. Sivaraman, M. Budiu, A. Cheung, C. Kim, S. Licking, G. Varghese, H. Balakrishnan, M. Alizadeh, and N. McKeown, \"Packet transactions: A programming model for data-plane algorithms at hardware speed,\" CoRR, vol. abs\/1512.05023, 2015.","journal-title":"CoRR"},{"key":"e_1_3_2_1_32_1","unstructured":"\"Protocol-independent switch architecture.\" http:\/\/schd.ws\/hosted_files\/p4workshop2015\/c9\/NickM-P4-Workshop-June-04-2015.pdf."},{"key":"e_1_3_2_1_33_1","unstructured":"\"Members of the p4 consortium.\" http:\/\/p4.org\/join-us\/."},{"key":"e_1_3_2_1_34_1","unstructured":"\"P4's action-execution semantics and conditional operators.\" https:\/\/github.com\/anirudhSK\/p4-semantics\/raw\/master\/p4-semantics.pdf."},{"key":"e_1_3_2_1_35_1","unstructured":"Private communication with the authors of CONGA."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787507"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018467"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789770.2789802"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342390"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"e_1_3_2_1_42_1","first-page":"1300","article-title":"Mate: Mpls adaptive traffic engineering","author":"Elwalid A.","year":"2001","unstructured":"A. Elwalid, C. Jin, S. Low, and I. Widjaja, \"Mate: Mpls adaptive traffic engineering,\" in IEEE INFOCOM 2001, pp. 1300--1309 vol. 3.","journal-title":"IEEE INFOCOM"},{"issue":"99","key":"e_1_3_2_1_43_1","first-page":"1","article-title":"Halo: Hop-by-hop adaptive link-state optimal routing","author":"Mchael N.","year":"2014","unstructured":"N. Mchael and A. Tang, \"Halo: Hop-by-hop adaptive link-state optimal routing,\" Networking, IEEE\/ACM Transactions on, vol. PP, no. 99, pp. 1--1, 2014.","journal-title":"Networking, IEEE\/ACM Transactions on"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093711"}],"event":{"name":"SOSR '16: Symposium on SDN Research","location":"Santa Clara CA USA","acronym":"SOSR '16","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ONS Open Networking Summit"]},"container-title":["Proceedings of the Symposium on SDN Research"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2890955.2890968","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2890955.2890968","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2890955.2890968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:22:30Z","timestamp":1763457750000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2890955.2890968"}},"subtitle":["Scalable Load Balancing Using Programmable Data Planes"],"short-title":[],"issued":{"date-parts":[[2016,3,14]]},"references-count":44,"alternative-id":["10.1145\/2890955.2890968","10.1145\/2890955"],"URL":"https:\/\/doi.org\/10.1145\/2890955.2890968","relation":{},"subject":[],"published":{"date-parts":[[2016,3,14]]},"assertion":[{"value":"2016-03-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}