Budget-constrained bulk data transfer via internet and shipping networks
Budget-constrained bulk data transfer via internet and shipping networks
复制标题
通过互联网和运输网络进行预算有限的批量数据传输
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Indranil Gupta
中科院分区：
文献类型：
--
作者：
Brian Cho;Indranil Gupta
云协作者希望将来自多个分布式位置的以TB为单位的大量数据联合收割机组合到单个数据中心。这些团体面临的挑战是减少转移的延迟，而不产生过多的美元成本。我们的Pandora系统是一个自主系统，它通过考虑通过互联网和磁盘运输来传输数据，创建可以满足延迟和成本需求的数据传输计划。解决规划问题是实现真正自主的批量数据传输服务的关键一步。在本文中，我们开发的技术来创建一个最佳的传输计划，最大限度地减少传输延迟的预算约束。为了系统地探索解决方案空间，我们开发了有效的二进制搜索方法，找到最佳的货运转移计划。我们的实验评估，驱动互联网带宽的痕迹和实际的货运成本从联邦快递的Web服务查询，表明这些技术工作以及不同的，现实的网络。
Cloud collaborators wish to combine large amounts of data, in the order of TBs, from multiple distributed locations to a single datacenter. Such groups are faced with the challenge of reducing the latency of the transfer, without incurring excessive dollar costs. Our Pandora system is an autonomic system that creates data transfer plans that can satisfy latency and cost needs, by considering transferring the data through both Internet and disk shipments. Solving the planning problem is a critical step towards a truly autonomic bulk data transfer service. In this paper, we develop techniques to create an optimal transfer plan that minimizes transfer latency subject to a budget constraint. To systematically explore the solution space, we develop efficient binary search methods that find the optimal shipment transfer plan. Our experimental evaluation, driven by Internet bandwidth traces and actual shipment costs queried from FedEx web services, shows that these techniques work well on diverse, realistic networks.