摘要
由于应用层组播技术依靠终端主机转发组播数据,任意中间节点的退出都将造成系统的稳定性问题。同时,应用层组播技术对延时有严格的要求。为了提高应用层组播系统的稳定性和数据传输效率,根据影响应用层组播稳定性和延时的因素,抽象出基于节点稳定概率的度约束的最小延时应用层组播生成树问题模型SDMD(Spanning tree based on stability probability,degree-constrained,and minimum diameter for ALM),并且证明了该问题属于NP-hard问题。为了解决该问题,给出了基于节点时间增益因子的TG-S近似算法。仿真实验表明,TG-S算法生成的组播树在平均延时、最大延时和累积中断次数等方面有明显优势。
Since application layer multicast（ALM） relies on terminal hosts to forward multicast data, any intermediate node fails or quits would result in the system stability problem. Meanwhile, ALM has strict requirement for multicast tree delay. To improve stability and data transmission efficiency, this paper introduced a Spanning tree problem model SDMD based on stability probability, degree-constrained, and minimum diameter for ALM, according to the influencing factor of ALM stability and delay. The SDMD problem was proved to be NP-hard and an approximation algorithm TG-S was proposed to solve it. The simulation result demonstrates the advantages of TG-S algorithm in average receiving delay,multicast tree delay and accumulative interrupt times.
出处
《计算机科学》
CSCD
北大核心
2016年第6期77-81,共5页
Computer Science
基金
国家自然科学基金面上项目(61170017
61272112
61370108)
湖北省科技支撑计划(2013BAA004)资助
