Content routing algorithms achieving network proximity in content delivery networks
Wendao Zhao · 2004
The traditional load balancing technology only considers the server load to redirect the user request, which cannot assure the performance of the response to the user. One improved method was the content routing algorithms achieving network proximity , which can redirect the user request to the best server according to network distance such as network delay, hops, topology distance etc. The simplest content routing algorithms achieving network proximity was to redirect the user request according to the measurement of the distance between the servers and the request user. But the algorithm consumes much time. An improved method is the content routing algorithm based on network topology segmentation. The study results indicate that the method can achieve similar performance as the simplest algorithm but can reduce the routing time obviously.