异构网络环境下的高稳定性应用层组播方案

针对异构网络环境中由于节点转发能力异构而引起的应用层组播稳定性不足的问题,对异构overlay拓扑建模进行了研究,分析出组播稳定所需满足的约束条件,提出了一种基于gossip协作机制的应用层组播方案。在所提机制能够均衡节点间负载,缓解能力弱的节点负载过重的问题;如果组播过程中有成员节点动态离开或转发能力不足,其他节点相互协作共同分担其负载以维持组播的稳定性。随后的链路强度分析表明,与传统的应用层组播方案相比,方案能够大幅降低拓扑的平均链路强度,提高组播系统的稳定性。通过OMNeT++仿真平台对本方案进行仿真验证,实验证明在动态的异构overlay拓扑下,方案能够显著提高数据分发成功率,保证组播...

Full description

Saved in:
Bibliographic Details
Published in计算机应用研究 Vol. 33; no. 1; pp. 165 - 170
Main Author 王俊义 魏延恒 符杰林 郑霖
Format Journal Article
LanguageChinese
Published 桂林电子科技大学广西信息科学实验中心,广西 桂林 541004 2016
桂林电子科技大学认知无线电与信息处理教育部重点实验室,广西 桂林 541004
Subjects
Online AccessGet full text
ISSN1001-3695
DOI10.3969/j.issn.1001-3695.2016.01.038

Cover

More Information
Summary:针对异构网络环境中由于节点转发能力异构而引起的应用层组播稳定性不足的问题,对异构overlay拓扑建模进行了研究,分析出组播稳定所需满足的约束条件,提出了一种基于gossip协作机制的应用层组播方案。在所提机制能够均衡节点间负载,缓解能力弱的节点负载过重的问题;如果组播过程中有成员节点动态离开或转发能力不足,其他节点相互协作共同分担其负载以维持组播的稳定性。随后的链路强度分析表明,与传统的应用层组播方案相比,方案能够大幅降低拓扑的平均链路强度,提高组播系统的稳定性。通过OMNeT++仿真平台对本方案进行仿真验证,实验证明在动态的异构overlay拓扑下,方案能够显著提高数据分发成功率,保证组播的连续性和稳定性。
Bibliography:51-1196/TP
application layer multicast; overlay network; gossip algorithm; heterogeneous network; load balancing
In order to solve the problem of poor stability of application layer multicast in the dynamic and heterogeneous net- work environment, this paper researched the application layer multicast in the heterogeneous overlay topology and worked out the constraint condition of the stable multicast. Then it proposed a highly stable application layer muhicast scheme which was based on cooperatiw~ gossip forwarding scheme. The loads of different nodes were more balanced via the gossip algorithm and nodes with different capabilities cooperate together to maintain the stable distribution of the multicast data. Simulation experi- ments under the OMNeT + + framework show that the proposed scheme improves the success rate of data distribution and guar- antees the stability and consecutiveness of the muhicast system.
Wang Junyi, Wei Yanheng, Fu Jielin, Zheng Lin( a. Guangxi Information Science Experiment Center, b., K
ISSN:1001-3695
DOI:10.3969/j.issn.1001-3695.2016.01.038