A Flexible Reservation Algorithm for Advance Network Provisioning
Conference
·
OSTI ID:993854
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, which 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.
- Research Organization:
- Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US)
- Sponsoring Organization:
- Computational Research Division
- DOE Contract Number:
- AC02-05CH11231
- OSTI ID:
- 993854
- Report Number(s):
- LBNL-4017E
- Country of Publication:
- United States
- Language:
- English
Similar Records
A New Approach in Advance Network Reservation and Provisioning for High-Performance Scientific Data Transfers
Advance Network Reservation and Provisioning for Science
Oscars
Technical Report
·
Wed Jan 27 23:00:00 EST 2010
·
OSTI ID:1000959
Advance Network Reservation and Provisioning for Science
Conference
·
Fri Jul 10 00:00:00 EDT 2009
·
OSTI ID:985919
Oscars
Software
·
Tue Jun 19 20:00:00 EDT 2007
·
OSTI ID:code-54704