Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/71527

Download PDF (Published version) (Adobe Acrobat PDF, -1 bytes)

Title

Gradual removal of QoS constraint violations by employing recursive bargaining strategy for optimizing service composition execution path

Author(s)

Ren, Kaijun;  Xiao, Nibg;  Song, Junqiang;  Yang, Chi;  Zhu, Min;  Chen, Jinjun

Abstract

A critical issue in service composition area is how to achieve an optimized overall end-to-end quality of service(QoS) requirements by effectively coordinating QoS constraints for individual service. However, this issue has not yet been well addressed. In this paper, we propose a novel method by employing a recursive bargaining Strategy to gradually remove QoS constraint violations for Optimizing service composition execution Path. Our method mainly exploits the hidden market competitive relationships which widely exist in real business world for developing a novel bargaining strategy. Based on this strategy, concessions can be made by service providers to offer better QoS values. By recursively using bargaining strategy, an initial execution path built by a local optimization policy for service composition, can be continually updated to be close to the optimal one by reselecting better service providers for meeting overall end-to-end QoS requirements. An experiment and evaluation have been made to demonstrate the feasibility and effectiveness of our proposed method.

Publication type

Conference paper

Research centre

Swinburne University of Technology. Faculty of Information and Communication Technologies

Source

Paper presented at the IEEE International Conference on Web Services (ICWS 2009), Los Angeles, United States, 06-10 July 2009, pp. 485-492

Publication year

2009

Keyword(s)

Quality of service;  QoS;  Service composition

Publisher

United States

ISBN

9780769537092

Publisher URL

http://dx.doi.org/10.1109/ICWS.2009.39

Copyright

Copyright © 2009 IEEE. Published version of the paper reproduced here in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Full text

Peer reviewed