An Autonomic -Interleaving Registry Overlay Network for Efficient Ubiquities Web Services Discovery Service

The Web Services infrastructure is a distributed computing environment for service-sharing. Mechanisms for Web services Discovery proposed so far have assumed a centralized and peer-to-peer (P2P) registry. A discovery service with centralized architecture, such as UDDI, restricts the scalability of this environment, induces performance bottleneck and may result in single points of failure. A discovery service with P2P architecture enables a scalable and an efficient ubiquities web service discovery service that needs to be run in self-organized fashions. In this paper, we propose an autonomic -interleaving Registry Overlay Network (RgON) that enables web-services' providers/consumers to publish/discover services' advertisements, WSDL documents. The RgON, doubtless empowers consumers to discover web services associated with these advertisements within constant D logical hops over constant K physical hops with reasonable storage and bandwidth utilization as shown through simulation.

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

[2]  Alexander Vardy,et al.  Interleaving Schemes for Multidimensional Cluster Errors , 1998, IEEE Trans. Inf. Theory.

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

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

[5]  Jeffrey O. Kephart,et al.  The Vision of Autonomic Computing , 2003, Computer.

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

[7]  Akinori Yonezawa,et al.  K-Interleaving Rendezvous Overlay Network Construction Scheme , 2006, 5th IEEE/ACIS International Conference on Computer and Information Science and 1st IEEE/ACIS International Workshop on Component-Based Software Engineering,Software Architecture and Reuse (ICIS-COMSAR'06).

[8]  Shuping Ran,et al.  A model for web services discovery with QoS , 2003, SECO.

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

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

[11]  M. Blaum,et al.  Two-dimensional interleaving schemes with repetitions , 1997, Proceedings of IEEE International Symposium on Information Theory.

[12]  Dennis G. Shea,et al.  Autonomic personal computing , 2003, IBM Syst. J..

[13]  N. Biggs.  Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[14]  Anthony H. Dekker,et al.  Network Robustness and Graph Topology , 2004, ACSC.

[15]  Kenneth P. Birman,et al.  Reliable Distributed Systems: Technologies, Web Services, and Applications , 2005 .

[16]  M -.  Estimating Aggregates on a Peer-to-Peer Network , 2003 .

[17]  David Sinreich,et al.  An architectural blueprint for autonomic computing , 2006 .

[18]  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..

[19]  Bill Jackson,et al.  Hamilton Cycles in 2-Connected Regular Bipartite Graphs , 1994, J. Comb. Theory, Ser. B.