Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Looking up data in P2P systems
Communications of the ACM
Deconstructing the Kazaa Network
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
A super-peer model for resource discovery services in large-scale Grids
Future Generation Computer Systems
Hi-index | 0.00 |
A workflow system is often composed of a number of subtasks in its pattern. In services computing environment, a dynamic cross-organizational workflow can be implemented by assigning services to its subtasks. It is often enabled by a service discovery process on Internet. Traditional service discovery approaches are centralized, and suffer from many problems such as one-point failure and weak scalability. Thus, decentralized P2P technique is a promising approach for service publishing and discovery. It is quite probable that there are more than one candidates which have exactly the same function after a service discovery process. It is often a challenging effort to select a qualified service from a group of candidates, especially on P2P networks. In view of this challenge, a QoS-aware service selection approach on unstructured P2P networks is presented in this paper. It aims at discovering and selecting services on two-layered unstructured P2P networks according to QoS parameters of services and preference of service requesters. This approach is applied to a case study based on a simplified P2P network with some virtual services.