By Topic

Adaptive Task Allocation for P2P-Based e-Services Composition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jun Shen ; Centre for Inf. Syst. & Technol. Res., Univ. of Wollongong, Wollongong, NSW ; Shuai Yuan

To effectively manage the task allocation, especially when handling with numerous different peers' qualities, is one of the greatest challenges to be faced in order to guarantee the success of P2P-based e-services composition. In this context, various QoS descriptive frameworks and Web services technologies (such as WSDL and BPEL) are being considered as the most affordable solutions to promote the performance of decentralized e-services, through applying strategies like QoS ontologies and related optimization algorithms globally or locally. Nonetheless, most P2P-based service selection and composition approaches applied nowadays lack dynamism and autonomy. In this paper, we first propose an extension of non-functional properties in WSMO, so that to globally facilitate dynamism and autonomous coordination in service compositions. Furthermore, taking into account a model driven approach, we design a planning algorithm to intelligently assign composition tasks to the most appropriate peers for different steps in a whole process. This algorithm is implemented in our prototype UOW-SWS via considering a typical LoanApproval scenario.

Published in:

Pervasive Computing and Applications, 2008. ICPCA 2008. Third International Conference on  (Volume:1 )

Date of Conference:

6-8 Oct. 2008