一种基于小世界网络中的Web服务智能路由算法  

An Algorithm of Web Routing in Small-worlds Network

作　　者：徐新卫[1] 徐晓明[1] 周良[1] 丁秋林[1] 

机构地区：[1]南京航空航天大学计算机应用研究所,南京210016

出　　处：《计算机科学》2007年第9期48-51,共4页Computer Science

基　　金：十五国家科技攻关项目(编号:2002BA104C);国家863项目(编号:2002AA411030)

摘　　要：依据小世界网络具有特征路径短、聚类度大的特点和服务的聚集性,将提供Web服务的对等节点构造成为具有小世界属性的网络,在服务的查询、路由中可以提高效率和减少通信量。Web服务路由凭借其虚名称和路由感知机制,在SOAP中方便地实现路由路径的指定和装载。本文借助蚁群算法,提出了在小世界网络模型中的基于QoS约束下的路由算法(QAA),通过实验仿真和算法分析表明QAA在对等的小世界网络中具有高效的路由性能。Because the small-world networks have a short length of characteristic path and evident attention of clustering, 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 Algorithm） is presented. An experiment and analysis shown that QAA has high efficiency to Web service routing in the egalitarian small-world network.

关 键 词：WEB服务 Web路由 小世界网络 蚁群算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]