检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:侯秀红[1] 刘杰[1] 汪国安[1] 蔡道家[1]
机构地区:[1]河南大学计算机与信息工程学院,河南开封475004
出 处:《计算机工程与应用》2009年第15期102-106,143,共6页Computer Engineering and Applications
基 金:河南省教育厅自然科学基金No.2007520003~~
摘 要:对等网络的拓扑失配会引起不必要的网络流量,不仅加重了物理网络的负担,而且加大了节点间资源搜索的平均时延。提出一种基于物理拓扑信息的P2P网络模型CSL。CSL模型是以自治系统之间的物理连接构成Center层,以节点的网络地址构成Super层,由普通节点形成Leaf层的三层模型,并采用相应的算法维护网络的运行。通过实验表明,CSL模型在资源搜索时可以明显降低系统的平均时延。针对拓扑失配问题提出的CSL模型可以很好的工作,特别是节点规模较大时在减轻网络负担和降低资源搜索的平均时延方面表现更好。Unnecessary network stream could be brought by the problem of topology mismatching in P2P(Peer-to-Peer) networks. So both the overhead of the physical network and the average time delay for information searching between peers are aggravated. In this paper,a P2P network model CSL (center-super-leaf) based on physical topology is presented.There are three layers in CSL model.They are center layer based upon the physical links among autonomic systems,super layer based upon the network addresses of peers,and leaf layer built by common nodes.Meanwhile corresponding algorithm to run the network is given.The experiments show that in CSL model,the average time delay for information searching between peers could be obviously decreased. The CSL-P2P network what is presented to solve mismatching problem could work well.Especially when there are large-scale peers in P2P network,it could performance better in decreasing both the overhead of the physical network and the average time delay for information searching between peers.
关 键 词:对等网络 拓扑失配 CSL模型 资源搜索 平均时延
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15