Networks with Advance Reservations: Applications, Architecture, and Performance

Burchard, L.-O.

doi:10.1007/s10922-005-9004-7

Cited by 34 publications

(19 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This derives a number of algorithms and/or intractability results for the various models. This paper [7] describes the Schedule resources on Grids is a well-known problem. The extension of Grids to Lambda Grids requires scheduling of lambdas is end-toend high-speed circuits propose a heuristic for the scheduling of lambdas specifically for file transfers, given that many science applications require high-throughput transfers of large files.…”

Section: Iirelated Workmentioning

confidence: 99%

Throughtput Competitive Advance Reservation Using Polynomial Time

Priya¹

2012

IOSRJEN

View full text Add to dashboard Cite

Abstract:In response to the high throughput needs of grid and cloud computing applications, several production networks have recently started to support advance reservation of dedicated circuits. An important open problem within this context is to devise advance reservation algorithms that can provide provable throughput performance guarantees independently of the specific network topology and arrival pattern of reservation requests. In this paper, we first show that the throughput performance of greedy approaches, which return the earliest possible completion time for each incoming request, can be arbitrarily worse than optimal. Next, we introduce two new online, polynomial-time algorithms for advance reservation, called BATCH ALL and BATCH LIM. Both algorithms are shown to be throughput-optimal through the derivation of delay bounds for bandwidth augmented networks. The BATCH LIM algorithm has the advantage of returning the completion time of a connection immediately as a request is placed, but at the expense of looser delay performance. The propose system called BATCH ALL+ is a simple approach that limits path dispersion, i.e., the newly arrived batch can be combined with the currently running batch if the destination is same, so time consumption is less when compare to BATCH ALL and BATCH LIM.

show abstract

Section: Iirelated Workmentioning

confidence: 99%

Throughtput Competitive Advance Reservation Using Polynomial Time

Priya¹

2012

IOSRJEN

View full text Add to dashboard Cite

show abstract

“…There are few studies in advance bandwidth reservation in the literature [6], [7], [8]. The network reservation problem and path computation with guaranteed bandwidth have been categorized into several domains in [9], [10].…”

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

“…There are few studies in on-demand bandwidth allocation [1,6,2] and advance bandwidth reservation [28,44,16,21,32]. A very typical case is to represent the network topology as a graph.…”

Section: Related Workmentioning

confidence: 99%

“…In slotted time model, time is divided into equal slots and each link keeps information about the available bandwidth in each slot. Several studies addressing slotted time model are [28,16,51,46,26]. In continuous time model, the link capacity is modeled as a time-bandwidth function.…”

Section: Related Workmentioning

confidence: 99%

An Online Scheduling Algorithm with Advance Reservation for Large-Scale Data Transfers

Balman¹,

Kosar²

2010

View full text Add to dashboard Cite

2010Abstract Scientific applications and experimental facilities generate massive data sets that need to be transferred to remote collaborating sites for sharing, processing, and long term storage. In order to support increasingly data-intensive science, next generation research networks have been deployed to provide high-speed on-demand data access between collaborating institutions. In this paper, we present a practical model for online data scheduling in which data movement operations are scheduled in advance for end-to-end high performance transfers. In our model, data scheduler interacts with reservation managers and data transfer nodes in order to reserve available bandwidth to guarantee completion of jobs that are accepted and confirmed to satisfy preferred time constraint given by the user. Our methodology improves current systems by allowing researchers and higher level meta-schedulers to use data placement as a service where they can plan ahead and reserve the scheduler time in advance for their data movement operations.We have implemented our algorithm and examined possible techniques for incorporation into current reservation frameworks. Performance measurements confirm that the proposed algorithm is efficient and scalable.

show abstract

Networks with Advance Reservations: Applications, Architecture, and Performance

Cited by 34 publications

References 18 publications

Throughtput Competitive Advance Reservation Using Polynomial Time

Throughtput Competitive Advance Reservation Using Polynomial Time

A Flexible Reservation Algorithm for Advance Network Provisioning

An Online Scheduling Algorithm with Advance Reservation for Large-Scale Data Transfers

Contact Info

Product

Resources

About