基于关键结点和遗传操作的最小代价组播算法

Minimum Cost Multicast Algorithm Based on Key Nodes and Genetic Operator

提出了基于关键结点的最小代价组播路由算法,算法利用整数规划的思想在网络中找出k个代价最小的结点;通过特定策略将这k个结点构成一棵树,然后采用遗传操作将不在树上的成员结点加入到树上,最后剪去非成员的叶结点形成最小代价组播树.该算法可靠性高,能够有效满足实时应用的需求.

A minimum cost multicast routing a choose k minimum cost nodes in a network by tree by particular strategy and add member no lgorithm integra des to t is presented based on key nodes; this algorithm firstly programming idea. Secondly, make k key nodes into a his tree on the genetic operator, then cut the non-member leaf nodes to form the minimum cost multicast tree. Finally, it conducts an emulation experiment. The experiment shows that this algorithm is more reliable than other algorithms, and sufficiently satisfies the real time capability. When a network is larger, this algorithm can greatly reduce the time of routing computation.