Abstract:

In order to solve the problem of resource location in content delivery networks, a new algorithm for selecting optimal service nodes is proposed. The algorithm provides a good solution for both service performance and overhead. First, by taking advantage of the network coordinates approach, the computation and communication overhead of different service nodes are computed depending on network and server status change. Then, based on the hierarchical clustering algorithm, all the service nodes are reorganized in the coordinate space. Finally, the user requests are adaptively redirected to the service nodes with minimum overhead without sacrificing the service performance. Experiments verified that the precision of resource location is improved and the overhead is reduced with acceptable time performance by the new algorithm.

Key words: content delivery network, resource location, hierarchical clustering, network coordinate