首页 | 本学科首页   官方微博 | 高级检索  
     

一种P2P MMOG兴趣域内多播节点加入算法
引用本文:石祥滨,邢元胜,王谦,杜玲.一种P2P MMOG兴趣域内多播节点加入算法[J].小型微型计算机系统,2006,27(4):623-626.
作者姓名:石祥滨  邢元胜  王谦  杜玲
作者单位:1. 辽宁大学,信息科学与技术学院,辽宁,沈阳,110036
2. 中国科学院,沈阳计算技术研究所,辽宁,沈阳,110004
摘    要:在基于Pastry的Scribe多播模型上增加了度约束条件,并提出了相应的异构网络应用层的多播加入算法,最后给出了减少非-DHT连接数目的方法.实验结果表明该算法在减少非-DHT连接数量和降低树的加权半径方面相对于其它相关算法有了较大的改进.

关 键 词:对等网  应用层多播
文章编号:1000-1220(2006)04-0623-04
收稿时间:2005-05-10
修稿时间:2005-05-10

AOI Node Joining Algorithm for P2P MMOG Multicast
SHI Xiang-bin,XING Yuan-sheng,WANG Qian,DU Ling.AOI Node Joining Algorithm for P2P MMOG Multicast[J].Mini-micro Systems,2006,27(4):623-626.
Authors:SHI Xiang-bin  XING Yuan-sheng  WANG Qian  DU Ling
Affiliation:1.Information Science and Technology Institute of Liaoning University, Shenyang 110036 , China; 2 Shenyang Institute of Computing Technology,Chinese Academy of Sciences , Shenyang 110004, China
Abstract:This paper discusses a degree-constrained multicast model on scribe based on pastry, and proposes an AOI node joining algorithm for the corresponding ALM in heterogeneous networks, as well as a way to decline the number of non-DHT links. The simulation results show that the algorithm gains a greater improvement than other corresponding algorithms on reducing non-DHT links and the weighted radius of multicast tree.
Keywords:MMOG
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号