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
Reliable Blast UDP: Predictable High Performance Bulk Data Transfer
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
On ordered scheduling for optical burst switching
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks
ICN '07 Proceedings of the Sixth International Conference on Networking
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Ultrascience net: network testbed for large-scale science applications
IEEE Communications Magazine
Control architecture in optical burst-switched WDM networks
IEEE Journal on Selected Areas in Communications
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
A Flexible Reservation Algorithm for Advance Network Provisioning
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data transfer. Efficient algorithms are needed for path computation and bandwidth scheduling in dedicated networks to improve the utilization of network resources and meet diverse user requests. We consider two periodic bandwidth scheduling problems: multiple data transfer allocation (MDTA) and multiple fixed-slot bandwidth reservation (MFBR), both of which schedule a number of user requests accumulated in a certain period. MDTA is to assign multiple data transfer requests on several pre-specified network paths to minimize the total data transfer end time, while MFBR is to satisfy multiple bandwidth reservation requests, each of which specifies a bandwidth and a time slot. For MDTA, we design an optimal algorithm and provide its correctness proof; for MFBR, we prove it to be NP-complete and propose a heuristic algorithm, Minimal Bandwidth and Distance Product Algorithm (MBDPA). Extensive simulation results illustrate the performance superiority of the proposed MBDPA over a greedy heuristic approach and provide valuable insight into the advantage of periodic bandwidth scheduling over instant bandwidth scheduling.