Advance Reservations and Scheduling for Bulk Transfers in Research Networks

Advance Reservations and Scheduling for Bulk Transfers in Research Networks
复制标题

DOI:
10.1109/tpds.2008.250
复制
发表时间:
2009-11
影响因子:
5.3
通讯作者:
K. Rajah;S. Ranka;Ye Xia-
K. Rajah;S. Ranka;Ye Xia-
中科院分区:
计算机科学2区
文献类型:
--
作者:
K. Rajah;S. Ranka;Ye Xia-

文献摘要

被引文献

相似文献

数据密集型电子科学协作通常需要以可预测的性能传输大型文件。为了满足这一需求,我们设计了新颖的准入控制(AC)和调度算法,用于电子科学研究网络中的批量数据传输。由于规模较小,研究网络可以负担得起集中的资源管理平台。在我们的设计中,可以提前向中央网络控制器发出的每个批量传输作业请求指定开始时间和结束时间。如果接受,网络保证在结束时间之前完成传输。然而,实际传输的执行方式(即每个时间间隔上作业的每个允许路径上的带宽分配)具有灵活性,并且由调度算法决定。为了提高网络资源利用率或降低作业拒绝率,网络控制器解决AC和调度决策中的优化问题。我们的设计将以下元素组合到一个基于优化的内聚框架中:提前预留、多路径路由以及通过定期重新优化进行带宽重新分配。我们从网络效率和个体传输的性能水平两方面评估我们的算法。我们还通过研究算法执行时间来评估我们方案的可行性。
Data-intensive e-science collaborations often require the transfer of large files with predictable performance. To meet this need, we design novel admission control (AC) and scheduling algorithms for bulk data transfer in research networks for e-science. Due to their small sizes, the research networks can afford a centralized resource management platform. In our design, each bulk transfer job request, which can be made in advance to the central network controller, specifies a start time and an end time. If admitted, the network guarantees to complete the transfer before the end time. However, there is flexibility in how the actual transfer is carried out, that is, in the bandwidth assignment on each allowed path of the job on each time interval, and it is up to the scheduling algorithm to decide this. To improve the network resource utilization or lower the job rejection ratio, the network controller solves optimization problems in making AC and scheduling decisions. Our design combines the following elements into a cohesive optimization-based framework: advance reservations, multipath routing, and bandwidth reassignment via periodic reoptimization. We evaluate our algorithm in terms of both network efficiency and the performance level of individual transfer. We also evaluate the feasibility of our scheme by studying the algorithm execution time.