{"_id":"17657","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2168-7161"]},"extern":"1","year":"2015","status":"public","author":[{"first_name":"R.","last_name":"Cohen","full_name":"Cohen, R."},{"first_name":"Gleb","id":"83983","last_name":"Polevoy","full_name":"Polevoy, Gleb"}],"date_updated":"2022-01-06T06:53:16Z","publication":"Cloud Computing, IEEE Transactions on","issue":"99","title":"Inter-Datacenter Scheduling of Large Data Flows","date_created":"2020-08-06T15:20:58Z","page":"1-1","type":"journal_article","citation":{"bibtex":"@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large Data Flows}, volume={PP}, DOI={<a href=\"https://doi.org/10.1109/TCC.2015.2487964\">10.1109/TCC.2015.2487964</a>}, number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R. and Polevoy, Gleb}, year={2015}, pages={1–1} }","ama":"Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. <i>Cloud Computing, IEEE Transactions on</i>. 2015;PP(99):1-1. doi:<a href=\"https://doi.org/10.1109/TCC.2015.2487964\">10.1109/TCC.2015.2487964</a>","chicago":"Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” <i>Cloud Computing, IEEE Transactions On</i> PP, no. 99 (2015): 1–1. <a href=\"https://doi.org/10.1109/TCC.2015.2487964\">https://doi.org/10.1109/TCC.2015.2487964</a>.","short":"R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1.","apa":"Cohen, R., &#38; Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data Flows. <i>Cloud Computing, IEEE Transactions On</i>, <i>PP</i>(99), 1–1. <a href=\"https://doi.org/10.1109/TCC.2015.2487964\">https://doi.org/10.1109/TCC.2015.2487964</a>","ieee":"R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,” <i>Cloud Computing, IEEE Transactions on</i>, vol. PP, no. 99, pp. 1–1, 2015.","mla":"Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” <i>Cloud Computing, IEEE Transactions On</i>, vol. PP, no. 99, 2015, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/TCC.2015.2487964\">10.1109/TCC.2015.2487964</a>."},"user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"keyword":["Approximation algorithms","Approximation methods","Bandwidth","Cloud computing","Routing","Schedules","Scheduling"],"volume":"PP","abstract":[{"lang":"eng","text":"Inter-datacenter transfers of non-interactive but timely large flows over a private (managed) network is an important problem faced by many cloud service providers. The considered flows are non-interactive because they do not explicitly target the end users. However, most of them must be performed on a timely basis and are associated with a deadline. We propose to schedule these flows by a centralized controller, which determines when to transmit each flow and which path to use. Two scheduling models are presented in this paper. In the first, the controller also determines the rate of each flow, while in the second bandwidth is assigned by the network according to the TCP rules. We develop scheduling algorithms for both models and compare their complexity and performance."}],"doi":"10.1109/TCC.2015.2487964"}