北京大学信息学院网络实验室,北京,100871
纸质出版:2004
移动端阅览
韩 华, 代亚非, 李晓明. Emergint:一种支持多节点并发动态增删的P2P路由算法[J]. 电子学报, 2004,32(9):1579-1584.
HAN Hua, DAI Ya-fei, LI Xiao-ming. Emergint:A P2P Routing Algorithm That Supports Multi-Node Dynamic Concurrent Join and Leave[J]. Acta Electronica Sinica, 2004, 32(9): 1579-1584.
针对P2P网络动态构建问题
提出了一种能够支持多节点并发动态加入和退出的P2P路由算法.该算法具有如下特点:(1)自治性:节点的增删不需要统一控制;(2)动态性:节点的增删不影响其他节点路由过程的正确性;(3)并发性:多节点可以同时加入和退出系统
彼此不干扰.该算法的路由延迟为log
N
.模拟测试结果表明:该算法的平均RDP为1.5
增删节点的代价为
O
(log
N
).
Emergint is a P2P routing algorithm which aims at the issue of P2P network dynamic construction.Emergint has 3 characteristics:(1) autonomy:node insert or delete does not need the control of central coordinator;(2) dynamicity:node insert or delete does not affect the correctness of the ongoing routing process of other nodes;(3) concurrency:multiple nodes can join or leave the system at the same time without any interference with each other.We examined the performance of Emergint by network simulation.Examination result shows:The RDP of Emergint is approximately 1.5.The overhead of node insert or delete is
O
(log
N
).
0
浏览量
828
下载量
2
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621