Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks

Sahni, Sartaj; Rao, Nageswara S. V.; Ranka, Sanjay; Li, Yan; Jung, Eun-Sung; Kamath, Nishant

doi:10.1109/icn.2007.27

Cited by 43 publications

(34 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Similar problems are further discussed in [7] with an in-depth explanation on the solution to each of these problems. These basic scheduling problems with several extensions are also investigated in [8] with a focus on increasing the flexibility of services.…”

Section: B Related Workmentioning

confidence: 99%

Path Computation with Variable Bandwidth for Bulk Data Transfer in High-Performance Networks

Lin

2009

IEEE INFOCOM Workshops 2009

View full text Add to dashboard Cite

Abstract-There are an increasing number of highperformance networks that provision dedicated channels through circuit-switching or MPLS/GMPLS techniques to support bulk data transfer in large-scale science or ecommerce applications. These dedicated links are typically shared by multiple users through advance reservations, resulting in varying bandwidth availability in future time periods. Therefore, efficient advance bandwidth reservation algorithms are needed to improve the utilization of network resources and meet the transport requirements of application users. We investigate the bandwidth-oriented path computation problem for two types of data transfer: (i) fixed path with variable bandwidth and (ii) variable path with variable bandwidth to minimize the transfer end time of a given data size. We prove that both problems are NP-complete and propose a heuristic algorithm for each of them. Extensive simulation results illustrate the performance superiority of the proposed heuristics over methods based on greedy strategies.

show abstract

Section: B Related Workmentioning

confidence: 99%

Path Computation with Variable Bandwidth for Bulk Data Transfer in High-Performance Networks

Lin

2009

IEEE INFOCOM Workshops 2009

View full text Add to dashboard Cite

show abstract

“…The network reservation problem and path computation with guaranteed bandwidth have been categorized into several domains in [9], [10]. One of those problems is to reserve a fixed slot in which we find a path from source to destination with a specific bandwidth requirement.…”

Section: Related Workmentioning

confidence: 99%

“…They do not address flexible reservation, and do not provide alternative suggestions to the user. The proposed solution methods in [9], [10] represent time-dependent network topology by keeping available bandwidth information for every link in each time slot. This slotted time window model has high cost and it is not effective for real-life advance reservations systems.…”

Section: Related Workmentioning

confidence: 99%

A Flexible Reservation Algorithm for Advance Network Provisioning

Balman

Chaniotakisy

Shoshani

et al. 2010

2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis

View full text Add to dashboard Cite

Abstract-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(n 2 r 2 ) 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.

show abstract

“…Authors of [12] focus on how to compute a dedicated channel from a source node to a destination node in a network under different requirements: (1) a specified bandwidth in a specified time slot, (2) the highest available bandwidth in a specified time slot, (3) the earliest available time with a specified bandwidth and duration, and (4) all available time slots with a specified bandwidth and duration. In these four scheduling problems, the first and third problems can be solved using the classical breadth-first search, the second one falls in the scope of problems solvable using Dijkstra's shortest path algorithm, and the solution to the fourth one is essentially a variant of Bellman-Ford algorithm.…”

Section: Related Workmentioning

confidence: 99%

Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning

Zuo

Zhu

2013

J Netw Syst Manage

View full text Add to dashboard Cite

Large-scale collaborative e-science requires fast and reliable data transfer with guaranteed performance, which is made possible by reserving bandwidth as needed in advance in high-performance networks. In scientific applications, users typically know the data size, the data available time, and the deadline to finish the data transfer, and they always wish to achieve the earliest possible finish time or the minimum time duration for the data transfer. On the other hand, the network service provider wishes to serve as many users' bandwidth reservation requests (BRRs) as possible to maximize the network resource utilization without compromising their deadlines. Such multi-objective requirements and high system throughput call for a fast and efficient bandwidth reservation strategy that can quickly discover various reservation options in a time-varying network environment. We propose two bandwidth reservation algorithms with rigorous optimality proofs to compute the reservation options with the earliest completion time and with the shortest duration for a local BRR. Our algorithms aim to achieve the balanced resource utilization for the network system. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of execution time, success ratio, success ratio of BRRs with different priorities and searched complexity of BRRs in comparison with similar scheduling algorithms.

show abstract

Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks

Cited by 43 publications

References 6 publications

Path Computation with Variable Bandwidth for Bulk Data Transfer in High-Performance Networks

Path Computation with Variable Bandwidth for Bulk Data Transfer in High-Performance Networks

A Flexible Reservation Algorithm for Advance Network Provisioning

Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning

Contact Info

Product

Resources

About