{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T11:04:10Z","timestamp":1778670250662,"version":"3.51.4"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2003.1208674","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"218-228","source":"Crossref","is-referenced-by-count":14,"title":["Large-scale data collection: a coordinated approach"],"prefix":"10.1109","volume":"1","author":[{"given":"W.C.","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.-Fu.","family":"Chou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Golubchik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Khuller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.-C.","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","year":"0","journal-title":"Georgia Tech Internetwork topology generator"},{"key":"17","first-page":"512","article-title":"Polynomial time algorithms for some evacuation problems","author":"hoppe","year":"1994","journal-title":"SODA ACM-SIAM Symposium on Discrete Algorithms"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1287\/moor.25.1.36.15211"},{"key":"33","article-title":"SPAND: Shared passive network performance discovery","author":"seshanm","year":"1997","journal-title":"Proc Usenix Symp Internet Technologies and Systems"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.0805"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/ICNS.2009.29"},{"key":"16","author":"goldberg","year":"2001","journal-title":"Andrew goldberg's network optimization library"},{"key":"13","author":"foster","year":"1998","journal-title":"The Grid Blueprint for a New Computing Infrastructure"},{"key":"14","author":"francis","year":"1999","journal-title":"Internet distance map service"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1145\/316194.316228","article-title":"Using pathchar to estimate Internet link characteristics","author":"downey","year":"1999","journal-title":"ACM SIGCOMM"},{"key":"12","author":"ford","year":"1962","journal-title":"Flows in Networks"},{"key":"21","year":"0","journal-title":"Fill-in forms"},{"key":"20","year":"0","journal-title":"The Network Simulator -ns-2"},{"key":"22","author":"jacobson","year":"1997","journal-title":"Pathchar"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815304"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548465"},{"key":"25","article-title":"Nettimer: A tool for measuring bottleneck link bandwidth","author":"lai","year":"2001","journal-title":"Proceedings of the USENIX Symposium on Internet Technologies and Systems"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2001.962534"},{"key":"27","author":"mah","year":"2001","journal-title":"Pchar"},{"key":"28","article-title":"SONAR - A network proximity service","author":"moore","year":"1996","journal-title":"IETF Internet-Draft"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.1012369"},{"key":"3","article-title":"Gathercast: An efficient mechanism for multi-point to point aggregation in ip networks","volume":"dcs tr 362","author":"badrinath","year":"1998","journal-title":"Technical Report"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502048"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743461"},{"key":"1","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/40.748796"},{"key":"7","article-title":"On a graph-theoretic approach to scheduling large-scale data transfers","volume":"cs tr 4322","author":"cheng","year":"2002","journal-title":"Technical Report"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(96)00036-3"},{"key":"32","author":"schneier","year":"1996","journal-title":"Applied Cryptography Second Edition"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/49.917704"},{"key":"31","doi-asserted-by":"crossref","DOI":"10.1145\/316188.316233","article-title":"The end-to-end effects of Internet path selection","author":"savage","year":"1999","journal-title":"ACM SIGCOMM '99 Conference on Applications Technologies Architectures and Protocols for Computer Communication"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/362883.362907"},{"key":"9","author":"dantzig","year":"1963","journal-title":"Linear Programming and Extensions"},{"key":"8","first-page":"259","article-title":"A performance study of a large-scale data collection problem","author":"chou","year":"2002","journal-title":"10th International Workshop on Web Content Caching and Distribution"}],"event":{"name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies","location":"San Francisco, CA, USA","acronym":"INFCOM-03"},"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\/01208674.pdf?arnumber=1208674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:04:46Z","timestamp":1497585886000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1208674\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/infcom.2003.1208674","relation":{},"subject":[]}}