延时受限的选播QoS路由算法的设计与仿真

Design and Simulation of Delay-constrained Anycast QoS Routing Al gorithm

选播是一种新型的网络服务,它使用户通过一个选播地址就能访问到该地址所表示的一组服务器中对用户来说“最近”的一个。在实时性要求较高的业务传输过程中,保证信息传输延时尽可能小是非常重要的。该文研究延时受限的选播路由问题,提出了一种改进的遗传算法以求解该问题。仿真实验结果表明,该算法是有效和切实可行的。

Anycast is a new network service.With anycast service,a client can reach the most appropriate one of the servers that accept datagram for the anycast address.In most applications that require real-time transmission,it is very important to guarantee end-to-end performance.An improved anycast routing algorithm based on genetic algorithm to solve delay -constrained problem is proposed in this paper.Simulation results show that the algorithm has a better performance.