Research On Content Distribution Algorithms For Internet

With the increase of Internet users, network access traffic has increased dramatically, making the server load increase and the local resources of the Internet are saturated. There are two ways to solve this problem: increasing server performance and content delivery technologies. Obviously content delivery technologies are the best way to solve this problem.The main idea of content delivery is to distribute the contents which are required by the users to the proxy servers which are close to the users, so that they can get the contents from the proxy servers directly when they want to access the contents instead of required the contents from the source servers reducing the load of source servers and the waste of bandwidth. There are three kinds of content delivery system: traditional C/S structure networks, content delivery networks and peer-to-peer networks.The problems which should be studied in content delivery systems can be divided into three types: content delivery, cache management and request routing. The content delivery problem including proxy server placement problem, content selected and content distribution. The cache management including cache content organization and management. Request routing is to redirect the user's request to a proxy server using load balancing technologies.In this paper, we studied content distribution problem and the main contents are below:(1) Introduce the composition and challenges of content delivery systems, and introduce several major issues which should be studied.(2) Introduce the research status of proxy server placement and content distribution problem, and the theoretical tools which are used when we studied the content distribution problem.(3) Studied the content distribution problem in the tree networks, and we solved this problem using dynamic programming method. The time complexity of our algorithms are ( ) where is the count of nodes and is the count of contents which should be deliveried.(4) Because the buffer space of the nodes in ICMANET are limited and the nodes do not have no ability to discovery route, the existing algorithms can not be used to solve the content distribution problem in ICMANET. In this paper, we model this problem firstly and then give greedy algorithms to solve this problem. Experimental results show that the performance of our algorithm is better than others.