PolyU Institutional Repository >
COMP Journal/Magazine Articles >
Please use this identifier to cite or link to this item:
|Title: ||WEBGOP: collaborative Web services based on graph-oriented programming|
|Authors: ||Chan, Alvin T. S.|
Chan, C. K.
|Subjects: ||Collaborative Web services|
Simple-object access protocol (SOAP)
|Issue Date: ||Nov-2005 |
|Citation: ||IEEE transactions on systems, man, and cybernetics. Part A, Systems and humans, Nov. 2005, v. 35, no. 6, p. 811-830|
|Abstract: ||WEBGOP is a programming architecture for collaborative Web services using graph-oriented programming. The motivation for the project comes from the realization that the integration of collaborative Web services lacks support. The aim of WEBGOP is to extend the Web from a client-server system to a structured multipoint system. A graph abstraction of the network provides the structure for the integration of Web services and facilitates their configuration and programming. Using WEBGOP, a logical graph representing a virtual-overlay network over the Internet is created to link up collaborative Web services. Web services are individually or jointly invoked through either unicast or multicast messages within the overlay network. All messages are based on the simple-object access protocol (SOAP). This forms an extension of the hypertext transfer protocol (HTTP) to support the distributed invocation of Web services. The Web services on different servers work collaboratively for a multipoint network application. This project provides a structured integration of Web services by extending the support of intermediary processing in a multipoint service. It also provides a rich network-programming interface for a new class of integrated Web applications while retaining the use of the Internet protocol and HTTP.|
|Rights: ||© 2005 IEEE. 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.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Type: ||Journal/Magazine Article|
|Appears in Collections:||COMP Journal/Magazine Articles|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.