End-to-End Network QoS via Scheduling of Flexible Resource Reservation Requests
Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfer, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (called SMR3) to accommodate multiple and concurrent network reservation requests between a pair of end-sites. Given the varying availability of bandwidth within the network, our goal is to accommodate as many reservation requests as possible while minimizing the total time needed to complete the data transfers. We first prove that SMR3 is an NP-hard problem. Then we solve it by developing a polynomial-time heuristic, called RRA. The RRA algorithm hinges on an efficient mechanism to accommodate large number of requests by minimizing the bandwidth wastage. Finally, via numerical results, we show that RRA constructs schedules that accommodate significantly larger number of requests compared to other, seemingly efficient, heuristics.
- Research Organization:
- Brookhaven National Lab. (BNL), Upton, NY (United States)
- Sponsoring Organization:
- DOE - OFFICE OF SCIENCE
- DOE Contract Number:
- DE-AC02-98CH10886
- OSTI ID:
- 1017404
- Report Number(s):
- BNL-95022-2011-CP; KJ0101040; TRN: US201113%%493
- Resource Relation:
- Conference: International Conference for High Performance Computing, Networking, Storage and Analysis; Seattle, WA; 20111114 through 20111117
- Country of Publication:
- United States
- Language:
- English
Similar Records
Bandwidth preemption for high-priority data transfer on dedicated channels
Flexible Bandwidth Scheduling for Streaming Data Movement Over Dedicated Networks