CORC  > 清华大学
Twins: scalable 2-hop structured overlay network
Jinfeng Hu ; Huanan Zhang ; Weimin Zheng
2010-05-06 ; 2010-05-06
关键词Practical/ peer-to-peer computing routing protocols table lookup/ structured overlay network Twins routing table peer-to-peer system/ B6210L Computer communications B6150M Protocols B6150P Communication network design, planning and routing C5620 Computer networks and techniques C6150N Distributed systems software C5640 Protocols
中文摘要In this paper we propose a new structured overlay network, which is more efficient and scalable than previous ones. We call it Twins, because its routing table consists of two parts, one containing nodes with common prefix and the other containing nodes with common suffix. Twins routes messages to their destinations in just 2 hops even in a very large scale and the overhead is very low. When deployed in a peer-to-peer system with 5000000 nodes, each node receives only 6 messages per second for routing table maintenance. This cost, as well as routing table size, varies as a O( radic N) function to the overlay scale, so Twins can also run well in an even larger environment.
语种英语 ; 英语
出版者Slovak Acad. Sci ; Slovakia
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/10305]  
专题清华大学
推荐引用方式
GB/T 7714
Jinfeng Hu,Huanan Zhang,Weimin Zheng. Twins: scalable 2-hop structured overlay network[J],2010, 2010.
APA Jinfeng Hu,Huanan Zhang,&Weimin Zheng.(2010).Twins: scalable 2-hop structured overlay network..
MLA Jinfeng Hu,et al."Twins: scalable 2-hop structured overlay network".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace