{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:40:01Z","timestamp":1743136801372,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303753"},{"type":"electronic","value":"9783642303760"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30376-0_7","type":"book-chapter","created":{"date-parts":[[2012,4,30]],"date-time":"2012-04-30T10:14:39Z","timestamp":1335780879000},"page":"84-100","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"N\u00e9meth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"R\u00e9tv\u00e1ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., Xiao, X.: Overview and principles of Internet traffic engineering. RFC 3272 (May 2002)","DOI":"10.17487\/rfc3272"},{"issue":"10","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1109\/T-C.1974.223806","volume":"23","author":"D.G. Cantor","year":"1974","unstructured":"Cantor, D.G., Gerla, M.: Optimal routing in a packet-switched computer network. IEEE Transactions on Computer\u00a023(10), 1062\u20131069 (1974)","journal-title":"IEEE Transactions on Computer"},{"issue":"10","key":"7_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/MCOM.2002.1039866","volume":"40","author":"B. Fortz","year":"2002","unstructured":"Fortz, B., Rexford, J., Thorup, M.: Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine\u00a040(10), 118\u2013124 (2002)","journal-title":"IEEE Communications Magazine"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Roughan, M., Thorup, M., Zhang, Y.: Traffic engineering with estimated traffic matrices. In: IMC 2003: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 248\u2013258 (2003)","DOI":"10.1145\/948205.948237"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, C., Liu, Y., Gong, W., Moll, J., Towsley, R.D.: On optimal routing with multiple traffic matrices. In: INFOCOM 2005, vol.\u00a01, pp. 607\u2013618 (2005)","DOI":"10.1109\/INFCOM.2005.1497927"},{"issue":"6","key":"7_CR6","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1109\/90.477726","volume":"3","author":"D. Medhi","year":"1995","unstructured":"Medhi, D.: Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks. IEEE\/ACM Transactions on Networking\u00a03(6), 809\u2013818 (1995)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1145\/1151659.1159926","volume":"36","author":"H. Wang","year":"2006","unstructured":"Wang, H., Xie, H., Qiu, L., Yang, Y.R., Zhang, Y., Greenberg, A.: COPE: traffic engineering in dynamic networks. SIGCOMM Comput. Commun. Rev.\u00a036(4), 99\u2013110 (2006)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/TAC.1982.1102884","volume":"27","author":"D.P. Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Dynamic behavior of shortest path routing algorithms for communication networks. IEEE Trans. on Automatic Control\u00a027, 60\u201374 (1982)","journal-title":"IEEE Trans. on Automatic Control"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/JPROC.2006.887322","volume":"95","author":"M. Chiang","year":"2007","unstructured":"Chiang, M., Low, S.H., Calderbank, A.R., Doyle, J.C.: Layering as optimization decomposition: A mathematical theory of network architectures. Proceedings of the IEEE\u00a095(1), 255\u2013312 (2007)","journal-title":"Proceedings of the IEEE"},{"issue":"5","key":"7_CR10","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/JSAC.2007.070602","volume":"25","author":"J. He","year":"2007","unstructured":"He, J., Bresler, M., Chiang, M., Rexford, J.: Towards robust multi-layer traffic engineering: Optimization of congestion control and routing. IEEE Journal on Selected Areas in Communications\u00a025(5), 868\u2013880 (2007)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TNET.2004.828949","volume":"12","author":"C.M. Lagoa","year":"2004","unstructured":"Lagoa, C.M., Che, H., Movsichoff, B.A.: Adaptive control algorithms for decentralized optimal traffic engineering in the internet. IEEE\/ACM Trans. Netw.\u00a012(3), 415\u2013428 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Kandula, S., Katabi, D., Davie, B., Charny, A.: Walking the Tightrope: Responsive Yet Stable Traffic Engineering. In: ACM SIGCOMM 2005 (August 2005)","DOI":"10.1145\/1080091.1080122"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Fischer, S., Kammenhuber, N., Feldmann, A.: REPLEX: dynamic traffic engineering based on wardrop routing policies. In: Proceedings of CoNEXT 2006, pp. 1\u201312 (2006)","DOI":"10.1145\/1368436.1368438"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Applegate, D., Cohen, E.: Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: Proceedings of SIGCOMM 2003, pp. 313\u2013324 (2003)","DOI":"10.1145\/863989.863991"},{"key":"7_CR15","unstructured":"R\u00e4cke, H.: Minimizing congestion in general networks. In: FOCS 2002, pp. 43\u201352 (2002)"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.jcss.2004.04.010","volume":"69","author":"Y. Azar","year":"2004","unstructured":"Azar, Y., Cohen, E., Fiat, A., Kaplan, H., R\u00e4cke, H.: Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci.\u00a069(3), 383\u2013394 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Wellons, J., Xue, Y.: Oblivious routing for wireless mesh networks. In: ICC 2008, pp. 2969\u20132973 (May 2008)","DOI":"10.1109\/ICC.2008.559"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-72990-7_15","volume-title":"Managing Traffic Performance in Converged Networks","author":"Y. Li","year":"2007","unstructured":"Li, Y., Bai, B., Harms, J.J., Holte, R.C.: Stable and Robust Multipath Oblivious Routing for Traffic Engineering. In: Mason, L.G., Drwiega, T., Yan, J. (eds.) ITC 2007. LNCS, vol.\u00a04516, pp. 129\u2013140. Springer, Heidelberg (2007)"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/1012888.1005719","volume":"32","author":"D. Applegate","year":"2004","unstructured":"Applegate, D., Breslau, L., Cohen, E.: Coping with network failures: routing strategies for optimal demand oblivious restoration. SIGMETRICS Perform. Eval. Rev.\u00a032(1), 270\u2013281 (2004)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M., Kim, J., Leighton, T., R\u00e4cke, H.: Oblivious routing in directed graphs with random demands. In: STOC 2005, pp. 193\u2013201 (2005)","DOI":"10.1145\/1060590.1060619"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Online oblivious routing. In: SPAA 2003, pp. 44\u201349 (2003)","DOI":"10.1145\/777412.777420"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Towles, B., Dally, W.: Worst-case traffic for oblivious routing functions. In: SPAA 2002, pp. 1\u20138 (2002)","DOI":"10.1109\/L-CA.2002.12"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"R\u00e9tv\u00e1ri, G., N\u00e9meth, G.: Demand-oblivious routing: distributed vs. centralized approaches. In: INFOCOM 2010 (March 2010)","DOI":"10.1109\/INFCOM.2010.5461925"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"R\u00e9tv\u00e1ri, G., B\u00edr\u00f3, J.J., Cinkler, T.: Fairness in capacitated networks: A polyhedral approach. In: INFOCOM 2007, vol.\u00a01, pp. 1604\u20131612 (May 2007)","DOI":"10.1109\/ICC.2007.1050"},{"key":"7_CR25","series-title":"Graduate Texts in Mathematics","volume-title":"Lectures on Polytopes","author":"G.M. Ziegler","year":"1998","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol.\u00a0152. Springer, Heidelberg (1998)"},{"key":"7_CR26","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. John Wiley & Sons (1967)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Mahajan, R., Spring, N., Wetherall, D., Anderson, T.: Inferring link weights using end-to-end measurements. In: IMW 2002: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurment, pp. 231\u2013236 (2002)","DOI":"10.1145\/637235.637237"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"R\u00e9tv\u00e1ri, G., N\u00e9meth, G.: On optimal rate-adaptive routing. In: ISCC 2010, pp. 605\u2013610 (2010)","DOI":"10.1109\/ISCC.2010.5546757"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Broadband Communications, Networks, and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30376-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:32:06Z","timestamp":1743028326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30376-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303753","9783642303760"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30376-0_7","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2012]]}}}