{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T00:53:41Z","timestamp":1748566421589},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2003.1208692","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"406-416","source":"Crossref","is-referenced-by-count":18,"title":["An approach to alleviate link overload as observed on an IP backbone"],"prefix":"10.1109","volume":"1","author":[{"family":"Sundar Iyer","sequence":"first","affiliation":[]},{"family":"Supratik Bhattacharyya","sequence":"additional","affiliation":[]},{"given":"N.","family":"Taft","sequence":"additional","affiliation":[]},{"given":"C.","family":"Diot","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"ISP backbone traffic inference methods to support traffic engineering","author":"goldschmidt","year":"2000","journal-title":"Internet Statistic and Metrics Analysis Workshops"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019298"},{"key":"18","doi-asserted-by":"crossref","DOI":"10.1080\/01621459.2000.10474303","article-title":"Time-varying network tomography","author":"cao","year":"2000","journal-title":"J of the American Statistical Association"},{"journal-title":"MaRS - Maryland Routing Simulator Version 1 0","year":"1991","author":"alaettinoglu","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/507670.507680"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/205511.205520"},{"journal-title":"IS-IS Link Weight Assignments for Transient Link Failures","year":"0","author":"nucci","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633041"},{"key":"3","article-title":"An algorithm for multipath computation using distance-vectors with predecessor information","author":"vutukury","year":"1999","journal-title":"Proc of ICCCN"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.2307\/2670105"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916780"},{"journal-title":"Linear Network Optimization Algorithms and Codes","year":"1991","author":"bertsekas","key":"1"},{"key":"10","first-page":"857","article-title":"Load-balanced routing via bounded randomization","author":"bak","year":"1999","journal-title":"Proc IASTED Int Conf Parallel and Distributed Computing and Systems"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/99508.99548"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1991.0129"},{"journal-title":"Multipath issues in unicast and multicast next-hop selection","year":"0","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662958"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/0211027"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/637235.637238"}],"event":{"name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies","acronym":"INFCOM-03","location":"San Francisco, CA, USA"},"container-title":["IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8585\/27205\/01208692.pdf?arnumber=1208692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:04:46Z","timestamp":1497571486000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1208692\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/infcom.2003.1208692","relation":{},"subject":[]}}