Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks
ICN '07 Proceedings of the Sixth International Conference on Networking
A Dynamic Performance-Based Flow Control Method for High-Speed Data Transfer
IEEE Transactions on Parallel and Distributed Systems
Stabilizing transport dynamics of control channels over wide-area networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
RAPID: an end-system aware protocol for intelligent data transfer over lambda grids
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Ultrascience net: network testbed for large-scale science applications
IEEE Communications Magazine
| Hi-index | 0.00 |
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: 1) fixed path with fixed bandwidth (FPFB); 2) fixed path with variable bandwidth (FPVB); 3) variable path with fixed bandwidth (VPFB); and 4) 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.