首页 | 本学科首页   官方微博 | 高级检索  
     

带约束的多插路由算法
引用本文:刘莹 刘玮 等. 带约束的多插路由算法[J]. 西安电子科技大学学报(自然科学版), 2001, 28(4): 512-516
作者姓名:刘莹 刘玮 等
作者单位:[1]西安电子科技大学理学院,陕西西安710071 [2]装备指挥技术学院,北京101416
基金项目:国家自然科学基金资助项目(69972036)
摘    要:由于网络节点处理信息的能力不同,有些节点并不具备多播能力,为保证网络速度和节点负载平衡,应限制有些节点的多播能力,为此用节点的度约束来表示节点不同的多播能力,研究了带度约束且时延受限的多播路由问题,提出解决此问题的Lagrange松驰法。

关 键 词:多播路由算法 通信网 度约束
文章编号:1001-2400(2001)04-0512-04
修稿时间:2000-08-22

A constrained multicast routing algorithm
LIU Ying,LIU Wei,LIU San-yang. A constrained multicast routing algorithm[J]. Journal of Xidian University, 2001, 28(4): 512-516
Authors:LIU Ying  LIU Wei  LIU San-yang
Affiliation:LIU Ying1,LIU Wei2,LIU San-yang1
Abstract:By multicasting is meant the sending of the same message from a source node to multiple detination nodes. The multicast routing algorithm aims to determine the minimal cost multicast route. Due to the fact that users require the improvement of the QoS of the services, multicasting must consider many constraints. Fisrt in networks some nodes do not have the multicasting ability, and some nodes should limit their multicast ability for load balance and network speed. We use the degree of the node in this paper to represent its multicasting ability. Furthermore many applications in networks require that the accumulated delay from the source node to every destination node not exceed a pre-specified delay bound. In this paper the multicast routing with degree and delay constraints is proposed, and a Lagrange relaxation method is used to solve this problem.
Keywords:multicast routing  degree-constraint  delay-constraint  Lagrange relaxation method
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《西安电子科技大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《西安电子科技大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号