Wait Time Management for Efficient Web Service Discovery Service with P2P Architecture

Abstract

For the sake of service-sharing in a distributed computing environment, the Web Services infrastructure is designed. The proposed mechanisms for Web services discovery so far have assumed a centralized and peer-to-peer (P2P) registry. UDDI is one of the discovery services with centralized architecture. It induces performance bottleneck, restricts the scalability of this environment, and may result in single points of failure. On the other hand, a discovery service with P2P architecture enables a scalable discovery Web service that runs in self-organized fashion. We proposed an autonomic -interleaving Registry Overlay Network (RgON) that enables Web-services' providers/consumers to publish/discover services' advertisements, WSDL documents. There is no doubt that RgON empowers consumers to discover Web services associated with the advertisements within constant D logical hops over constant K physical hops with reasonable storage and bandwidth utilization as shown through simulations. This paper focuses on the wait time management proposal that sets the required waiting time at each registry node to collect replies of the service quires. The aim of this study is to improve the communication delay and performance of the Web-service discovery service.