Complexity Analysis and Algorithm Design for Advance Bandwidth Scheduling in Dedicated Networks

An increasing number of high-performance networks provision dedicated channels through circuit switching or MPLS/GMPLS techniques to support large data transfer. The link bandwidths in such networks are typically shared by multiple users through advance reservation, resulting in varying bandwidth availability in future time. Developing efficient scheduling algorithms for advance bandwidth reservation has become a critical task to improve the utilization of network resources and meet the transport requirements of application users. We consider an exhaustive combination of different path and bandwidth constraints and formulate four types of advance bandwidth scheduling problems, with the same objective to minimize the data transfer end time for a given transfer request with a prespecified data size: fixed path with fixed bandwidth (FPFB); fixed path with variable bandwidth (FPVB); variable path with fixed bandwidth (VPFB); and variable path with variable bandwidth (VPVB). For VPFB and VPVB, we further consider two subcases where the path switching delay is negligible or nonnegligible. We propose an optimal algorithm for each of these scheduling problems except for FPVB and VPVB with nonnegligible path switching delay, which are proven to be NP-complete and nonapproximable, and then tackled by heuristics. The performance superiority of these heuristics is verified by extensive experimental results in a large set of simulated networks in comparison to optimal and greedy strategies.

[1]  Anant P. Mudambi,et al.  FRTP : Fixed Rate Transport Protocol-- A modified version of SABUL for end-to-end circuits , .

[2]  Robert L. Grossman,et al.  SABUL: A Transport Protocol for Grid Computing , 2003, Journal of Grid Computing.

[3]  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.

[4]  Chip Elliott,et al.  GENI - global environment for network innovations , 2008, LCN.

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

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

[7]  Chase Qishi Wu,et al.  Stabilizing transport dynamics of control channels over wide-area networks , 2010, Comput. Networks.

[8]  Zhi-Li Zhang,et al.  Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services , 2000, SIGCOMM.

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

[10]  Yufeng Xin,et al.  EnLIGHTened Computing: An architecture for co-allocating network, compute, and other grid resources for high-end applications , 2007, 2007 International Symposium on High Capacity Optical Networks and Enabling Technologies.

[11]  Byrav Ramamurthy,et al.  A Two-phase Approach for Dynamic Lightpath Scheduling in WDM Optical Networks , 2007, 2007 IEEE International Conference on Communications.

[12]  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.

[13]  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).

[14]  Chase Qishi Wu,et al.  A Dynamic Performance-Based Flow Control Method for High-Speed Data Transfer , 2010, IEEE Transactions on Parallel and Distributed Systems.

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

[16]  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).

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

[18]  Biswanath Mukherjee,et al.  RAPID: an end-system aware protocol for intelligent data transfer over lambda grids , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[19]  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.

[20]  Tomohiro Otani,et al.  GMPLS/OXC network testbed of JGN II , 2006, 2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, 2006. TRIDENTCOM 2006..

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