skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: End-to-End Network QoS via Scheduling of Flexible Resource Reservation Requests

Abstract

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.

Authors:
; ;
Publication Date:
Research Org.:
Brookhaven National Lab. (BNL), Upton, NY (United States)
Sponsoring Org.:
DOE - OFFICE OF SCIENCE
OSTI Identifier:
1017404
Report Number(s):
BNL-95022-2011-CP
KJ0101040; TRN: US201113%%493
DOE Contract Number:  
DE-AC02-98CH10886
Resource Type:
Conference
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
Subject:
97 MATHEMATICAL METHODS AND COMPUTING; ALGORITHMS; AVAILABILITY; PERFORMANCE; RADIORECEPTOR ASSAY; SCHEDULES; STORAGE; scheduling; resource reservation; end-to-end QoS

Citation Formats

Sharma, S, Katramatos, D, and Yu, D. End-to-End Network QoS via Scheduling of Flexible Resource Reservation Requests. United States: N. p., 2011. Web.
Sharma, S, Katramatos, D, & Yu, D. End-to-End Network QoS via Scheduling of Flexible Resource Reservation Requests. United States.
Sharma, S, Katramatos, D, and Yu, D. Mon . "End-to-End Network QoS via Scheduling of Flexible Resource Reservation Requests". United States. https://www.osti.gov/servlets/purl/1017404.
@article{osti_1017404,
title = {End-to-End Network QoS via Scheduling of Flexible Resource Reservation Requests},
author = {Sharma, S and Katramatos, D and Yu, D},
abstractNote = {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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2011},
month = {11}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: