检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:庄雷[1] 陈鸿昶[1] 黄建华[1] 李祖鹏[1] 黄道颖[1]
机构地区:[1]国家数字交换系统工程技术研究中心
出 处:《计算机应用与软件》2005年第9期10-11,47,共3页Computer Applications and Software
基 金:国家863高科技发展计划资助项目(编号:2001AA111141)
摘 要:在现有对等网络结构中,所有的主机只负责自己的数据和索引存储,并且对待网络流量的行为是一致的。查询到达与流量受到网络中所有主机的最低的发送和接受能力的限制。以超级结点划分区域的网络中,超级节点是与其它节点联系多、发送和接受能力强、存储容量大、处理速度快的主机,叶子节点则是与其它主机联系较少,网络带宽较小的主机。超级节点的性能决定了整个网络的性能,该模型能够极大地改善查询性能。In traditional peer-to-peer networks architectures all hosts only memory their own data and index themselves, their behaving are consistent when they tread networks traffic. The search query reach and traffic are limited by the lowest abilities of all hosts' sending and receiving. Superpeers are host,which have more connections with other hosts, more powerful ability of sending and receiving messages,larger memory and higher speed CPU. Oppositely,leafpeers have fewer connections with other peers and their bandwidth is small. The networks performance is determined by superpeers' performance. The approaches can greatly improve searching performance in the distributed networks.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200