{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T19:21:37Z","timestamp":1784661697043,"version":"3.55.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Israeli Center for Research Excellence in Algorithms (I-CORE)"},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["420\/12"],"award-info":[{"award-number":["420\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1109\/tnet.2016.2614247","type":"journal-article","created":{"date-parts":[[2016,10,11]],"date-time":"2016-10-11T18:49:45Z","timestamp":1476211785000},"page":"779-792","source":"Crossref","is-referenced-by-count":110,"title":["Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9675-9729","authenticated-orcid":false,"given":"Marco","family":"Chiesa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy","family":"Kindler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45753-4_7"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535375"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654101"},{"key":"ref30","author":"dally","year":"2003","journal-title":"Principles and Practices of Interconnection Networks"},{"key":"ref35","first-page":"225","article-title":"Jellyfish: Networking data centers randomly","author":"singla","year":"2012","journal-title":"Proc NSDI"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2014.59"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000039487.35027.02"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-004-0473-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658943"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018466"},{"key":"ref16","author":"chiesa","year":"2016","journal-title":"Traffic Engineering with ECMP An Algorithmic Perspective"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.845549"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"ref28","first-page":"187","article-title":"A memetic algorithm for OSPF routing","author":"buriol","year":"2002","journal-title":"Proceedings of the 6th INFORMS Telecom"},{"key":"ref4","first-page":"332","article-title":"Performance of hashing-based schemes for internet load balancing","volume":"1","author":"cao","year":"2000","journal-title":"Proc IEEE InfoCom"},{"key":"ref27","article-title":"An integer programming approach to the OSPF weight setting problem","author":"parmar","year":"2006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1897852.1897877"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014852026591"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"ref7","year":"2011","journal-title":"OSPF Design Guide"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2992"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"ref1","first-page":"19","article-title":"Hedera: Dynamic flow scheduling for data center networks","author":"al-fares","year":"2010","journal-title":"Proc NSDI"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0210055"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254922"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/net.21461"},{"key":"ref23","year":"2016","journal-title":"Source Code for Comparison Among ECMP Equilibrium and Hedera-SA"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2003.5342227"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30165-5_24"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/7900486\/07588075.pdf?arnumber=7588075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:08:35Z","timestamp":1642003715000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7588075\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2016.2614247","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}