| 有时延及时延差别约束的最小代价组播路由问题 |
| |
| 引用本文： | 郭伟,席裕庚.有时延及时延差别约束的最小代价组播路由问题[J].通信学报,2001,22(6):13-20. |
| |
| 作者姓名： | 郭伟 席裕庚 |
| |
| 作者单位： | 上海交通大学自动化研究所, |
| |
| 基金项目： | 国家973计划基金资助项目(G1998030415) |
| |
| 摘 要： | 本文把有时延、时延差别约束的组播路由问题提到优化的层次上，提出了有时延、时延差别约束的最小代价组播路由优化问题，并证明此问题是NP－complete问题。继而提出了一种基于动态罚函数法的启发式遗传算法以及解该问题，并分析了算法的复杂度。仿真表明，本文算法是有效的、稳定的。在满足两种约束的情况下，能够使网络代价优化。
|
| 关 键 词： | 时延 时延差别 组播路由 遗传算法 动态罚函数 多媒体通信 |
| 文章编号： | 1000-436(2001)06-0013-08 |
| 修稿时间： | 2000年1月12日 |
Minimal cost multicast routing problem with end-to-end delay and delay variation constraints |
| |
| GUO Wei,XI Yu geng.Minimal cost multicast routing problem with end-to-end delay and delay variation constraints[J].Journal on Communications,2001,22(6):13-20. |
| |
| Authors: | GUO Wei XI Yu geng |
| |
| Abstract: | For the multicast routing problem with end to end delay and delay variation constraints,this paper puts forward the optimization concept,defining the minimal cost multicast routing optimization problem with end to end delay and delay variation constraints,and establishes that the problem is NP Complete Then a heuristic genetic algorithm based on dynamic penalty function method is provided to solve the problem,and the algorithm complexity is analyzed Simulations show that the algorithm is effective and stable It can minimize the network cost without violating the two constraints |
| |
| Keywords: | end to end delay delay viariation multicast routing genetic algorithm dynamic penalty function |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
