An adaptive tradeoff algorithm for multi-issue SLA negotiation

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Since participants in a Cloud may be independent bodies, mechanisms are necessary for resolving different preferences in leasing Cloud services. Whereas there are currently mechanisms that support service-level agreement negotiation, there is little or no negotiation support for concurrent price and timeslot for Cloud service reservations. For the concurrent price and timeslot negotiation, a tradeoff algorithm to generate and evaluate a proposal which consists of price and timeslot proposal is necessary. The contribution of this work is thus to design an adaptive tradeoff algorithm for multi-issue negotiation mechanism. The tradeoff algorithm referred to as "adaptive burst mode" is especially designed to increase negotiation speed and total utility and to reduce computational load by adaptively generating concurrent set of proposals. The empirical results obtained from simulations carried out using a testbed suggest that due to the concurrent price and timeslot negotiation mechanism with adaptive tradeoff algorithm: 1) both agents achieve the best performance in terms of negotiation speed and utility; 2) the number of evaluations of each proposal is comparatively lower than previous scheme (burst-N). © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Son, S., & Sim, K. M. (2010). An adaptive tradeoff algorithm for multi-issue SLA negotiation. In Communications in Computer and Information Science (Vol. 121 CCIS, pp. 32–41). https://doi.org/10.1007/978-3-642-17625-8_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free