Document Type

Conference Proceeding

Source of Publication

Procedia Computer Science

Publication Date

1-1-2011

Abstract

A composite Web service, such as arranging a travel to a conference, can be viewed as a project team that is comprised of several members who want to collaborate in order to accomplish a specific goal. In this work, we propose an algorithm for searching a social network of Web services in order to select an effective set of Web services that can collaborate in order to attain the main goal of the composite Web service at hand. Ultimately, the selection algorithm takes into consideration the set of functions that each Web services member possesses, e.g., hotel booking, car rental, etc., and the communication cost among these members. Our goal is to secure all the functions required by the composite Web service yet minimizing the communication overhead. The preliminary design of the experiments and the future work are described. © 2011 Published by Elsevier Ltd.

ISSN

1877-0509

Publisher

Elsevier B.V.

Volume

5

First Page

466

Last Page

471

Disciplines

Computer Sciences

Keywords

Composite Web services, Searching social network, Team formation

Scopus ID

84856494585

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.

Indexed in Scopus

yes

Open Access

yes

Open Access Type

Gold: This publication is openly available in an open access journal/series

Download

Share

COinS