Path Computation with Variable Bandwidth for Bulk Data Transfer in High-Performance Networks

There are an increasing number of high-performance networks that provision dedicated channels through circuit-switching or MPLS/GMPLS techniques to support bulk data transfer in large-scale science or e-commerce applications. These dedicated links are typically shared by multiple users through advance reservations, resulting in varying bandwidth availability in future time periods. Therefore, efficient advance bandwidth reservation algorithms are needed to improve the utilization of network resources and meet the transport requirements of application users. We investigate the bandwidth-oriented path computation problem for two types of data transfer: (i) fixed path with variable bandwidth and (ii) variable path with variable bandwidth to minimize the transfer end time of a given data size. We prove that both problems are NP-complete and propose a heuristic algorithm for each of them. Extensive simulation results illustrate the performance superiority of the proposed heuristics over methods based on greedy strategies.

[1]  Chase Qishi Wu,et al.  Ultrascience net: network testbed for large-scale science applications , 2005, IEEE Communications Magazine.

[2]  Ariel Orda,et al.  Networks with advance reservations: the routing perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Reuven Cohen,et al.  Graded Channel Reservation with Path Switching in Ultra High Capacity Networks , 2006, 2006 3rd International Conference on Broadband Communications, Networks and Systems.

[4]  Wu-chun Feng,et al.  CHEETAH: circuit-switched high-speed end-to-end transport architecture , 2003, OptiComm: Optical Networking and Communications Conference.

[5]  Arunabha Sen,et al.  Optimal routing for fast transfer of bulk data files in time-varying networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[6]  Hua Li,et al.  A varying-bandwidth list scheduling heuristic for file transfers , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[7]  Nageswara S. V. Rao,et al.  Dedicated Channels as an Optimal Network Support for Effective Transfer of Massive Data , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  William C. Grimmell,et al.  On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints , 2003, Int. J. Found. Comput. Sci..

[9]  Sartaj Sahni,et al.  Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks , 2007, Sixth International Conference on Networking (ICN'07).

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Chase Qishi Wu,et al.  Control Plane for Advance Bandwidth Scheduling in Ultra High-Speed Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[13]  Christopher J. Rutland,et al.  Terascale High-Fidelity Simulations of Turbulent Combustion with Detailed Chemistry , 2004 .