%0 Journal Article
%T Self-adaptive Lagrange relaxation algorithm for aggregated multicast<br>解决聚合组播的自适应拉格朗日松弛算法
%A GE Zu-quan
%A WANG Hua
%A MA Jun
%A <br>葛祖全
%A 王华
%A 马军
%J 计算机应用
%D 2007
%I 
%X Multicast has great advantages in data forwarding. But the number of forwarding states becomes huge in routers when there are a large number of multicast groups in the network, which may cause explosions of state information and control information. Aggregated multicast is a new approach to reduce the number of multicast state. It enables multicast groups to share a single distribution tree so that the tree management overhead at core routers can be reduced. Aggregated Multicast can actually be attributed to minimal set cover problem, which is an NP-complete problem. A self-adaptive Lagrange Relaxation Algorithm that can achieve global optimal solution was used to solve it. Simulation results show that this algorithm is better than the conventional greedy algorithm in that it improves aggregation degree and reduces multicast state number.
%K aggregated multicast
%K minimal set cover
%K Lagrange relaxation
%K Lagrange multiplier<br>聚合组播
%K 最小集合覆盖
%K 拉格朗日松弛
%K 拉格朗日乘子
%K 聚合组播
%K 自适应
%K 拉格朗日松弛算法
%K multicast
%K relaxation
%K algorithm
%K 组播转发状态
%K 聚合度
%K 全局最优解
%K 贪婪算法
%K 集合覆盖问题
%K 最小
%K 问题实质
%K 路由器
%K 核心
%K 组播树
%K 分布树
%K 方法
%K 控制开销
%K 资源
%K 消耗
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=14E16CBD274305122844F73692AF72A1&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=E158A972A605785F&sid=A9C78B2A6AAEEAAD&eid=FCB110411B6339D8&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=13