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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foster, I., Kesselman, C., Lee, C., Lindell, B., Nahrstedt, K., Roy, A.: A distributed resource management architecture that supports advance reservations and co-allocation. In: 7th International Workshop on Quality of Service (IWQoS 1999), London, UK. IEEE Computer Society Press, LA (March 1999)
Foster, I., Roy, A., Sander, V.: A Quality of Service architecture that combines resource reservation and application adaptation. In: 8th International Workshop on Quality of Service (2000)
Netto, M.A., Bubendorfer, K., Buyya, R.: SLA-Based Advance Reservations with Flexible and Adaptive Time QoS Parameters. In: Krämer, B.J., Lin, K.-J., Narasimhan, P. (eds.) ICSOC 2007. LNCS, vol. 4749, pp. 119–131. Springer, Heidelberg (2007)
Venugopal, S., Chu, X., Buyya, R.: A negotiation mechanism for advance resource reservation using the alternate offers protocol. In: 16th Int. Workshop on Quality of Service (IWQoS 2008), Twente, The Netherlands (June 2008)
Son, S., Sim, K.M.: A Multi-issue Negotiation Mechanism for Cloud Service Reservation. In: Annual International Conference on Cloud Computing and Virtualization, CCV (May 2010)
Sim, K.M.: Grid Resource Negotiation: Survey and New Directions. IEEE Trans. Syst., Man, Cybern. C, Applications and Reviews 40(3), 245–257 (2010)
Yan, J., Kowalczyk, R., Lin, J., Chhetri, M.B., Goh, S.K., Zhang, J.: Autonomous service level agreement negotiation for service composition provision. Future Generation Computer Systems 23(6), 748–759 (2007)
Sim, K.M.: Towards Complex Negotiation for Cloud Economy. In: Bellavista, P., Chang, R.-S., Chao, H.-C., Lin, S.-F., Sloot, P.M.A. (eds.) GPC 2010. LNCS, vol. 6104, pp. 395–406. Springer, Heidelberg (2010)
Sim, K.M.: Equilibria, Prudent Compromises, and the “Waiting” Game. IEEE Trans. on Systems, Man and Cybernetics, Part B: Cybernetics 35(4), 712–724 (2005)
Rubinstein, A.: Perfect equilibrium in a bargaining model. Econometrica 50(1), 97–109 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Son, S., Sim, K.M. (2010). An Adaptive Tradeoff Algorithm for Multi-issue SLA Negotiation. In: Kim, Th., Yau, S.S., Gervasi, O., Kang, BH., Stoica, A., Ślęzak, D. (eds) Grid and Distributed Computing, Control and Automation. GDC CA 2010 2010. Communications in Computer and Information Science, vol 121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17625-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-17625-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17624-1
Online ISBN: 978-3-642-17625-8
eBook Packages: Computer ScienceComputer Science (R0)