A service discovery method based on referral network and ant-colony algorithm

被引:1
|
作者
Xie X.-Q. [1 ]
Song C.-C. [1 ,2 ]
Zhang Z.-Q. [1 ]
机构
[1] College of Computing Science and Technology, Harbin Engineering University
[2] Heilongjiang Province Electronic and Information Products Supervision Inspection Institute
来源
关键词
Ant-colony algorithm; Load balance; Referral network; Service discovery;
D O I
10.3724/SP.J.1016.2010.02093
中图分类号
学科分类号
摘要
Services are archived dispersively on Internet. With the rapid increasing number of Web services, how to discovery the desired Web service automatically and accurately has been a critical hot issue in service-oriented computing. Aiming at such problems as the low search efficiency, load imbalance and lacking semantic understanding existing in current service discovery researches, this paper proposes a new service discovery method based on referral network and ant-colony algorithm. Firstly, a self-organizing service referral network model-SSRNM is constructed. SSRNM defines related policies and provides the search space for service discovery, thus it can be fit for the dynamic and open environment. Secondly, based on SSRNM, an ant-colony algorithm-based service discovery method ABSDA is presented. This method makes use of recommendation to improve the success and recall rate of service discovery, and adopts the idea of ant colony algorithm to solve the network load balancing problem effectively. Finally, the experimental results prove that this method is correct and feasible.
引用
收藏
页码:2093 / 2103
页数:10
相关论文
共 16 条
  • [1] Pinar Y., Singh M.P., Engineering self-organizing referral networks for trustworthy service selection, IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 35, 3, pp. 396-407, (2005)
  • [2] Leonard N., Foner Y., Yenta: A multi-agent, referral-based matchmaking system, Proceedings of the 1st International Conference on Autonomous Agents, pp. 301-307, (1997)
  • [3] Xie X., Song C., Zhang Z., Long Y., A service search method based on referral network, Proceedings of the International Conference on Internet Computing for Science and Engineering 2009, (2009)
  • [4] Laura R., Matteo B., Gianluca R., On ant routing algorithms in Ad Hoc networks with critical connectivity, Ad Hoc Networks, 6, pp. 827-859, (2008)
  • [5] Ling B., Information retrieval based on peer-to-peer computing, (2004)
  • [6] Pan J., Xu F., Lv J., Reputation-based recommender discovery approach for service selection, Journal of Software, 21, 2, pp. 388-400, (2010)
  • [7] Yathiraj B.U., Singh M.P., Information sharing among autonomous agents in referral networks, Proceedings of the 6th International Workshop on Agents and Peer-to-Peer Computing(AP2PC), pp. 13-26, (2007)
  • [8] Yu B., Singh M.P., Searching social networks, Proceedings of the 2nd International Joint Conference on Autonomous Agents and MultiAgent Systems(AAMAS), pp. 65-72, (2003)
  • [9] Paolucci M., Kawamura T., Payne T.R., Importing the semantic Web in UDDI, Proceedings of the Web Services, E-Business and Semantic Web Workshop, pp. 225-236, (2002)
  • [10] Juan C., Daniela G., Mokrane B., BeMatch: A platform for matchmaking service behavior models, Proceedings of the EDBT'08, pp. 695-699, (2008)