{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:10Z","timestamp":1750306270830,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,12,6]],"date-time":"2016-12-06T00:00:00Z","timestamp":1480982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["644960"],"award-info":[{"award-number":["644960"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009567","name":"Budapesti Mqszaki \u00e9s Gazdas\u00e1gtudom\u00e1nyi Egyetem","doi-asserted-by":"publisher","award":["Department of Telecommunications and Economics"],"award-info":[{"award-number":["Department of Telecommunications and Economics"]}],"id":[{"id":"10.13039\/100009567","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,12,6]]},"DOI":"10.1145\/2999572.2999585","type":"proceedings-article","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T16:28:42Z","timestamp":1480436922000},"page":"391-398","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Lying Your Way to Better Traffic Engineering"],"prefix":"10.1145","author":[{"given":"Marco","family":"Chiesa","sequence":"first","affiliation":[{"name":"Universit\u00e9 catholique de Louvain, Louvain-la-neuve, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"R\u00e9tv\u00e1ri","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,12,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2008.4483669"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018466"},{"key":"e_1_3_2_1_4_1","first-page":"2328","author":"Moy John","year":"1998","unstructured":"John Moy . OSPF version 2 . RFC 2328 , 1998 . John Moy. OSPF version 2. RFC 2328, 1998.","journal-title":"RFC"},{"key":"e_1_3_2_1_5_1","first-page":"2992","article-title":"Analysis of an ECMP Algorithm","author":"Hopps C.","year":"2000","unstructured":"C. Hopps . Analysis of an ECMP Algorithm . RFC 2992 , 2000 . www.ietf.org\/rfc\/rfc2992.txt. C. Hopps. Analysis of an ECMP Algorithm. RFC 2992, 2000. www.ietf.org\/rfc\/rfc2992.txt.","journal-title":"RFC"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000039487.35027.02"},{"key":"e_1_3_2_1_7_1","first-page":"1590","volume-title":"Michael Schapira. Traffic Engineering with Equal-Cost-MultiPath: An Algorithmic Perspective. In INFOCOM'14","author":"Chiesa Marco","year":"2014","unstructured":"Marco Chiesa , Guy Kindler , and Michael Schapira. Traffic Engineering with Equal-Cost-MultiPath: An Algorithmic Perspective. In INFOCOM'14 , pages 1590 -- 1598 , 2014 . Marco Chiesa, Guy Kindler, and Michael Schapira. Traffic Engineering with Equal-Cost-MultiPath: An Algorithmic Perspective. In INFOCOM'14, pages 1590--1598, 2014."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670518.2673868"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787497"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374415"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.886296"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21461"},{"key":"e_1_3_2_1_13_1","volume-title":"Kulfi: Robust traffic engineering using semi-oblivious routing. CoRR, abs\/1603.01203","author":"Kumar Praveen","year":"2016","unstructured":"Praveen Kumar , Yang Yuan , Chris Yu , Nate Foster , Robert D. Kleinberg , and Robert Soul\u00e9 . Kulfi: Robust traffic engineering using semi-oblivious routing. CoRR, abs\/1603.01203 , 2016 . Praveen Kumar, Yang Yuan, Chris Yu, Nate Foster, Robert D. Kleinberg, and Robert Soul\u00e9. Kulfi: Robust traffic engineering using semi-oblivious routing. CoRR, abs\/1603.01203, 2016."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208706"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_1_16_1","volume-title":"Lying Your Way to Better Traffic Engineering. CoRR, abs\/1610.02728","author":"Chiesa Marco","year":"2016","unstructured":"Marco Chiesa , G\u00e1bor R\u00e9tv\u00e1ri , and Michael Schapira . Lying Your Way to Better Traffic Engineering. CoRR, abs\/1610.02728 , 2016 . Marco Chiesa, G\u00e1bor R\u00e9tv\u00e1ri, and Michael Schapira. Lying Your Way to Better Traffic Engineering. CoRR, abs\/1610.02728, 2016."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-007-9001-7"},{"key":"e_1_3_2_1_18_1","volume-title":"IFIP Networking Conference","author":"N\u00e9meth K.","year":"2013","unstructured":"K. N\u00e9meth , A. K\u00f6r\u00f6si , and G. R\u00e9tv\u00e1ri . Optimal OSPF traffic engineering using legacy Equal Cost Multipath load balancing . In IFIP Networking Conference 2013 . K. N\u00e9meth, A. K\u00f6r\u00f6si, and G. R\u00e9tv\u00e1ri. Optimal OSPF traffic engineering using legacy Equal Cost Multipath load balancing. In IFIP Networking Conference 2013."},{"key":"e_1_3_2_1_19_1","volume-title":"www.topology-zoo.org","author":"Zoo Internet Topology","year":"2010","unstructured":"Internet Topology Zoo . www.topology-zoo.org , 2010 . Internet Topology Zoo. www.topology-zoo.org, 2010."},{"key":"e_1_3_2_1_20_1","volume-title":"http:\/\/www.cisco.com\/c\/en\/us\/support\/docs\/ip\/open-shortest-path-first-ospf\/7039--1.html","author":"Cisco Configuring OSPF","year":"2005","unstructured":"Configuring OSPF Cisco . http:\/\/www.cisco.com\/c\/en\/us\/support\/docs\/ip\/open-shortest-path-first-ospf\/7039--1.html , 2005 . Configuring OSPF Cisco. http:\/\/www.cisco.com\/c\/en\/us\/support\/docs\/ip\/open-shortest-path-first-ospf\/7039--1.html, 2005."},{"key":"e_1_3_2_1_21_1","volume-title":"Duxbury-Thomson","author":"Fourer R.","year":"2003","unstructured":"R. Fourer , D. M. Gay , and B. W. Kernighan . AMPL: A Modeling Language for Mathematical Programming . Duxbury-Thomson , 2003 . R. Fourer, D. M. Gay, and B. W. Kernighan. AMPL: A Modeling Language for Mathematical Programming. Duxbury-Thomson, 2003."},{"key":"e_1_3_2_1_22_1","volume-title":"www.mosek.com","author":"Mosek","year":"2015","unstructured":"Mosek ApS. www.mosek.com , 2015 . Mosek ApS. www.mosek.com, 2015."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637213"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633041"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.223806"},{"key":"e_1_3_2_1_26_1","volume-title":"CoNEXT","author":"Heller Brandon","year":"2012","unstructured":"Brandon Heller , Nikhil Handigol , Vimalkumar Jeyakumar , Bob Lantz , and Nick McKeown . Reproducible network experiments using container based emulation . In CoNEXT , 2012 . Brandon Heller, Nikhil Handigol, Vimalkumar Jeyakumar, Bob Lantz, and Nick McKeown. Reproducible network experiments using container based emulation. In CoNEXT, 2012."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"e_1_3_2_1_28_1","first-page":"565","volume-title":"INFOCOM'01","volume":"1","author":"Wang Yufei","year":"2001","unstructured":"Yufei Wang , Zheng Wang , and Leah Zhang . Internet traffic engineering without full mesh overlaying . In INFOCOM'01 , volume 1 , pages 565 -- 571 , 2001 . Yufei Wang, Zheng Wang, and Leah Zhang. Internet traffic engineering without full mesh overlaying. In INFOCOM'01, volume 1, pages 565--571, 2001."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.845549"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014852026591"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592803"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1982.1102884"},{"key":"e_1_3_2_1_34_1","volume-title":"http:\/\/noc.net.internet2.edu\/","author":"NOC.","year":"2016","unstructured":"Internet2 NOC. http:\/\/noc.net.internet2.edu\/ , 2016 . Internet2 NOC. http:\/\/noc.net.internet2.edu\/, 2016."},{"key":"e_1_3_2_1_35_1","volume-title":"http:\/\/ocean.cs.illinois.edu\/","author":"OCEAN.","year":"2016","unstructured":"OCEAN. http:\/\/ocean.cs.illinois.edu\/ , 2016 . OCEAN. http:\/\/ocean.cs.illinois.edu\/, 2016."}],"event":{"name":"CoNEXT '16: The 12th International Conference on emerging Networking EXperiments and Technologies","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Irvine California USA","acronym":"CoNEXT '16"},"container-title":["Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2999572.2999585","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2999572.2999585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:38:41Z","timestamp":1750221521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2999572.2999585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,6]]},"references-count":35,"alternative-id":["10.1145\/2999572.2999585","10.1145\/2999572"],"URL":"https:\/\/doi.org\/10.1145\/2999572.2999585","relation":{},"subject":[],"published":{"date-parts":[[2016,12,6]]},"assertion":[{"value":"2016-12-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}