%0 Journal Article
%T An Algorithm of Web Routing in Small-worlds Network<br>一种基于小世界网络中的Web服务智能路由算法
%A XU Xin-Wei
%A XU Xiao-Ming
%A ZHOU Liang
%A DING Qiu-Lin
%A <br>徐新卫
%A 徐晓明
%A 周良
%A 丁秋林
%J 计算机科学
%D 2007
%I 
%X Because the small-world networks have a short length of characteristic path and evident attention of cluste- ring,and Web service cluster together easily,the efficiency of communication is improved in Web services querying and routing on the network which has small-world features and is constructed by some peer to peer services that regard as vertex in graph.Web service depends on virtual name and routing aware mechanism to expediently implement routing appointed and loaded in SOAP.Based on basic ant colony algorithm,the QAA(QoS constrained Ant colony Algo- rithm)is presented.An experiment and analysis shown that QAA has high efficiency to Web service routing in the e- galitarian small-world network.
%K Web service
%K Web routing
%K Small-world network
%K Ant colony algorithm<br>Web服务
%K Web路由
%K 小世界网络
%K 蚁群算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=DAF1847CBF426DE4&yid=A732AF04DDA03BB3&vid=339D79302DF62549&iid=9CF7A0430CBB2DFD&sid=B6DA1AC076E37400&eid=987EDA49D8A7A635&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=16