{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:51:54Z","timestamp":1725738714070},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1109\/icccn.2009.5235267","type":"proceedings-article","created":{"date-parts":[[2009,9,11]],"date-time":"2009-09-11T19:26:15Z","timestamp":1252697175000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing Deadline-Driven Bulk Data Transfers in Overlay Networks"],"prefix":"10.1109","author":[{"given":"Andrei","family":"Agapi","sequence":"first","affiliation":[]},{"given":"Sebastien","family":"Soudan","sequence":"additional","affiliation":[]},{"given":"Marcelo","family":"Pasin","sequence":"additional","affiliation":[]},{"given":"Pascale","family":"Vicat-Blanc Primet","sequence":"additional","affiliation":[]},{"given":"Thilo","family":"Kielmann","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","article-title":"explicit routing algorithms for internet traffic engineering","author":"wang","year":"1999","journal-title":"ICCCN"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1145\/1162638.1162650"},{"key":"11","article-title":"overqos: an overlay based architecture for enhancing internet qos","author":"subramanian","year":"2004","journal-title":"NSDI"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1145\/828.1892"},{"year":"1959","author":"erdos","journal-title":"On Random Graphs I","key":"3"},{"key":"2","article-title":"scheduling bulk data transfers in grid networks","author":"chen","year":"2007","journal-title":"CCGrid"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1145\/502034.502048"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"7","article-title":"optimizing end-to-end throughput for data transfers on an overlay-tcp path","author":"karbhari","year":"2005","journal-title":"IFIP Networking Conference"},{"key":"6","doi-asserted-by":"crossref","DOI":"10.1145\/777412.777419","article-title":"a polynomial-time tree decomposition to minimize congestion","author":"harrelson","year":"2003","journal-title":"Proc ACM Symp Parallel Algorithms Architect"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1016\/j.tcs.2007.02.046"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/INFCOM.2000.832180"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1145\/322326.322337"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/INFOCOM.2008.235"}],"event":{"name":"2009 Proceedings of 18th International Conference on Computer Communications and Networks - ICCCN 2009","start":{"date-parts":[[2009,8,3]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2009,8,6]]}},"container-title":["2009 Proceedings of 18th International Conference on Computer Communications and Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5235208\/5235209\/05235267.pdf?arnumber=5235267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T12:47:57Z","timestamp":1710593277000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5235267\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icccn.2009.5235267","relation":{},"subject":[],"published":{"date-parts":[[2009,8]]}}}