.png){kind=icon}
返回
An effective algorithm for delay-constrained dynamic multicasting
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2005.10.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the development of multimedia group applications, the construction of multicast routing tree satisfying Quality of Service (QoS) is more important. In many multicast applications, it is required that the network supports dynamic multicast, which the membership of the multicast group changes with the time. In this paper an effective heuristic algorithm is proposed for dynamic multicast routing with delay-constrained. Aims of this proposed algorithm is to guarantee that: (1) the cost of multicast tree is as small as possible at each node addition/removal event, (2) all the maximal path delay is meet a fixed delay-constrained, (3) minimize perturbation to an existing tree. The proposed algorithm is based on 'damage' and 'usefulness' concept, and a Balancing Factor (BF) is provided to judge whether or not to arrange a region of tree. Mutation operation in Genetic Algorithm (GA) is also employed to find an attached node in tree for a dynamic adding node. Simulation shows that our algorithm performs well than those static heuristic algorithms in term of cost especially. (c) 2006 Elsevier B.V. All fights reserved.
Keyword:
multicast
delay constraint
network optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
Trends in Caribbean Paleoproductivity related to the Neogene closure of the Central American Seaway
PREAI
分享收藏Time to revisit red blood cell additive solutions and storage conditions:a role for "omics" analyses.png)
IF0
PREAI
分享收藏A sulfonated Schiff base dimethyltin(iv) coordination polymer: synthesis, characterization and application as a catalyst for ultrasound- or microwave-assisted Baeyer–Villiger oxidation under solvent-free conditionsRSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容