Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
A note on constructing binary heaps with periodic networks
Information Processing Letters
Analysis of Data Structures for Admission Control of Advance Reservation Requests
IEEE Transactions on Knowledge and Data Engineering
Networks with Advance Reservations: Applications, Architecture, and Performance
Journal of Network and Systems Management
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks
ICN '07 Proceedings of the Sixth International Conference on Networking
Bandwidth tree - a data structure for routing in networks with advanced reservations
PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks
ISPAN '08 Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks
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 linked-list data structure for advance reservation admission control
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
CHEETAH virtual label switching router for dynamic provisioning in IP optical networks
Optical Switching and Networking
Ultrascience net: network testbed for large-scale science applications
IEEE Communications Magazine
Open problems in network-aware data management in exa-scale computing and terabit networking era
Proceedings of the first international workshop on Network-aware data management
| Hi-index | 0.00 |
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.