Volume 9 Number 1 (Jan. 2014)
Home > Archive > 2014 > Volume 9 Number 1 (Jan. 2014) >
JSW 2014 Vol.9(1): 70-75
doi: 10.4304/jsw.9.1.70-75

Distributed Service Discovery Algorithm Based on Ant Colony Algorithm

Chijun Zhang 1 , Guanyu Mu 2 , He Chen 3 , Tiezheng Sun 4 , Liyan Pang 4

  • 1 College of Management Science and Information Engineering, Jilin University of Finance and Economics, Changchun, China; Key Laboratory of Logistics Industry Economy and Intelligent Logistics at Universities of Jilin Province , Changchun, China
  • 2 College of Management Science and Information Engineering, Jilin University of Finance and Economics, Changchun, China
  • 3 College of Communication Engineering, Jilin University, Changchun, China
  • 4 College of Management Science and Information Engineering, Jilin University of Finance and Economics, Changchun, China

Abstract

UDDI is a universal description, discovery and integration protocol. As a public registry of Web service, it is designed to store information about each company and its service. Traditional centralized service discovery structure of UDDI service registration center does not apply to largescale service discovery. When all the services register to a center, the service bottleneck, failure of single point and the poor scalability defects will occur. In addition, traditional service matching mechanisms are mainly based on keywords method which lacks of semantic description and makes the service publisher and demanders cannot reach a common semantic understanding. This will lead to the problems of semantic conflicts and low accuracy that seriously affects the precision and recall of service matching. To address these shortcomings of the centralized service discovery structure of UDDI, we propose a distributed semantic service registration center which is in the construction of loosely coupled P2P network enabled the progressive massive search. In the P2P distributed network, there can be a large number of nodes to store the registration information which is suitable for large-scale service because of the adaptivity, scalability and good fault tolerance characteristics. In order to reduce the number of concurrent transmitted packets, the advanced ant colony algorithm is introduced to forward packets by probabilistic choice. The results comparison with the traditional algorithm is given through the simulation experiments and it has shown that the proposed method has good performance for the distributed service discovery

Keywords

  • UDDI
  • P2P distributed network
  • Semantic
jsw0901-09

How to Cite

Copied

Chijun Zhang, Guanyu Mu, He Chen, Tiezheng Sun, and Liyan Pang, "Distributed Service Discovery Algorithm Based on Ant Colony Algorithm," Journal of Software, vol. 9, no. 1, pp. 70-75, 2014. https://doi.org/ 10.4304/jsw.9.1.70-75

Copyright & License

Copyright © 2014 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

General Information

  • ISSN: 1796-217X (Online)

  • Abbreviated Title: J. Softw.

  • Frequency:  Biannually

  • APC: 500USD

  • DOI: 10.17706/JSW

  • Editor-in-Chief: Prof. Antanas Verikas

  • Executive Editor: Ms. Cecilia Xie

  • Abstracting/ Indexing: DBLP, CNKI, 

  • Google Scholar, ProQuest,
           INSPEC(IET), ULRICH's Periodicals
           Directory, WorldCat, etc

  • E-mail: editor@jsoftware.us

  • Aug 27, 2026 News!

    Vol 21, No 1 has been published with online version

  • Mar 30, 2026 News!

    Vol 20, No 2 has been published with online version   [Click]

  • Apr 01, 2024 News!

    Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec)     [Click]

  • Apr 01, 2024 News!

    Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP   [Click]

  • Mar 07, 2025 News!

    JSW had implemented online submission system   [Click]