Routing Algorithm Research In Information-Centric-Networking

The existing networking architecture based on the TCP/IP protocols is facing with many problems,such as network control,resource allocation,safety and mobility.Related scholars in the future network domain have proposed to build the information centric network architecture.Among them,Content-Centric Networking(CCN)has gradually become a research hotspot.CCN has fundamentally changed the structure of packet encapsulation and addressing mode.It depends on the content but not IP while transmitting the data,and simultaneously introduces real-time caching function and content-based security assurance mechanism,which effectively improves the transmission capacity and security of the network.Based on the basic routing forwarding model of content centric networking,this paper makes an exploratory study on routing algorithm,ant colony optimization strategy and node cache utilization,and provides reference for the following research.Firstly,this paper summarizes the basic concepts of content centric networking,and analyzes the CCN routing mechanism,emphasizing the application principle of ant colony algorithm in route optimization.At the same time,aiming at the deficiency of the existing CCN route optimization,strategy in algorithm astringency and network cache utilization,this paper proposes a polymorphic ant colony route algorithm based on neighborhood cooperation(NC-PAC).NC-PAC algorithm modified the pheromone table and forwarding rules of ant colony routing,and adjusts the astringency speed accordance with the discrete dynamics of pheromone of forwarding interface list.The content is classified according to the popularity,and performing a differentiated neighborhood cache discovery for clients' requirements to improve the utilization of caches outside the path.The simulation results show that the proposed algorithm can effectively increases the utilization efficiency of node cache and improves the overall performance of the network.Secondly,in order to reduce the network consumption of the hybrid ant colony optimization algorithm,this paper proposes a non-hybrid ant colony routing optimization algorithm(IAF).IAF provides a new dimension for ACO mechanism,and extends the classical and single pheromone as dynamic multi-level pheromone model.At the same time,a new pheromone updating formula is proposed,considering the influence of node caching performance on pheromone updating strategy.The non-hybrid framework improves the astringency performance of ant colony optimization and the overall routing performance of CCN network.The simulation results show,when compared with other ant colony routing algorithms,the proposed algorithm can effectively reduce the cost and improve the network content distribution performance.Finally,this paper summarizes the whole work and prospects the next research.