支持延时约束的覆盖多播路由协议的研究  

Delay constraint supported overlay multicast routing protocol

作　　者：吴家皋[1,2] 杨音颖[1,2] 陈益新[1,2] 叶晓国[1,2] 

机构地区：[1]东南大学计算机科学与工程系,江苏南京210096 [2]计算机网络和信息集成教育部重点实验室,东南大学

出　　处：《通信学报》2005年第9期13-20,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(901040009);国家"973"重点基础研究发展计划基金资助项目(2003CB314801)

摘　　要：研究有度和延时约束的覆盖多播路由问题,提出了一个新的覆盖多播路由协议-延时受限的树协议(DBTP)。该协议采用分布式和树优先的策略,使多播组成员之间能自组织地构建一棵基于源的覆盖多播树。DBTP协议采用了一种新的启发式局部优化算法,通过调节启发因子,能灵活地在延时和代价之间进行折衷。仿真实验表明,无论在静态还是动态节点模型下,选择适当的启发参数,DBTP都能获得较高的节点接纳率。The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol （DBTP） was proposed. Adopted distributed and tree-first strategies, the protocol enabled members of a multicast group to self-organize into a sourced-based overlay multicast tree. DBTP used a new heuristic local optimum algorithm, which could make trade-off between delay and cost of the multicast tree by adjusting a heuristic parameter. The simulation result shows that DBTP can both achieve the admission rate of members highly under whether static or dynamic node model through choosing a proper value of the heuristic parameter.

关 键 词：覆盖多播 路由协议 启发式算法 延时约束 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]