基于P2P架构的组播树研究  

Study on multicast tree based on P2P

作　　者：金玉镯[1] 沈文轩[1] 

机构地区：[1]辽宁科技大学计算机科学与工程学院,辽宁鞍山114044

出　　处：《计算机工程与设计》2007年第17期4155-4157,共3页Computer Engineering and Design

基　　金：辽宁省教育厅科研基金项目(105L011)

摘　　要：网络中的对等点首先聚类成簇,然后再形成组播树。该组播树是对NICE中组播树的改进,易于利用JXTA技术实现,是一种有效的应用于P2P网络结构的组播树,克服了传统组播树中存在扩展性不好和维护代价高的问题,并可在大范围P2P环境中得到应用推广。Multicast tree is design when peers have assembled into clusters in Intemet. This multicast tree is improved upon it that is designed in NICE. It is easily to develop using JXTA, and it is an efficient multicast tree which can apply to P2P architecture. It has overcome so many problems such as bad resilience, high cast for maintenance, so it can have extensive use in P2P environment.

关 键 词：组播树 对等网 服务质量 流媒体 分布式计算 

分 类 号：TP37[自动化与计算机技术—计算机系统结构]