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

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.

[1]  Yunyue Lin,et al.  Path Computation with Variable Bandwidth for Bulk Data Transfer in High-Performance Networks , 2009, IEEE INFOCOM Workshops 2009.

[2]  Pascale Vicat-Blanc Primet,et al.  Scheduling deadline-constrained bulk data transfers to minimize network congestion , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[3]  Longjiang Li,et al.  Availability-aware routing in optical networks with primary-backup sharing , 2008, 2008 International Conference on High Performance Switching and Routing.

[4]  Ling Zhou,et al.  Connection Availability Analysis of Shared Backup Path-Protected Mesh Networks , 2007, Journal of Lightwave Technology.

[5]  Lena Wosinska,et al.  Analysis and optimization of connection availabilities of optical networks with different protection strategies , 2004, SPIE Photonics Europe.

[6]  Biswanath Mukherjee,et al.  Availability-Aware Provisioning Strategies for Differentiated Protection Services in Wavelength-Convertible WDM Mesh Networks , 2007, IEEE/ACM Transactions on Networking.

[7]  Thilo Kielmann,et al.  Optimizing Deadline-Driven Bulk Data Transfers in Overlay Networks , 2009, 2009 Proceedings of 18th International Conference on Computer Communications and Networks.

[8]  C. Siva Ram Murthy,et al.  Efficient algorithms for routing dependable connections in WDM optical networks , 2001, TNET.

[9]  N.S.V. Rao,et al.  On design of scheduling algorithms for advance bandwidth reservation in dedicated networks , 2008, IEEE INFOCOM Workshops 2008.

[10]  Biswanath Mukherjee,et al.  Service provisioning to provide per-connection-based availability guarantee in WDM mesh networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..