Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Future Generation Co...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Future Generation Computer Systems
Article . 2007 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2007
Data sources: DBLP
versions View all 2 versions
addClaim

Elastic reservations for efficient bandwidth utilization in LambdaGrids

Authors: Sumit Naiksatam; Silvia M. Figueira;

Elastic reservations for efficient bandwidth utilization in LambdaGrids

Abstract

We introduce the concept of elastic reservation of bandwidth capacity to mitigate the problem of bandwidth fragmentation in LambdaGrids and present a network model which can support elastic reservations. We also define the Elastic Scheduling Problem (ESP), which succinctly captures the optimal utilization objective of elastic reservations. Analysis of ESP reveals that it is an NP-complete problem. Hence we present a heuristic algorithm, Squeeze In Stretch Out (SISO), for tackling ESP in polynomial time. SISO achieves good bandwidth utilization in simulation and efficiently handles the dynamic sharing of bandwidth between advance and immediate reservation requests. We also explore the impact of cost incentives for adopting elastic reservations on both the service provider and the user. In general, the approach for elastic reservation and scheduling presented in this paper is applicable to any concurrently accessible resource where the usage characteristics are quasi-flexible.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    36
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
36
Average
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!