摘要
选播是一种新型的网络服务,它使用户通过选播地址就能访问到该地址所表示的一组服务器,而传输的实时性要求传输时延尽可能的小。文章针对这种有时延约束的选播QoS路由问题,提出了一种改进的遗传算法以求解该问题。仿真实验表明,该算法是可行且有效的。
Anycast is a new network service. With anycast service, a client can have access to a set of services through anycast address. In most cases that real-time transmission required, it is very important to guarantee end-to-end performance. This paper presents a heuristic genetic algorithmic to solve shortest path routing optimization problem. Simulation results show that the algorithm has a better performance.
出处
《交通与计算机》
2005年第4期87-90,共4页
Computer and Communications
关键词
选播路由
遗传算法
时延约束
anycast routing
genetic algorithm
delay constraint
