为了提高网络路由性能,提出并设计了一种基于遗传-蚁群优化算法的服务质量(quality of service,QoS)组播路由算法。首先,设计了自适应变频采集策略用于采集网络与节点信息,以此获得网络和节点的状态,为后续路由优化提供数据支持;其次,...为了提高网络路由性能,提出并设计了一种基于遗传-蚁群优化算法的服务质量(quality of service,QoS)组播路由算法。首先,设计了自适应变频采集策略用于采集网络与节点信息,以此获得网络和节点的状态,为后续路由优化提供数据支持;其次,计算路径代价,将路径代价最小作为优化目标,建立QoS组播路由优化模型,并设置相关约束条件;最后,结合遗传算法和蚁群算法提出一种遗传-蚁群优化算法求解上述模型,输出最优路径,完成路由优化。实验结果表明,所提算法可有效降低路径长度与路径代价,提高搜索效率与路由请求成功率,优化后的路由时延抖动较小。展开更多
Multicasting is a communication service that allows an application to efficiently transmit copies of data packets to a set of destination nodes. The problem of finding a minimum cost multicast tree can be formulated a...Multicasting is a communication service that allows an application to efficiently transmit copies of data packets to a set of destination nodes. The problem of finding a minimum cost multicast tree can be formulated as a minimum Steiner tree problem in networks, which is NP-completeness. MPH (minimum path cost heuristic) algorithm is a famous solution to this problem. In this paper, we present a novel solution TPMPH (two phase minimum path cost heuristic) to improve the MPH by generating the nodes and the edges of multicast tree separately. The cost of multicast tree generated by the proposed algorithm with the same time as MPH is no more than that of MPH in the worst case. Extensive simulation results show that TPMPH can effectively improve the performance on MPH, and performs better in large-scale networks and wireless networks.展开更多
文摘为了提高网络路由性能,提出并设计了一种基于遗传-蚁群优化算法的服务质量(quality of service,QoS)组播路由算法。首先,设计了自适应变频采集策略用于采集网络与节点信息,以此获得网络和节点的状态,为后续路由优化提供数据支持;其次,计算路径代价,将路径代价最小作为优化目标,建立QoS组播路由优化模型,并设置相关约束条件;最后,结合遗传算法和蚁群算法提出一种遗传-蚁群优化算法求解上述模型,输出最优路径,完成路由优化。实验结果表明,所提算法可有效降低路径长度与路径代价,提高搜索效率与路由请求成功率,优化后的路由时延抖动较小。
文摘Multicasting is a communication service that allows an application to efficiently transmit copies of data packets to a set of destination nodes. The problem of finding a minimum cost multicast tree can be formulated as a minimum Steiner tree problem in networks, which is NP-completeness. MPH (minimum path cost heuristic) algorithm is a famous solution to this problem. In this paper, we present a novel solution TPMPH (two phase minimum path cost heuristic) to improve the MPH by generating the nodes and the edges of multicast tree separately. The cost of multicast tree generated by the proposed algorithm with the same time as MPH is no more than that of MPH in the worst case. Extensive simulation results show that TPMPH can effectively improve the performance on MPH, and performs better in large-scale networks and wireless networks.
