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

Distributed Service Discovery Algorithm Based on Ant Colony Algorithm

Chijun Zhang1, Guanyu Mu2, He Chen3, Tiezheng Sun4, Liyan Pang4
1College 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
2College of Management Science and Information Engineering, Jilin University of Finance and Economics, Changchun, China
3College of Communication Engineering, Jilin University, Changchun, China
4College 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

Index Terms—UDDI, P2P distributed network, Semantic, Ant colony algorithm

[PDF]

Cite: Chijun Zhang, Guanyu Mu, He Chen, Tiezheng Sun, Liyan Pang, "Distributed Service Discovery Algorithm Based on Ant Colony Algorithm," Journal of Software vol. 9, no. 1, pp. 70-75, 2014.

General Information

ISSN: 1796-217X (Online)
Frequency:  Bimonthly (Since 2020)
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, Google Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsw@iap.org
  • Apr 26, 2021 News!

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

  • Jun 22, 2020 News!

    Papers published in JSW Vol 14, No 1- Vol 15 No 4 have been indexed by DBLP     [Click]

  • Sep 13, 2021 News!

    The papers published in Vol 16, No 6 have all received dois from Crossref    [Click]

  • Jan 28, 2021 News!

    [CFP] 2021 the annual meeting of JSW Editorial Board, ICCSM 2021, will be held in Rome, Italy, July 21-23, 2021   [Click]

  • Sep 13, 2021 News!

    Vol 16, No 6 has been published with online version     [Click]