Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

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

  • Ragab, Khaled (College of Computer and Information Technology, King Faisal University)
  • Published : 2008.06.30
Download PDF
⟨ Previous Next ⟩

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 -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.

Keywords

References

  1. K. Ragab, A. Yonezawa, “Autonomic K-interleaving Construction Scheme of P2P Overlay Network,” Proc. LNCS of ATC 2006, September, 2006 China
  2. F. B. kashani, C. Chen, C. Shahabi, “WPSDP: Web Services Peer-to-Peer Discovery Service, “Proc. Of Int. conf. on Internet Computing, pp 733-743, 2004
  3. K. Verma, Et. al. “METEOR-S WDSI: A Scalable P2P Infrastructure Registries for Semantic Publication and Discovery Web Services,” Journal of Information technology and Management, 2004
  4. Jeffrey O. Kephart, Divad M. Chess, “The Vision of Autonomic Computing,” IEEE Computer, PP. 41-50, 2003 https://doi.org/10.1109/MC.2003.1160055
  5. K. Ragab, Et. al. “Autonomous Decentralized Community Communication for Information Dissemination,” IEEE Internet Computing Magazine, Vol.8, No.3, pp.29-36, May/June 2004 https://doi.org/10.1109/MIC.2004.1297271
  6. M. Paolucci, Et. al. “Using DAML-S for P2P Discovery, “ Proc. Of the Int. conf erence on Web Services, 2003
  7. Bantz, D.F., Et. al. “Autonomic personal computation,” IBM Systems Journal, vol. 42, no.1, 2003, pp. 165-176 https://doi.org/10.1147/sj.421.0165
  8. “An architectural blueprint for Autonomic Computing,” White page, 3rd edition June 2005
  9. N. Biggs, “Algebraic Graph Theory”, Cambridge Math. Library ISBN 0-521-45897-8 pbk, (1974, 1993 (2nd edition))
  10. Kenneth P. Birman, “Reliable Distributed Systems Technologies, Web Services and Applications,” Springer 2005
  11. Brendon J. Wilson, “JXTA”, New Riders Publishing 1st edition June, 2002
  12. E. Cerami, “Web Services Essentials,” O'Reilly Media, Inc.; 1st edition, February, 2002
  13. “SOAP Specification version 1.2,” http://www.w3.org/TR/soap12 , 2003
  14. “JXTA Project. JXTA-soap Project,” http://soap.JXTA.org/ servlets/ProjectHome
  15. A. H. Dekker, B. D. Colbert, “Network robustness and graph topology,” ACM Proc. 27th Int. Conf. on Australian Computer Science, pp 359-368, 2004
  16. OASIS standards consortium, “Universal Description, Discovery and Integration of Web Services (UDDI),” Version 2.0, 2002, http://www.uddi.org/
  17. K. Ragab, Y. Oyama, A. Yonezawa “K-Interleaving Rendezvous Overlay Network Construction Scheme,” Proc. Of IEEE, ICIS2006, Julay 2006, USA https://doi.org/10.1109/ICIS-COMSAR.2006.54
  18. M. Bawa, H. Garcia-Molina, A. Gionis and R. Motwani, “Estimating aggregates on a peer-to-peer network,” Technical Report, Dept. of Computer Science, Stanford University, 2003
  19. Peter Brittenham, “Autonomic Computing: An insider's Perspective,” June 2005, http://www-128.ibm.com/developerworks/autonomic/library/ac-inside/index.html
  20. Shuping Ran, “A model for web services discovery with QoS,” ACM SIGeCom Exch. Journal, Vol. 4, Issue 1, pp.1-10, 2003 https://doi.org/10.1145/1120709.1120710
  21. M. Blaum, J. Bruck, and A. “Vardy. Interleaving schemes for multidimensional cluster errors,” IEEE Transactions on Information Theory, 44(2):730–743, 1998 https://doi.org/10.1109/18.661516
  22. M. Blaum, J. Bruck and P.G. Farell, “Two-dimensional Interleaving Schemes with repetitions,” IBM Research Report RJ 10047, Oct. 1996
  23. B. Jackson and H. Li, “Hamilton Cycles in 2-Connected k-regular Bipartite Graphs,” Comb. Theory Series A, 44 (2): 177-186, 1998
  24. I. Sotica, R. Morris, D. Karager, F. Kasshoek, H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for Internet Applications,” ACM SIGCOMM'01, August 2001

Cited by

  1. Low-Cost Web Service Discovery Based on Distributed Decision Tree in P2P Environments vol.73, pp.4, 2013, https://doi.org/10.1007/s11277-013-1261-2