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

Title: Scheduling End-to-End Flexible Resource Reservation Requests for Multiple End Sites

; ; ;
Publication Date:
Research Org.:
Brookhaven National Laboratory (BNL)
Sponsoring Org.:
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Resource Relation:
Conference: IEEE International Conference on Computing, Networking and Communications (ICNC 2015); Anaheim, CA; 20150216 through 20150219
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; multiple end users; flexible resource.

Citation Formats

Shi L., Sharma, S., Katramatos, D., and Yu, D.. Scheduling End-to-End Flexible Resource Reservation Requests for Multiple End Sites. United States: N. p., 2015. Web.
Shi L., Sharma, S., Katramatos, D., & Yu, D.. Scheduling End-to-End Flexible Resource Reservation Requests for Multiple End Sites. United States.
Shi L., Sharma, S., Katramatos, D., and Yu, D.. 2015. "Scheduling End-to-End Flexible Resource Reservation Requests for Multiple End Sites". United States. doi:.
title = {Scheduling End-to-End Flexible Resource Reservation Requests for Multiple End Sites},
author = {Shi L. and Sharma, S. and Katramatos, D. and Yu, D.},
abstractNote = {},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2015,
month = 2

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:
  • 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 solvemore » 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.« less
  • Areas on the Oak Ridge Reservation (ORR) that contain rare plant or animal species or are special habitats are protected through National Environmental Research Park Natural Area (NA) or Reference Area (RA) designations. The US Department of Energy`s Oak Ridge National Environmental Research Park program is responsible for identifying species of vascular plants that are endangered, threatened, or rare and, as much as possible, for conserving those areas in which such species grow. This report includes a listing of Research Park NAs and RAs with general habitat descriptions and a computer-generated map with the areas identified. These are the locationsmore » of rare plant or animal species or special habitats that are known at this time. As the Reservation continues to be surveyed, it is expected that additional sites will be designated as Research Park NAs or RAs. This document is a component of a larger effort to identify environmentally sensitive areas on ORR. This report identifies the currently known locations of rare plant species, rare animal species, and special biological communities. Floodplains, wetlands (except those in RAs or NAs), and cultural resources are not included in this report.« less
  • A cross-domain network resource reservation scheduler configured to schedule a path from at least one end-site includes a management plane device configured to monitor and provide information representing at least one of functionality, performance, faults, and fault recovery associated with a network resource; a control plane device configured to at least one of schedule the network resource, provision local area network quality of service, provision local area network bandwidth, and provision wide area network bandwidth; and a service plane device configured to interface with the control plane device to reserve the network resource based on a reservation request and themore » information from the management plane device. Corresponding methods and computer-readable medium are also disclosed.« less
  • Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, whichmore » produces options for earliest completion and shortest duration. The theoretical complexity is only O(n2r2) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.« less
  • A linear programming based on line scheduling procedure for Flexible Manufacturing Cells (FMCS) is presented. The basic idea is aspiring to realize an {open_quotes}ideal{close_quotes} production plan, as derived from a linear programming model which does not take into account many practical factors. The Suggested procedure is implemented in two different configurations of FMCS: one with a common WIP storage facility only, and a second with both a common storage facility and local machines buffers. Simulation results show that the suggested approach achieves good results in terms of maximizing the cell throughput, and copes well with machine breakdowns. It was demonstratedmore » that the suggested linear programming approach can be successfully used for real-time scheduling of various configurations of FMCS.« less