[1]袁飞飞,汪芸.订阅/发布模式下多节点协同的数据分发方法[J].东南大学学报(自然科学版),2014,44(3):517-521.[doi:10.3969/j.issn.1001-0505.2014.03.012]
 Yuan Feifei,Wang Yun.Data distribution method based on multi-node cooperation in subscribe/publish model[J].Journal of Southeast University (Natural Science Edition),2014,44(3):517-521.[doi:10.3969/j.issn.1001-0505.2014.03.012]
点击复制

订阅/发布模式下多节点协同的数据分发方法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
44
期数:
2014年第3期
页码:
517-521
栏目:
计算机科学与工程
出版日期:
2014-05-16

文章信息/Info

Title:
Data distribution method based on multi-node cooperation in subscribe/publish model
作者:
袁飞飞汪芸
东南大学计算机科学与工程学院, 南京211189; 东南大学计算机网络和信息集成教育部重点实验室, 南京211189
Author(s):
Yuan Feifei Wang Yun
School of Computer Science and Engineering, Southeast University, Nanjing 211189, China
Key Laboratory of Computer Network and Information Integration of Ministry of Education, Southeast University, Nanjing 211189, China
关键词:
订阅/发布 大数据量内容 数据分发 多节点协同
Keywords:
subscribe/publish bulk content data distribution multi-node cooperation
分类号:
TP393
DOI:
10.3969/j.issn.1001-0505.2014.03.012
摘要:
为了提高分布对称体系结构的订阅/发布系统对大数据量内容的分发效率,提出了一种基于订阅节点协同的数据分发方法.首先,利用MD5算法将订阅节点映射到32 bit逻辑地址空间中;然后依据订阅者与发布者间的逻辑距离所处区间,将订阅节点集合划分成独立不相交的桶,为主题数据的转发规划出合理的路径,且该数据分发路径能适应系统的动态变化.基于逻辑距离的桶分割方法确保了数据分发的单向收敛性,限制了分发路径的深度.真实环境中的实验结果表明,基于订阅节点协同的分发方式通过利用订阅节点的资源,降低了对GB级数据量内容进行分发的分发时延,减轻了发布节点的负载,与传统的点对点分发方式相比,数据分发效率得到了显著提高.
Abstract:
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 algorithm 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 generated. The unidirectional convergence of data distribution and the limited depth of the route are guaranteed 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 outperforms the traditional point-to-point distribution strategy in distribution efficiency.

参考文献/References:

[1] Kazemzadeh R S, Jacobsen H A. Publiy+: a peer-assisted publish/subscribe service for timely dissemination of bulk content[C]//Proceedings of 2012 IEEE International Conference on Distributed Computing Systems. Macau, China, 2012: 345-354.
[2] Banavar G, Chandra T, Mukherjee B, et al. An efficient multicast protocol for content-based publish-subscribe systems[C]//Proceedings of 1999 IEEE International Conference on Distributed Computing Systems. Austin, TX, USA, 1999: 262-272.
[3] Boyd S, Ghosh A, Prabhakar B, et al. Gossip algorithms: design, analysis and applications[C]//Proceedings of 2005 IEEE Annual Joint Conference of the IEEE Computer and Communications Societies. Miami, FL, USA, 2005: 1653-1664.
[4] 刘翠平,戴佩华,徐晓丽. 发布/订阅系统中的新型组播树构造算法研究[J]. 网络安全技术与应用,2009(7): 62-64.
  Liu Cuiping, Dai Peihua, Xu Xiaoli. Research on the new multicast tree construction algorithm in publish/subscribe systems[J]. Network Security Technology & Applications, 2009(7):62-64.(in Chinese)
[5] Fateri S, Ni Q, Taylor G A, et al. Design and analysis of multicast-based publisher/subscriber models over wireless platforms for smart grid communications[C]//Proceedings of 2012 IEEE International Conference on Trust, Security and Privacy in Computing and Communications. Liverpool, UK, 2012: 1617-1623.
[6] Cui J Q, Xiong N X, Park J H, et al. A novel and efficient source-path discovery and maintenance method for application layer multicast[J]. Computers & Electrical Engineering, 2012, 39(1): 67-75.
[7] 蒋海,李军,李忠诚.混合内容分发网络及其性能分析模型[J]. 计算机学报,2009, 32(3): 473-482.
  Jiang Hai, Li Jun, Li Zhongcheng. Hybrid content distribution network and its performance modeling[J]. Chinese Journal of Computers, 2009, 32(3): 473-482.(in Chinese)
[8] Castro M, Druschel P, Kermarrec A M, et al. SCRIBE: a large-scale and decentralized application-level multicast infrastructure[J]. IEEE Journal on Selected Areas in Communications, 2002, 20(8): 1489-1499.
[9] 沈燕玉,王泽洪,李围宾.基于结构化 P2P 的发布订阅系统[J].计算机系统应用,2012,21(2):130-134.
  Shen Yanyu, Wang Zehong, Li Weibin. Publish-subscribe system based on structural P2P[J]. Computer Systems & Applications, 2012, 21(2):130-134.(in Chinese)
[10] Stoica I, Morris R, Karger D, et al. Chord: a scalable peer-to-peer lookup service for internet applications[J]. ACM SIGCOMM Computer Communication Review, 2001, 31(4): 149-160.

备注/Memo

备注/Memo:
收稿日期: 2013-11-15.
作者简介: 袁飞飞(1988—),男,硕士生;汪芸(1967—),女,博士,教授,博士生导师,yunwang@seu.edu.cn.
引用本文: 袁飞飞,汪芸.订阅/发布模式下多节点协同的数据分发方法[J].东南大学学报:自然科学版,2014,44(3):517-521. [doi:10.3969/j.issn.1001-0505.2014.03.012]
更新日期/Last Update: 2014-05-20