检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王占丰[1] 冯径[1] 舒晓村[1] 翁年凤[1]
出 处:《东南大学学报(自然科学版)》2008年第A01期296-300,共5页Journal of Southeast University:Natural Science Edition
基 金:水利部948资助项目(200610)
摘 要:为了拓展服务发现的范围提高服务发现效率并使得各个服务注册中心上的负载均衡,提出了一种基于Equalchord的语义Web服务发现模型(ECSDM).在此模型中,服务发布时首先按照NACIS进行分类,并以分类码作为标识符按照Chord路由算法分布到网络节点上.针对Equalchord中的节点负载均衡问题提出了过载率的衡量指标.为了实现节点间负载均衡,提出了节点加入算法和节点自动负载均衡算法.节点加入时根据网络中的负载信息来设置自己标识符以分担负载过重节点的负载,节点通过周期性的比较与邻居的负载情况调用自我负载均衡算法按顺时针分担负载,实现节点间的负载均衡.通过仿真系统ChordSim模拟实验,证明了该模型及算法具有良好的效果.In order to extend the web services discovery scope, improve discovering efficiency and realize load balancing, Equalchord based-on web services discovery modeI(ECSDM) is proposed. In this model, web services are firstly classified by NACIS(North American Industry Classification System), then published to nodes by the Chord routing algorithm. To achieve load balancing between different nodes, overload rate is defined then node joined-in algorithm and self balancing algorithm are illustrated. When nodes join in the Equalchord, it must get the network load information and set its identifier accordingly to share the load of overloaded nodes. By the self-balancing algorithm nodes would periodically compare its load with its neighbors and share its loading clockwise. A simulation system ChordSim was designed and implemented. Experimental results show the good performance of this model and algorithms.
关 键 词:Equalchord 服务发现 CHORD NACIS 负载均衡
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229