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

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.

[1]  Kinji Mori,et al.  Autonomous decentralized community communication for information dissemination , 2004, IEEE Internet Computing.

[2]  Ethan Cerami,et al.  Web Services Essentials , 2002 .

[3]  Donald F. Towsley,et al.  Network tomography on general topologies , 2002, SIGMETRICS '02.

[4]  Kostas G. Anagnostakis,et al.  Direct measurement vs. indirect inference for determining network-internal delays , 2002, Perform. Evaluation.

[5]  Amit P. Sheth,et al.  METEOR-S WSDI: A Scalable P2P Infrastructure of Registries for Semantic Publication and Discovery of Web Services , 2005, Inf. Technol. Manag..

[6]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[7]  M. B. GreenwaldCIS.  Direct Measurement Versus Indirect Inference for Determining Network-Internal Delays , 2002 .

[8]  Kostas G. Anagnostakis,et al.  cing: measuring network-internal delays using only existing infrastructure , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Farnoush Banaei Kashani,et al.  WSPDS: Web Services Peer-to-Peer Discovery Service , 2004, International Conference on Internet Computing.

[10]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[11]  Khaled Ragab,et al.  An Autonomic -Interleaving Registry Overlay Network for Efficient Ubiquities Web Services Discovery Service , 2008, J. Inf. Process. Syst..

[12]  Akinori Yonezawa,et al.  Autonomic K-Interleaving Construction Scheme for P2P Overlay Networks , 2006, ATC.

[13]  Akinori Yonezawa,et al.  \leK, D\ge-Interleaving Structuring Technique for Peer-Peer Overlay Network , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops.

[14]  Katia P. Sycara,et al.  Using DAML-S for P2P Discovery , 2003, International Conference on Web Services.

[15]  Karl Aberer,et al.  Towards P2P-Based Semantic Web Service Discovery with QoS Support , 2005, Business Process Management Workshops.

[16]  Javed I. Khan,et al.  Computing with data non-determinism: Wait time management for peer-to-peer systems , 2008, Comput. Commun..