A novel hybrid web service discovery algorithm

被引：0
作者：
机构：
[1] Department of Information Management, School of Economics and Management, Nanjing University of Science and Technology, Nanjing
[2] Division of Education Affairs, Nanjing Forest Police College, Nanjing
来源：
Zhu, Peng (pzhu@ieee.org) | 1600年 / Springer Verlag卷 / 474期
关键词：
Algorithm; Ant colony; Referral network; Web service discovery;
D O I：
10.1007/978-3-662-45289-9_9
中图分类号：
学科分类号：
摘要：
As web services on the Internet expands quickly, how to search web services automatically, accurately and fast has become a difficult issue in service- oriented computing. Responding to the problems existing in an open and dynamic environment in the service discovery studies such as low search efficiency, unbalanced loading and semantic inefficiency, this paper puts forward a hybrid service discovery algorithm based on referral network and ant colony algorithm. Firstly, this paper constructs a self-organizing service referral network model and provides policy for the algorithm. Secondly, this paper raises a service discovery algorithm based on ant colony and basis of self-organizing service referral network model. The experimental results show that the algorithm can improve success rate and recall ratio of web service discovery. © Springer-Verlag Berlin Heidelberg 2014.
引用
收藏
页码：94 / 104
页数：10
相关论文
共 13 条
  • [1] Harman M., Mansouri S.A., Zhang Y.Y., Search-Based Software Engineering: Trends, Techniques and Applications, ACM Computing Surveys, 45, 1, (2012)
  • [2] Deng H.B., King I., Lyu M.R., Enhanced Models for Expertise Retrieval Using Community- Aware Strategies, IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics, 42, 1, pp. 93-106, (2012)
  • [3] Huang Y.F., Ying L., Yuan J., Tang S., Network service registration based on role-goalprocess- service meta-model in a P2P network, IET Communications, 6, 12, pp. 1632-1639, (2012)
  • [4] Cabrera-Mora F., Xiao J.Z., A Flooding Algorithm for Multirobot Exploration, IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics, 42, 3, pp. 850-863, (2012)
  • [5] Yu W.J., Zhai K.Y., Zhuang H., Chen J.Q., Accelerated floating random walk algorithm for the electrostatic computation with 3-D rectilinear-shaped conductors, Simulation Modelling Practice and Theory, 34, pp. 20-36, (2013)
  • [6] Udupi Y.B., Singh M.P., Information Sharing among Autonomous Agents in Referral Networks, AP2PC 2007. LNCS, 5319, pp. 13-26, (2010)
  • [7] Yolum P., 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)
  • [8] Jung J.J., Contextualized mobile recommendation service based on interactive social network discovered from mobile users, Expert Systems with Applications, 36, 9, pp. 11950-11956, (2009)
  • [9] Gkantsidis C., Mihail M., Amin S., Random walks in peer-to-peer networks: Algorithms and evaluation, Performance Evaluation, 63, 3, pp. 241-263, (2006)
  • [10] Ji J.Z., Liu Z.J., Zhang A.D., Yang C.C., Liu C.N.H.-F., Mining functional modules in protein-protein interaction networks using ant colony optimization and multi-agent evolution, Neurocomputing, 121, SI, pp. 453-469, (2013)
12