{"doi":"10.1016/s0196-6774(03)00054-3","publication_identifier":{"issn":["0196-6774"]},"_id":"11764","issue":"2","title":"Scheduling data transfers in a network and the set scheduling problem","month":"09","article_type":"original","oa_version":"None","citation":{"ama":"Goel A, Henzinger MH, Plotkin S, Tardos E. Scheduling data transfers in a network and the set scheduling problem. <i>Journal of Algorithms</i>. 2003;48(2):314-332. doi:<a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">10.1016/s0196-6774(03)00054-3</a>","ista":"Goel A, Henzinger MH, Plotkin S, Tardos E. 2003. Scheduling data transfers in a network and the set scheduling problem. Journal of Algorithms. 48(2), 314–332.","chicago":"Goel, Ashish, Monika H Henzinger, Serge Plotkin, and Eva Tardos. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” <i>Journal of Algorithms</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">https://doi.org/10.1016/s0196-6774(03)00054-3</a>.","ieee":"A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” <i>Journal of Algorithms</i>, vol. 48, no. 2. Elsevier, pp. 314–332, 2003.","mla":"Goel, Ashish, et al. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” <i>Journal of Algorithms</i>, vol. 48, no. 2, Elsevier, 2003, pp. 314–32, doi:<a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">10.1016/s0196-6774(03)00054-3</a>.","short":"A. Goel, M.H. Henzinger, S. Plotkin, E. Tardos, Journal of Algorithms 48 (2003) 314–332.","apa":"Goel, A., Henzinger, M. H., Plotkin, S., &#38; Tardos, E. (2003). Scheduling data transfers in a network and the set scheduling problem. <i>Journal of Algorithms</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">https://doi.org/10.1016/s0196-6774(03)00054-3</a>"},"type":"journal_article","scopus_import":"1","publisher":"Elsevier","volume":48,"publication_status":"published","language":[{"iso":"eng"}],"author":[{"last_name":"Goel","first_name":"Ashish","full_name":"Goel, Ashish"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"full_name":"Plotkin, Serge","first_name":"Serge","last_name":"Plotkin"},{"last_name":"Tardos","full_name":"Tardos, Eva","first_name":"Eva"}],"extern":"1","page":"314-332","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-09-12T09:45:06Z","intvolume":"        48","publication":"Journal of Algorithms","status":"public","date_created":"2022-08-08T12:09:32Z","abstract":[{"lang":"eng","text":"In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum."}],"day":"01","year":"2003","date_published":"2003-09-01T00:00:00Z","quality_controlled":"1","article_processing_charge":"No"}