{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:42Z","timestamp":1772164062754,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T00:00:00Z","timestamp":1439769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0964474"],"award-info":[{"award-number":["0964474"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,17]]},"DOI":"10.1145\/2785956.2787503","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T10:09:20Z","timestamp":1440410960000},"page":"241-254","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Scaling Up Clustered Network Appliances with ScaleBricks"],"prefix":"10.1145","author":[{"given":"Dong","family":"Zhou","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Bin","family":"Fan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Hyeontaek","family":"Lim","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"David G.","family":"Andersen","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Michael","family":"Kaminsky","sequence":"additional","affiliation":[{"name":"Intel Labs, Pittsburgh, PA, USA"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]},{"given":"Ren","family":"Wang","sequence":"additional","affiliation":[{"name":"Intel Labs, Hillsoboro, OR, USA"}]},{"given":"Ajaypal","family":"Singh","sequence":"additional","affiliation":[{"name":"Connectem, Inc., San Jose, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,8,17]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"3GPP. The Evolved Packet Core. http:\/\/www.3gpp.org\/technologies\/keywords-acronyms\/100-the-evolved-packet-core.  3GPP. The Evolved Packet Core. http:\/\/www.3gpp.org\/technologies\/keywords-acronyms\/100-the-evolved-packet-core."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402997"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_61"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159950"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2544"},{"key":"e_1_3_2_2_7_1","first-page":"636","volume-title":"Internet Mathematics","volume":"1","author":"Broder A.","year":"2002","unstructured":"A. Broder , M. Mitzenmacher , and A. Broder . Network Applications of Bloom Filters: A Survey . In Internet Mathematics , volume 1 , pages 636 -- 646 , 2002 . A. Broder, M. Mitzenmacher, and A. Broder. Network Applications of Bloom Filters: A Survey. In Internet Mathematics, volume 1, pages 636--646, 2002."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159955"},{"key":"e_1_3_2_2_9_1","first-page":"30","volume-title":"Proceedings of SODA","author":"Chazelle B.","year":"2004","unstructured":"B. Chazelle , J. Kilian , R. Rubinfeld , A. Tal , and O. Boy . The Bloomier filter: An efficient data structure for static support lookup tables . In Proceedings of SODA , pages 30 -- 39 , 2004 . B. Chazelle, J. Kilian, R. Rubinfeld, A. Tal, and O. Boy. The Bloomier filter: An efficient data structure for static support lookup tables. In Proceedings of SODA, pages 30--39, 2004."},{"key":"e_1_3_2_2_10_1","unstructured":"Connectem. Connectem Inc. http:\/\/www.connectem.net\/.  Connectem. Connectem Inc. http:\/\/www.connectem.net\/."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863979"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629578"},{"key":"e_1_3_2_2_14_1","volume-title":"Proc. 10th USENIX NSDI","author":"Fan B.","year":"2013","unstructured":"B. Fan , D. G. Andersen , and M. Kaminsky . MemC3: Compact and concurrent memcache with dumber caching and smarter hashing . In Proc. 10th USENIX NSDI , Lombard, IL , Apr. 2013 . B. Fan, D. G. Andersen, and M. Kaminsky. MemC3: Compact and concurrent memcache with dumber caching and smarter hashing. In Proc. 10th USENIX NSDI, Lombard, IL, Apr. 2013."},{"key":"e_1_3_2_2_15_1","volume-title":"Proc. HotOS XIV, Santa Ana Pueblo, NM","author":"Fan B.","year":"2013","unstructured":"B. Fan , D. Zhou , H. Lim , M. Kaminsky , and D. G. Andersen . When cycles are cheap, some tables can be huge . In Proc. HotOS XIV, Santa Ana Pueblo, NM , May 2013 . B. Fan, D. Zhou, H. Lim, M. Kaminsky, and D. G. Andersen. When cycles are cheap, some tables can be huge. In Proc. HotOS XIV, Santa Ana Pueblo, NM, May 2013."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0605009"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_2_18_1","volume-title":"Internet Engineering Task Force","author":"Haeffner W.","year":"2015","unstructured":"W. Haeffner , J. Napper , M. Stiemerling , D. Lopez , and J. Uttaro . Service Function Chaining Use Cases in Mobile Networks . Internet Engineering Task Force , Jan. 2015 . W. Haeffner, J. Napper, M. Stiemerling, D. Lopez, and J. Uttaro. Service Function Chaining Use Cases in Mobile Networks. Internet Engineering Task Force, Jan. 2015."},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. 9th USENIX NSDI","author":"Han D.","year":"2012","unstructured":"D. Han , A. Anand , F. Dogar , B. Li , H. Lim , M. Machado , A. Mukundan , W. Wu , A. Akella , D. G. Andersen , J. W. Byers , S. Seshan , and P. Steenkiste . XIA: Efficient support for evolvable internetworking . In Proc. 9th USENIX NSDI , San Jose, CA , Apr. 2012 . D. Han, A. Anand, F. Dogar, B. Li, H. Lim, M. Machado, A. Mukundan, W. Wu, A. Akella, D. G. Andersen, J. W. Byers, S. Seshan, and P. Steenkiste. XIA: Efficient support for evolvable internetworking. In Proc. 9th USENIX NSDI, San Jose, CA, Apr. 2012."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851207"},{"key":"e_1_3_2_2_21_1","unstructured":"Intel. Intel Data Plane Development Kit (Intel DPDK). http:\/\/www.intel.com\/go\/dpdk 2013.  Intel. Intel Data Plane Development Kit (Intel DPDK). http:\/\/www.intel.com\/go\/dpdk 2013."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402961"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v33:2"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043558"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2790158.2790173"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261567"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500727.2500746"},{"key":"e_1_3_2_2_28_1","first-page":"326","volume-title":"Proc. the Annual Allerton Conference on Communication Control and Computing","volume":"37","author":"Mitzenmacher M.","year":"1999","unstructured":"M. Mitzenmacher and B. Vocking . The asymptotics of selecting the shortest of two, improved . In Proc. the Annual Allerton Conference on Communication Control and Computing , volume 37 , pages 326 -- 327 , 1999 . M. Mitzenmacher and B. Vocking. The asymptotics of selecting the shortest of two, improved. In Proc. the Annual Allerton Conference on Communication Control and Computing, volume 37, pages 326--327, 1999."},{"key":"e_1_3_2_2_29_1","first-page":"255","volume-title":"Handbook of Randomized Computing","author":"Mitzenmacher M.","year":"2000","unstructured":"M. Mitzenmacher , A. W. Richa , and R. Sitaraman . The power of two random choices: A survey of techniques and results . In Handbook of Randomized Computing , pages 255 -- 312 . Kluwer , 2000 . M. Mitzenmacher, A. W. Richa, and R. Sitaraman. The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing, pages 255--312. Kluwer, 2000."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_2_31_1","unstructured":"Spirent. Spirent SPT-N11U. http:\/\/www.spirent.com\/sitecore\/content\/Home\/Ethernet_Testing\/Platforms\/11U_Chassis.  Spirent. Spirent SPT-N11U. http:\/\/www.spirent.com\/sitecore\/content\/Home\/Ethernet_Testing\/Platforms\/11U_Chassis."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802479"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658975"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535379"}],"event":{"name":"SIGCOMM '15: ACM SIGCOMM 2015 Conference","location":"London United Kingdom","acronym":"SIGCOMM '15","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2785956.2787503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:42:38Z","timestamp":1750210958000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,17]]},"references-count":34,"alternative-id":["10.1145\/2785956.2787503","10.1145\/2785956"],"URL":"https:\/\/doi.org\/10.1145\/2785956.2787503","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2829988.2787503","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,8,17]]},"assertion":[{"value":"2015-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}