{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:02:30Z","timestamp":1742389350716},"reference-count":15,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5123,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the problem of transferring a set of files from their given locations in a fully connected network to their respective target locations in minimum time. We show that this problem is NP\u2010hard even with the restriction that no file uses more than two edges in its route. We present an efficient algorithm to solve this problem in the case when there is only one source and one or more destinations. For the general case, we propose a two\u2010phase approach to find two\u2010edge schedules that are optimal or close\u2010to\u2010optimal. In Phase I, two\u2010edge routes are assigned to files; in Phase II, a schedule is determined for the use of the links in these routes. For Phase I, we present an exact solution that is based on integer programming formulation and also give theoretical bounds for approximate solution. We also propose a route assignment algorithm that attempts to assign routes of minimum congestion. For Phase II, we present an efficient algorithm that constructs a schedule from the solution obtained in the first phase.<\/jats:p>","DOI":"10.1002\/net.3230220606","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T13:17:23Z","timestamp":1178975843000},"page":"563-588","source":"Crossref","is-referenced-by-count":10,"title":["Scheduling file transfers in fully connected networks"],"prefix":"10.1002","volume":"22","author":[{"given":"Pedro I.","family":"Rivera\u2010Vega","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Varadarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shamkant B.","family":"Navathe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"23","article-title":"Transversal theory and graphs","volume":"11","author":"Brualdi R. A.","year":"1975","journal-title":"Stud. Graph Theory"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0216013"},{"key":"e_1_2_1_4_2","first-page":"392","article-title":"Data transfers in networks with transceivers","volume":"17","author":"Choi H.\u2010A.","year":"1987","journal-title":"J. Networks"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762116"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0214054"},{"key":"e_1_2_1_7_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_8_2","unstructured":"B.Hajek Link schedules flows and the multichromatic index of graphs.Proceedings of the 1984 Conference on Information Sciences and Systems.(March1984)498\u2013502."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"T.Leighton B.Maggs andS.Rao Universal packet routing algorithms Proceedings of the 29th IEEE Symposium on Foundation of Computer Science. (1988)256\u2013269.","DOI":"10.1109\/SFCS.1988.21942"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1960.0144"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90069-7"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/0218015"},{"key":"e_1_2_1_14_2","unstructured":"P. I.Rivera R.Varadarajan andS. B.Navathe Scheduling Data Redistribution in Distributed Databases. Technical Report Database Research and Development Center University of Florida Gainesville (1989)."},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1137\/0211027"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/0219015"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220606","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T03:56:19Z","timestamp":1698119779000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["10.1002\/net.3230220606"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220606","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}