Skip to main content
eScholarship
Open Access Publications from the University of California

Fault-tolerant bandwidth reservation strategies for data transfers in high-performance networks

  • Author(s): Zuo, L
  • Zhu, MM
  • Wu, CQ
  • Zurawski, J
  • et al.

Published Web Location

http://www.sciencedirect.com/science/article/pii/S1389128616303693
No data is associated with this publication.
Abstract

© 2016 Elsevier B.V. Many next-generation e-science applications require fast and reliable transfer of large volumes of data with guaranteed performance, which is typically enabled by the bandwidth reservation service in high-performance networks. One prominent issue in such network environments with large footprints is that node and link failures are inevitable, hence potentially degrading the quality of data transfer. We consider two generic types of bandwidth reservation requests (BRRs) concerning data transfer reliability: (i) to achieve the highest data transfer reliability under a given data transfer deadline, and (ii) to achieve the earliest data transfer completion time while satisfying a given data transfer reliability requirement. We propose two periodic bandwidth reservation algorithms with rigorous optimality proofs to optimize the scheduling of individual BRRs within BRR batches. The efficacy of the proposed algorithms is illustrated through extensive simulations in comparison with scheduling algorithms widely adopted in production networks in terms of various performance metrics.

Item not freely available? Link broken?
Report a problem accessing this item