Academic
Publications
Routing for Deadline-Constrained Bulk Data Transfers Based on Transfer Failure Probability

Routing for Deadline-Constrained Bulk Data Transfers Based on Transfer Failure Probability,10.1109/icc.2011.5963444,Yaoquan Zhong,Wei Guo,Yaohui Jin,W

Routing for Deadline-Constrained Bulk Data Transfers Based on Transfer Failure Probability  
BibTex | RIS | RefWorks Download
Bulk data transfers, which require reliable and efficient transfer of terabits or even petabits of data for data-intensive applications, have been extensively studied. In these applications, usually, a specified amount of data needs to be transferred within strict deadline. Previous researches mainly focus on routing deadline-constrained bulk data transfers to improve the utilization of network resources for guarantying deadline requirements, without considering network failures. This paper proposes novel routing algorithm for deadline-constrained bulk data transfers based on Transfer Failure Probability using continuous-time Markov model. The goal of the novel algorithm is to guarantee the deadline requirement by decreasing the failure probability of data transfer request under network failure settings. Simulation evaluates the performance and demonstrates the effectiveness of our algorithm in terms of deadline violation ratio and service blocking ratio under network failures.
Published in 2011.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.