A time-constrained SLA negotiation strategy in competitive computational grids

Silaghi, Gheorghe Cosmin; Şerban, Liviu Dan; Litan, Cristian Marius

doi:10.1016/j.future.2011.11.002

Cited by 45 publications

(25 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They also take into account the providers' cost which is proportional to the use of physical capacity and time interval. Silaghi et al propose a general framework of SLA negotiation strategy under time constrained in competitive computational grids and build it based on Bayesian learning agent (Silaghi et al, 2012). Their experiments show that opponent learning-based negotiation strategy can achieve optimal resource allocation and fair satisfaction of participants.…”

Section: Game Theory Based Cloud Sla Modelmentioning

confidence: 99%

A Competitive Penalty Model for Availability Based Cloud Sla

Yuan¹,

Tang²,

Liu³

et al. 2016

STCC

View full text Add to dashboard Cite

Availability is one of the most essential attributes of qualities of cloud services. Most popular public cloud services claim availability commitments with corresponding penalties in their SLAs. To gain the maximal profits, cloud providers should choose an optimal penalty strategy in the competitive cloud market. In this paper, we firstly survey availability and penalty calculation methods of cloud providers. Based on the survey, we propose a competitive penalty model and a corresponding penalty based profit maximization algorithm for cloud providers. According to the model, each cloud provider would choose the best fit penalty strategy to gain the maximal expected profit during the game procedure. The proposed model is evaluated with real data of popular cloud providers with sensitive analysis, and is valuable for cloud providers to define their penalty strategy.

show abstract

Section: Game Theory Based Cloud Sla Modelmentioning

confidence: 99%

A Competitive Penalty Model for Availability Based Cloud Sla

Yuan¹,

Tang²,

Liu³

et al. 2016

STCC

View full text Add to dashboard Cite

show abstract

“…Unluckily, this proposal has only been simulated. A more recent publication [37] considers the use of time-constrained SLAs within Grids in order to improve the negotiation strategy by using a Bayesian learning agent.…”

Section: Service Level Agreementsmentioning

confidence: 99%

“…Alternatively, some proposals push for the QoS differentiation in terms of internal metrics related to the Grid infrastructure defined on SLAs [36,37] (e.g., CPU architecture, amount of RAM, bandwidth, etc.). Our work encompass this terms by defining a high level term that represents the confidence that the users expect from the service.…”

Section: Qos Differentiationmentioning

confidence: 99%

From volunteer to trustable computing: Providing QoS-aware scheduling mechanisms for multi-grid computing environments

Conejero

Caminero

Carrión

et al. 2014

Future Generation Computer Systems

View full text Add to dashboard Cite

From volunteer to trustable computing: Providing QoS-aware scheduling mechanisms for multigrid computing environments. Future generations computer systems, AbstractThe exploitation of service oriented technologies, such as Grid computing, is being boosted by the current service oriented economy trend, leading to a growing need of Quality of Service (QoS) mechanisms. However, Grid computing was created to provide vast amounts of computational power but in a best effort way. Providing QoS guarantees is therefore a very difficult and complex task due to the distributed and heterogeneous nature of their resources, specially the volunteer computing resources (e.g., desktop resources).The scope of this paper is to empower an integrated multi QoS support suitable for Grid Computing environments made of either dedicated and volunteer resources, even taking advantage of that fact. The QoS is provided through SLAs by exploiting different available scheduling mechanisms in a coordinated way, and applying appropriate resource usage optimization techniques. It is based on the differentiated use of reservations and scheduling in advance techniques, enhanced with the integration of rescheduling techniques that improve the allocation decisions already made, achieving a higher re- source utilization and still ensuring the agreed QoS. As a result, our proposal enhances best-effort Grid environments by providing QoS aware scheduling capabilities. This proposal has been validated by means of a set of experiments performed in a real Grid testbed. Results show how the proposed framework effectively harnesses the specific capabilities of the underlying resources to provide every user with the desired QoS level, while, at the same time, optimizing the resources' usage.

show abstract

“…However, most of works present non-cooperative approaches. Silaghi et al [14] tackle resource allocation problem in competitive grid. Despite considering a incomplete information game, their approach can infer opponent's utility function and achieve a fair resource allocation.…”

Section: Related Workmentioning

confidence: 99%

Multi-user variability configuration: A game theoretic approach

García-Galán

Trinidad

Ruiz–Cortés

2013

2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

Multi-user configuration is a neglected problem in variability-intensive systems area. The appearance of conflicts among user configurations is a main concern. Current approaches focus on avoiding such conflicts, applying the mutual exclusion principle. However, this perspective has a negative impact on users satisfaction, who cannot make any decision fairly. In this work, we propose an interpretation of multi-user configuration as a game theoretic problem.Game theory is a well-known discipline which analyzes conflicts and cooperation among intelligent rational decisionmakers. We present a taxonomy of multi-user configuration approaches, and how they can be interpreted as different problems of game theory. We focus on cooperative game theory to propose and automate a tradeoff-based bargaining approach, as a way to solve the conflicts and maximize user satisfaction at the same time.

show abstract

A time-constrained SLA negotiation strategy in competitive computational grids

Cited by 45 publications

References 25 publications

A Competitive Penalty Model for Availability Based Cloud Sla

A Competitive Penalty Model for Availability Based Cloud Sla

From volunteer to trustable computing: Providing QoS-aware scheduling mechanisms for multi-grid computing environments

Multi-user variability configuration: A game theoretic approach

Contact Info

Product

Resources

About