An Autonomic <K, D>-Interleaving Registry Overlay Network for Efficient Ubiquities Web Services Discovery Service
1
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
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 <K, D>-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.
Abstract
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 <K, D>-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.
참고문헌 (24)
- K. Ragab, "Autonomic K-interleaving Construction Scheme of P2P Overlay Network", Proc. LNCS of ATC 2006 (2006)
- F. B. kashani, "WPSDP: Web Services Peer-to-Peer Discovery Service", Proc. Of Int. conf. on Internet Computing, pp.733~743 (2004)
- K. Verma, "METEOR-S WDSI: A Scalable P2P Infrastructure Registries for Semantic Publication and Discovery Web Services", Journal of Information technology and Management (2004)
- Jeffrey O. Kephart, "The Vision of Autonomic Computing", IEEE Computer, pp.41~50 (2003)
- K. Ragab, "Autonomous Decentralized Community Communication for Information Dissemination", IEEE Internet Computing Magazine, 8(3), pp.29~36 (2004)
- M. Paolucci, "Using DAML-S for P2P Discovery", Proc. Of the Int. conf erence on Web Services (2003)
- Bantz, D.F., "Autonomic personal computation", IBM Systems Journal, 42(1), pp.165~176 (2003)
- "An architectural blueprint for Autonomic Computing", ~ (2005)
- N. Biggs, "Algebraic Graph The" (1974), Cambridge Math. Library
- Kenneth P. Birman, "Reliable Distributed Systems Technologies, Web Services and Applications", ~ (2005)
- Brendon J. Wilson, "JXTA" (2002), New Riders Publishing
- E. Cerami, "Web Services Essentials" (2002), O'Reilly Media, Inc.
- "SOAP Specification version 1.2"[URL]
- "JXTA Project. JXTA-soap Project"[URL]
- A. H. Dekker, "Network robustness and graph topology", ACM Proc. 27th Int. Conf. on Australian Computer Science, pp.359~368 (2004)
- "Universal Description, Discovery and Integration of Web Services (UDDI), Version 2.0"[URL]
- K. Ragab, "K-Interleaving Rendezvous Overlay Network Construction Scheme", Proc. Of IEEE, ICIS2006 (2006)
- Estimating aggregates on a peer-to-peer network, "M. Bawa", Dept. of Computer Science, Stanford University, ~ (2003)
- "Autonomic Computing: An insider’s Perspective"[URL]
- Shuping Ran, "A model for web services discovery with QoS", ACM SIGeCom Exch. Journal, 4(1), pp.1~10 (2003)
- M. Blaum, "Vardy. Interleaving schemes for multidimensional cluster errors", IEEE Transactions on Information Theory, 44(2), pp.730~743 (1998)
- Two-dimensional Interleaving Schemes with repetitions, "M. Blaum", ~, pp.IBM Research Report RJ 10047 (1996)
- B. Jackson, "Hamilton Cycles in 2-Connected k-regular Bipartite Graphs", Comb. Theory Series A, 44(2), pp.177~186 (1998)
- I. Sotica, "Chord: A scalable peer-to-peer lookup service for Internet Applications", ACM SIGCOMM’01 (2001)