A Delay-Constrained Anycast Routing Algorithm
Yan Chen · Computer Engineering and Science · 2006
Anycast is a new network service.With the 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.A delay-constrained anycast routing(DCAR) algorithm is proposed in this paper,and the algorithm can find the low-cost anycasting tree with delay constraints.Simulation results show that the algorithm has better performance.