{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:17:12Z","timestamp":1729617432723,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1109\/infcom.2010.5461925","type":"proceedings-article","created":{"date-parts":[[2010,5,12]],"date-time":"2010-05-12T16:54:40Z","timestamp":1273683280000},"page":"1-9","source":"Crossref","is-referenced-by-count":6,"title":["Demand-Oblivious Routing: Distributed vs. Centralized Approaches"],"prefix":"10.1109","author":[{"given":"Gabor","family":"Retvari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabor","family":"Nemeth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2010.5546757"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOTA.0000004869.66331.5c"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.188"},{"journal-title":"Convex Polytopes","year":"1967","author":"gr\u00fcnbaum","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637237"},{"key":"ref36","article-title":"The national science foundation network","author":"chinoy","year":"0","journal-title":"Tech Rep"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.811259"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(01)00174-1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1982.1102884"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887322"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1064413.1064415"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286490"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.070602"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.828949"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1368436.1368438"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/777412.777444","article-title":"Throughput-centric routing algorithm design","author":"towles","year":"2003","journal-title":"SPAA'03"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948237"},{"key":"ref27","first-page":"200","article-title":"Minimizing average latency in oblivious routing","author":"harsha","year":"2008","journal-title":"SODA'08"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"ref29","article-title":"Lectures on Polytopes","volume":"152","author":"ziegler","year":"1998","journal-title":"Graduate Texts in Mathematics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1497927"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/90.477726"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45412-8_11","article-title":"Profile-based routing: a new framework for MPLS traffic engineering","volume":"2156","author":"suri","year":"2001","journal-title":"Quality of Future Internet Services"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.223806"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159926"},{"key":"ref1","article-title":"Overview and principles of Internet traffic engineering","author":"awduche","year":"2002","journal-title":"RFC 3272"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72990-7_15"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.559"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060619"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1012888.1005719"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/564871.564872"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/777412.777420","article-title":"Online oblivious routing","author":"bansal","year":"2003","journal-title":"SPAA'03"}],"event":{"name":"IEEE INFOCOM 2010 - IEEE Conference on Computer Communications","start":{"date-parts":[[2010,3,14]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2010,3,19]]}},"container-title":["2010 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5461675\/5461899\/05461925.pdf?arnumber=5461925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T04:07:54Z","timestamp":1497845274000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5461925\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/infcom.2010.5461925","relation":{},"subject":[],"published":{"date-parts":[[2010,3]]}}}