An Efficient Content Location Algorithm for CDN based on Distributed Construction of Search Tree from Contents of Proximal Nodes

摘要

One of the most important issues in Content Distribution Networks (CDN) is the algorithm for search- ing the contents. The existing distributed content location systems for CDNs are either dependent upon inefficient flooding techniques or on methods imposing a restriction on content placement algorithms. In this paper, we pro- pose an efficient content location algorithm for CDNs based on distributed construction of search tree using the contents of proximal nodes. One of the important characteristics of our algorithm is its independence on the content placement algorithm. We describe our algorithm, compare it with the existing content location algorithms and show its effectiveness in increasing the success rate of queries while maintaing the traffic generated very low.