{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:39:39Z","timestamp":1771702779966,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T00:00:00Z","timestamp":1376611200000},"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":[[2013,8,16]]},"DOI":"10.1145\/2491185.2491205","type":"proceedings-article","created":{"date-parts":[[2013,8,20]],"date-time":"2013-08-20T14:07:21Z","timestamp":1377007641000},"page":"97-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["OF.CPP"],"prefix":"10.1145","author":[{"given":"Peter","family":"Pere\u0161\u00edni","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Kuzniar","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nedeljko","family":"Vasi\u0107","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Canini","sequence":"additional","affiliation":[{"name":"TU Berlin \/ T-Labs, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dejan","family":"Kosti\u016b","sequence":"additional","affiliation":[{"name":"Institute IMDEA Networks, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Causal memory: Definitions, implementation and programming","author":"Ahamad M.","year":"1994","unstructured":"M. Ahamad , G. Neiger , J. E. Burns , P. Kohli , and P. Hutto . Causal memory: Definitions, implementation and programming , 1994 . M. Ahamad, G. Neiger, J. E. Burns, P. Kohli, and P. Hutto. Causal memory: Definitions, implementation and programming, 1994."},{"key":"e_1_3_2_1_2_1","volume-title":"Concurrency control and recovery in database systems","author":"Bernstein P. A.","year":"1987","unstructured":"P. A. Bernstein , V. Hadzilacos , and N. Goodman . Concurrency control and recovery in database systems . Addison-Wesley Longman , 1987 . P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison-Wesley Longman, 1987."},{"key":"e_1_3_2_1_3_1","volume-title":"NSDI","author":"Canini M.","year":"2012","unstructured":"M. Canini , D. Venzano , P. Pere\u0161\u00edni , D. Kosti\u0107 , and J. Rexford . A NICE Way to Test OpenFlow Applications . In NSDI , 2012 . M. Canini, D. Venzano, P. Pere\u0161\u00edni, D. Kosti\u0107, and J. Rexford. A NICE Way to Test OpenFlow Applications. In NSDI, 2012."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018466"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034812"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2413176.2413206"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342441.2342453"},{"key":"e_1_3_2_1_8_1","volume-title":"NSDI","author":"Kazemian P.","year":"2012","unstructured":"P. Kazemian , G. Varghese , and N. McKeown . Header Space Analysis: Static Checking for Networks . In NSDI , 2012 . P. Kazemian, G. Varghese, and N. McKeown. Header Space Analysis: Static Checking for Networks. In NSDI, 2012."},{"key":"e_1_3_2_1_9_1","volume-title":"NSDI","author":"Khurshid A.","year":"2013","unstructured":"A. Khurshid , X. Zou , W. Zhou , M. Caesar , and P. B. Godfrey . Veriflow: Verifying network-wide invariants in real time . In NSDI , 2013 . A. Khurshid, X. Zou, W. Zhou, M. Caesar, and P. B. Godfrey. Veriflow: Verifying network-wide invariants in real time. In NSDI, 2013."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645916.671971"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_3_2_1_12_1","volume-title":"NSDI","author":"Monsanto C.","year":"2013","unstructured":"C. Monsanto , J. Reich , N. Foster , J. Rexford , and D. Walker . Composing Software Defined Networks . In NSDI , 2013 . C. Monsanto, J. Reich, N. Foster, J. Rexford, and D. Walker. Composing Software Defined Networks. In NSDI, 2013."},{"key":"e_1_3_2_1_13_1","volume-title":"EPFL","author":"Peresini P.","year":"2013","unstructured":"P. Peresini , M. Kuzniar , N. Vasic , M. Canini , and D. Kostic . OF.CPP: Consistent Packet Processing for OpenFlow. Technical report , EPFL , 2013 . P. Peresini, M. Kuzniar, N. Vasic, M. Canini, and D. Kostic. OF.CPP: Consistent Packet Processing for OpenFlow. Technical report, EPFL, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342427"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00033-6"}],"event":{"name":"SIGCOMM'13: ACM SIGCOMM 2013 Conference","location":"Hong Kong China","acronym":"SIGCOMM'13","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491185.2491205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2491185.2491205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:37Z","timestamp":1750235977000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491185.2491205"}},"subtitle":["consistent packet processing for openflow"],"short-title":[],"issued":{"date-parts":[[2013,8,16]]},"references-count":15,"alternative-id":["10.1145\/2491185.2491205","10.1145\/2491185"],"URL":"https:\/\/doi.org\/10.1145\/2491185.2491205","relation":{},"subject":[],"published":{"date-parts":[[2013,8,16]]},"assertion":[{"value":"2013-08-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}