{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:34Z","timestamp":1750306534508,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,10,27]],"date-time":"2014-10-27T00:00:00Z","timestamp":1414368000000},"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":[[2014,10,27]]},"DOI":"10.1145\/2670518.2673886","type":"proceedings-article","created":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T13:40:05Z","timestamp":1415713205000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["FUBAR"],"prefix":"10.1145","author":[{"given":"Nikola","family":"Gvozdiev","sequence":"first","affiliation":[{"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brad","family":"Karp","sequence":"additional","affiliation":[{"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Handley","sequence":"additional","affiliation":[{"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Hurricane Electric IP Transit Network. https:\/\/www.he.net.  Hurricane Electric IP Transit Network. https:\/\/www.he.net."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"key":"e_1_3_2_1_3_1","first-page":"2992","article-title":"Analysis of an Equal-Cost Multi-Path Algorithm","author":"Hopps C.","year":"2000","unstructured":"C. Hopps . Analysis of an Equal-Cost Multi-Path Algorithm . RFC 2992 , 2000 . C. Hopps. Analysis of an Equal-Cost Multi-Path Algorithm. RFC 2992, 2000.","journal-title":"RFC"},{"key":"e_1_3_2_1_4_1","first-page":"2702","author":"Awduche D.","year":"2009","unstructured":"D. Awduche and J. Malcolm . Requirements for Traffic Engineering Over MPLS. RFC 2702 , 2009 . D. Awduche and J. Malcolm. Requirements for Traffic Engineering Over MPLS. RFC 2702, 2009.","journal-title":"Requirements for Traffic Engineering Over MPLS. RFC"},{"key":"e_1_3_2_1_5_1","volume-title":"Morgan Kauffmann","author":"Davie B.","year":"2008","unstructured":"B. Davie and A. Farrel . MPLS: Next Steps . Morgan Kauffmann , 2008 . B. Davie and A. Farrel. MPLS: Next Steps. Morgan Kauffmann, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.414637"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159926"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486020"}],"event":{"name":"HotNets-XIII: The 13th ACM Workshop on Hot Topics in Networks","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","CISCO"],"location":"Los Angeles CA USA","acronym":"HotNets-XIII"},"container-title":["Proceedings of the 13th ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2670518.2673886","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2670518.2673886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:18Z","timestamp":1750227138000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2670518.2673886"}},"subtitle":["Flow Utility Based Routing"],"short-title":[],"issued":{"date-parts":[[2014,10,27]]},"references-count":13,"alternative-id":["10.1145\/2670518.2673886","10.1145\/2670518"],"URL":"https:\/\/doi.org\/10.1145\/2670518.2673886","relation":{},"subject":[],"published":{"date-parts":[[2014,10,27]]},"assertion":[{"value":"2014-10-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}