Please use this identifier to cite or link to this item:
|Title:||Supporting bulk data transfers of high-end applications with guaranteed completion time||Authors:||Chen, B.B.
|Issue Date:||2007||Citation:||Chen, B.B., Primet, P.V.-B. (2007). Supporting bulk data transfers of high-end applications with guaranteed completion time. IEEE International Conference on Communications : 575-580. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2007.100||Abstract:||In high-end grid networks, distributed resources (scientific instruments, CPUs, storages, etc.) are interconnected to support computing-intensive and data-intensive applications, which often require reliable and efficient transfer of gigabits or even terabits of data among endpoints. To facilitate the efficient scheduling of endpoint resources, networks should provide a service which guarantees that a specified amount of data is transferred within a strict time window. Existing "FixRate-FixTime" resource reservation architectures such as IntServ/RSVP reserve for each flow a constant amount of resource from a specified starting time. Instead, a bulk data transfer can start at any time after its arrival, use any and even time variant bandwidth value, as long as it is completed before its deadline. This paper proposes a flexible "Multi-Interval" resource reservation approach, which divides the active window of a transfer into multiple sub-intervals, and reserves constant amount of resource in each of them. We identify a possible evolution path towards the proposed architecture, and use simulations to demonstrate the potential performance gain from increasing flexibility. © 2007 IEEE.||Source Title:||IEEE International Conference on Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/130486||ISBN:||1424403537||ISSN:||05361486||DOI:||10.1109/ICC.2007.100|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 23, 2019
checked on Jun 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.