{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:43:13Z","timestamp":1763458993509,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":2,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T00:00:00Z","timestamp":1503360000000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472213,61502267"],"award-info":[{"award-number":["61472213,61502267"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1018502,CC*IIE 1440745"],"award-info":[{"award-number":["CNS 1018502,CC*IIE 1440745"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Falculty Research Award"],"award-info":[{"award-number":["Falculty Research Award"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,22]]},"DOI":"10.1145\/2934872.2960424","type":"proceedings-article","created":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T12:06:52Z","timestamp":1470053212000},"page":"579-580","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["FAST"],"prefix":"10.1145","author":[{"given":"Kai","family":"Gao","sequence":"first","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Gu","sequence":"additional","affiliation":[{"name":"Tongji University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiao","family":"Xiang","sequence":"additional","affiliation":[{"name":"Tongji\/Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y. Richard","family":"Yang","sequence":"additional","affiliation":[{"name":"Tongji\/Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Bi","sequence":"additional","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Floodlight OpenFlow Controller. http:\/\/floodlight.openflowhub.org\/."},{"key":"e_1_3_2_1_2_1","volume-title":"Three fastest shortest path algorithms on real road networks: Data structures and procedures. Journal of geographic information and decision analysis, 1(1):69-82","author":"Zhan F. B.","year":"1997","unstructured":"F. B. Zhan. Three fastest shortest path algorithms on real road networks: Data structures and procedures. Journal of geographic information and decision analysis, 1(1):69-82, 1997."}],"event":{"name":"SIGCOMM '16: ACM SIGCOMM 2016 Conference","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Florianopolis Brazil","acronym":"SIGCOMM '16"},"container-title":["Proceedings of the 2016 ACM SIGCOMM Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2934872.2960424","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2934872.2960424","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2934872.2960424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:38:36Z","timestamp":1763458716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2934872.2960424"}},"subtitle":["A Simple Programming Abstraction for Complex State-Dependent SDN Programming"],"short-title":[],"issued":{"date-parts":[[2016,8,22]]},"references-count":2,"alternative-id":["10.1145\/2934872.2960424","10.1145\/2934872"],"URL":"https:\/\/doi.org\/10.1145\/2934872.2960424","relation":{},"subject":[],"published":{"date-parts":[[2016,8,22]]},"assertion":[{"value":"2016-08-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}