期刊文献+

订阅/发布模式下多节点协同的数据分发方法 被引量:2

Data distribution method based on multi-node cooperation in subscribe /publish model
下载PDF
导出
摘要 为了提高分布对称体系结构的订阅/发布系统对大数据量内容的分发效率,提出了一种基于订阅节点协同的数据分发方法.首先,利用MD5算法将订阅节点映射到32 bit逻辑地址空间中;然后依据订阅者与发布者间的逻辑距离所处区间,将订阅节点集合划分成独立不相交的桶,为主题数据的转发规划出合理的路径,且该数据分发路径能适应系统的动态变化.基于逻辑距离的桶分割方法确保了数据分发的单向收敛性,限制了分发路径的深度.真实环境中的实验结果表明,基于订阅节点协同的分发方式通过利用订阅节点的资源,降低了对GB级数据量内容进行分发的分发时延,减轻了发布节点的负载,与传统的点对点分发方式相比,数据分发效率得到了显著提高. To improve the distribution efficiency of bulk content in the subscribe/publish system with symmetrical distributed architecture,a new distribution method based on multi-node cooperation is proposed.First,the subscribers are mapped to a 32 bit logical address space by the message-digest al-gorithm 5 (MD5 algorithm).Then,the sets of the subscribers are divided into independent disjoint buckets according to the intervals of the logical distances between the publisher and the subscribers. A proper route for data forwarding,which can adapt to the dynamic changes in the system,is gener-ated.The unidirectional convergence of data distribution and the limited depth of the route are guar-anteed by the bucket partitioning method based on the logical distance.The prototype experimental evaluation results show that the proposed method reduces subscribers' delay and publisher's load for the distribution of bulk content in GB size by exploiting subscribers'resources.This method outper-forms the traditional point-to-point distribution strategy in distribution efficiency.
作者 袁飞飞 汪芸
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2014年第3期517-521,共5页 Journal of Southeast University:Natural Science Edition
关键词 订阅 发布 大数据量内容 数据分发 多节点协同 subscribe/publish bulk content data distribution multi-node cooperation
  • 相关文献

参考文献4

二级参考文献43

  • 1马建刚,黄涛,汪锦岭,徐罡,叶丹.面向大规模分布式计算发布订阅系统核心技术[J].软件学报,2006,17(1):134-147. 被引量:128
  • 2Pallis G, Vakali A. Insight and perspectives for content delivery networks. Communications of the ACM, 2006, 49 (1) : 101-106.
  • 3Li Jin. On peer-to-peer (P2P) content delivery. Peer-to-Peer Networking and Applications, 2008, 1(1) : 45-63.
  • 4Gadde S, Chase J, Rabinovich M. Web caching and content distribution: A view from the interior. Computer Communications, 2001, 24(2).. 222-231.
  • 5Tim Wauters, Jan Coppens et al. Replica placement in ring based content delivery networks. Computer Communications, 2006, 29(16).. 3313-3326.
  • 6Shaikh A, Tewari R et al. On the effectiveness of DNS-based server selection//Proceedings of the IEEE INFOCOMM. Anchorage, AK, USA, 2001:1801-1810.
  • 7Fei Zong-Ming, Yang Meng-Kun. A segment-based finegrained peer sharing technique for delivering large media files in content distributed networks. IEEE Transactions on Multimedia, 2006, 8(4): 824-829.
  • 8Cahill Adrian J, Sreenan Cormae J. An efficient CDN placement algorithm for high-quality TV content//Proceedings of the 9th IASTED International Conference on Internet and Multimedia Systems and Applications (EurolMSA). Switzerland, 2005:364-369.
  • 9Day M, Cain B, Tomlinson Get al. A model for content internetworking (CDI). IETF RFC3466, 2003.
  • 10Stephanos Androutsellis-Theotokis, Diomidis Spinellis. A survey of peer-to-peer content distribution technologies. ACM Computing Surveys (CSUR), 2004, 36(4): 335-371.

共引文献21

同被引文献12

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部