On design of scheduling algorithms for advance bandwidth reservation in dedicated networks

There are an increasing number of high- performance networks that provision dedicated channels through circuit-switching or MPLS/GMPLS techniques to support large- scale data transfer. The available bandwidths on these dedicated links vary over time and therefore efficient bandwidth scheduling algorithms are needed to improve the utilization of network resources and satisfy diverse user requirements. Based on different path and bandwidth constraints, we formulate four instant scheduling problems for a data transfer request: (i) variable path with variable bandwidth (VPVB), (ii) fixed path with variable bandwidth (FPVB), (iii) variable path with fixed bandwidth (VPFB), and (iv) fixed path with fixed bandwidth (FPFB), with the common objective to minimize transfer end time for a given data size. We design an optimal algorithm for each of these scheduling problems with polynomial- or pseudo- polynomial-time complexity with respect to the network size and total number of time slots in a bandwidth reservation table.

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

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

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

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

[5]  Chase Qishi Wu,et al.  A class of reliable UDP-based transport protocols based on stochastic approximation , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

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

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

[9]  Lixia Zhang,et al.  Stream Control Transmission Protocol , 2000, RFC.

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

[11]  Robert L. Grossman,et al.  SABUL: A High Performance Data Transfer Protocol , 2003 .

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

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

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