摘要
在分析现有应用层组播协议基础上,提出Tree-Ring模型,该模型构建于Pastry之上,采用Pastry的路由与定位机制,构造一个树与环相结合的覆盖网络。实验显示,模型中70%以上的节点出度为1,80%以上的节点的相对延迟比控制在2.7以内。结果表明,Tree-Ring能有效地平衡节点负载,满足大规模网络中大内容传播的需要。
This paper presents the Tree-Ring, by analyzing traditional application level multicast protocol, which is built on top of Pastry. It combines tree concept with ring concept to build an overlay network with the location and routing mechanism of Pastry. Experiment shows that the out-degree of nodes over 70% is 1 and the RDP of nodes over 80% is within 2.7. The results show that Tree-Ring can balance the load on the nodes efficiently and meet the demands of the transmitting of large files on the large scale networks.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第11期23-25,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60577039)
天津市科技发展计划基金资助项目(05YFGZGX24200)
关键词
应用层组播
对等网
组通信
application level multicast
Peer-to-Peer
group communication
