| 一种高稳定性低延迟的应用层组播生成树算法 |
| |
| 引用本文： | 崔建群,陈爱玲,夏振厂,吴黎兵.一种高稳定性低延迟的应用层组播生成树算法[J].计算机科学,2016,43(6):77-81. |
| |
| 作者姓名： | 崔建群 陈爱玲 夏振厂 吴黎兵 |
| |
| 作者单位： | 华中师范大学计算机学院 武汉430079,华中师范大学计算机学院 武汉430079,华中师范大学计算机学院 武汉430079,武汉大学计算机学院 武汉430079 |
| |
| 基金项目： | 本文受国家自然科学基金面上项目(61170017,61272112,61370108),湖北省科技支撑计划(2013BAA004)资助 |
| |
| 摘 要： | 由于应用层组播技术依靠终端主机转发组播数据,任意中间节点的退出都将造成系统的稳定性问题。同时,应用层组播技术对延时有严格的要求。为了提高应用层组播系统的稳定性和数据传输效率,根据影响应用层组播稳定性和延时的因素,抽象出基于节点稳定概率的度约束的最小延时应用层组播生成树问题模型SDMD (Spanning tree based on stability probability,degree-constrained,and minimum diameter for ALM),并且证明了该问题属于NP-hard问题。为了解决该问题,给出了基于节点时间增益因子的TG-S近似算法。仿真实验表明,TG-S算法生成的组播树在平均延时、最大延时和累积中断次数等方面有明显优势。
|
| 关 键 词： | 应用层组播 稳定性 最小延时 NP-hard 时间增益因子 |
| 收稿时间： | 2015/6/23 0:00:00 |
| 修稿时间： | 9/2/2015 12:00:00 AM |
High Stability Low Delay Spanning Tree Algorithm for Application Layer Multicast |
| |
| CUI Jian-qun,CHEN Ai-ling,XIA Zhen-chang and WU Li-bing.High Stability Low Delay Spanning Tree Algorithm for Application Layer Multicast[J].Computer Science,2016,43(6):77-81. |
| |
| Authors: | CUI Jian-qun CHEN Ai-ling XIA Zhen-chang and WU Li-bing |
| |
| Affiliation: | School of Computer Science,Central China Normal University,Wuhan 430079,China,School of Computer Science,Central China Normal University,Wuhan 430079,China,School of Computer Science,Central China Normal University,Wuhan 430079,China and School of Computer Science,Wuhan University,Wuhan 430079,China |
| |
| Abstract: | 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-Swas 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. |
| |
| Keywords: | Application layer multicast Stability Minimum delay NP-hard Time gaining |
|
|
点击此处可从《计算机科学》下载全文 |
|
