Research And Implementation Of Protocol Based On Content Delivery Network

Along with the proposed Next-Generation Internet, many key technologies are increasingly common in the application, CDN(content delivery network) is one of the important components of them, Its purpose is to solve the overall Internet bandwidth and local surplus bandwidth shortage of contradictions.Content Delivery Network (CDN) is a layer of special network, which is built and covered on the Internet. It is devoted to delivering rich multimedia content effectively by Internet. CDN can release the content to the user's network which is closest to the user, users can obtain the required local content, improve the response time, CDN thus can improve the efficiency in the flow of information, technical comprehensive solution due to small network bandwidth, the user visits, such as uneven distribution network caused by "congestion" and enhance the users visit the Web site response time. This article CDN network to the core function of - for the routing of the study, theoretical analysis and computer simulation team CDN routing system based on the name of the routing technology for an in-depth study.Nowadays the application of CDN is at the mode of the central server which is still of some shortage. However, the content routing based on name is of strong pertinence and can resolve that problem. Firstly, this paper collected a lot of literature widely. Then the paper analysed the functional modules and the operational principle of the content routing which is based on name. And with the comparisons of two important protocols, this paper did a deep research on INRP and designed the functional modules. At last, the paper simulated and realized that under the lab environment. At the foundation of the realization of INRP, the paper researched the algorithm of content routing which was the important part to improve the response speed. This was the same with the traditional network, that the central router was asked to deliver several millions of the groups per second. However, the key to realize the high speed delivery is the algorithm of routing table's construction and high-speed lookup. The paper analyzed the existed algorithm of routing lookup, and improved it, then provided a new lookup algorithm based on hash and Trie tree. At last, the paper made a comparison with the typical Hash. The results indicated that the new algorithm could shorten the searching time and increased the efficiency of searching, and then improved the performance of the whole system.