Flow scheduling and endpoint rate control in GridNetworks

Soudan, Sébastien; Chen, Binbin; Primet, Pascale Vicat-Blanc

doi:10.1016/j.future.2008.06.006

Cited by 21 publications

(11 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For practical purposes, we define bandwidth-profile of a request to be a step function over discrete time-slots. This is a common approach in the literature; e.g., [17] solves for step functions to perform deadline-constrained data transfers.…”

Section: Bandwidth-profilementioning

confidence: 99%

Towards Flexible Guarantees in Clouds: Adaptive Bandwidth Allocation and Pricing

Divakaran

Gurusamy

2015

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

This article focuses on the problem of bandwidth allocation to users of Cloud data centers. An interesting approach is to use advance bandwidth reservation. Such systems usually assume all requests demand either bandwidth-guarantee (BG) or timeguarantee (TG), but not both. Hence the solutions are tailored for one type of requests. A BG request demands guarantee on bandwidth; whereas a TG request demands guarantee on time for transfer of data of specified volume. We define a new model that allows users to not only submit both kinds of requests, but also specify flexible demands. We tie up the problem of bandwidth allocation with differential pricing, that gives discounts to users based on the flexibility in their requests. We propose a two-phase, adaptive and flexible bandwidth allocator (A-FBA) that, in one phase admits and allocates minimal bandwidth to dynamically arriving user requests, and in another phase, allocates additional bandwidth for accepted requests maximizing revenue. The problem formulated in first phase is N P-hard, while the second phase can be solved in polynomial time. We show that, in comparison to a traditional deterministic model, the A-FBA not only increases the number of accepted requests significantly, but also does so by generating higher revenues.

show abstract

Section: Bandwidth-profilementioning

confidence: 99%

Towards Flexible Guarantees in Clouds: Adaptive Bandwidth Allocation and Pricing

Divakaran

Gurusamy

2015

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…There are several studies summarizing theoretical complexity of data transfer scheduling [19,23,40]. In [27], authors analyze some common cases and show that there are polynomial time solutions for some very special types of the problem, though for the rest of the cases the solutions are exponential.…”

Section: Related Workmentioning

confidence: 99%

Advance Resource Provisioning in Bulk Data Scheduling

Balman

2013

2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA)

View full text Add to dashboard Cite

Today's scientific and business applications generate massive data sets that need to be transferred to remote sites for sharing, processing, and long term storage. Because of increasing data volumes and enhancement in current network technology that provide ondemand high-speed data access between collaborating institutions, data handling and scheduling problems have reached a new scale. In this paper, we present a new data scheduling model with advance resource provisioning, in which data movement operations are defined with earliest start and latest completion times. We analyze timedependent resource assignment problem, and propose a new methodology to improve the current systems by allowing researchers and higher-level meta-schedulers to use data-placement as-a-service, so they can plan ahead and submit transfer requests in advance. In general, scheduling with time and resource conflicts is NP-hard. We introduce an efficient algorithm to organize multiple requests on the fly, while satisfying users' time and resource constraints. We successfully tested our algorithm in a simple benchmark simulator that we have developed, and demonstrated its performance with initial test results.

show abstract

“…A profile with frequent variations in bandwidth is practically difficult to be enforced at the end-host, given that the transport protocol (TCP, primarily) will take time to converge before using the assigned bandwidth efficiently. Therefore, we limit the bandwidth profile of a request to a step function over intervals, as is common in the literature; e.g., [8] solves for step functions to perform deadline-constrained data transfers.…”

Section: A Assumptionsmentioning

confidence: 99%

Probabilistic-bandwidth guarantees with pricing in data-center networks

Divakaran

Gurusamy

2013

2013 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Bandwidth-sharing in data-center networks is an important problem that affects the growth of multi-tenant datacenters. A promising solution approach is the use of advance reservations. Such systems are usually based on deterministic models, assuming users to have precise knowledge of bandwidth they require, which is unlikely. This work takes a deviation and proposes a probabilistic model, where bandwidth requirements are specified along with some probabilities. As user-estimate of bandwidth depends on the cost they incur, we tie up the model with differential pricing; and formulate bandwidth allocation as a two-phase-static and dynamic-optimization problem. We show that the problem in each phase is NP-hard. We develop a bandwidth-allocator that processes requests and defines bandwidth profiles for accepted requests by solving the optimization problems. Numerical studies show that, in comparison to the deterministic model, our model brings down the number of rejected requests significantly, while allocating more bandwidth and thereby increasing revenue for providers.

show abstract

Flow scheduling and endpoint rate control in GridNetworks

Cited by 21 publications

References 18 publications

Towards Flexible Guarantees in Clouds: Adaptive Bandwidth Allocation and Pricing

Towards Flexible Guarantees in Clouds: Adaptive Bandwidth Allocation and Pricing

Advance Resource Provisioning in Bulk Data Scheduling

Probabilistic-bandwidth guarantees with pricing in data-center networks

Contact Info

Product

Resources

About