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

详细信息    查看全文

• 作者：Liudong Zuo ; ^a ; ^{lzuo@csudh.edu}Author Vitae ; Michelle M. Zhu^b ; ^{zhumi@montclair.edu}Author Vitae ; Chase Q. Wu^c ; ^{chase.q.wu@njit.edu}Author Vitae ; Jason Zurawski^d ; ^{zurawski@es.net}Author Vitae
• 关键词：Bandwidth reservation ; Bandwidth scheduling ; Dynamic provisioning ; High-performance networks ; Fault tolerance
• 刊名：Computer Networks
• 出版年：2017
• 出版时间：11 February 2017
• 年：2017
• 卷：113
• 期：Complete
• 页码：1-16
• 全文大小：1869 K
• 卷排序：113

文摘

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.