Non-hybrid ant colony routing method in content centric networking

Abstract

The invention relates to the technical field of communication, and particularly relates to a non-hybrid ant colony routing method in content centric networking. The method comprises the steps of building pheromone tables, wherein each node stores a pheromone table, when a previous ant arrives at a certain node, a port related to a current ant has a corresponding pheromone value, and a port not related to the current ant has no pheromone value; forwarding the previous ant from a source node to an intermediate node, and forwarding the previous ant to other intermediate node by the intermediate node till highest routing hops are achieved or a destination node is found; if the highest routing hops are achieved, executing a pheromone volatile operation; and if the previous ant rinds the destination node, generating a next ant by the destination node, and allowing the next ant to return from the destination node along the forwarding path of the previous ant to the source node and update pheromones of the node passed by. The method keeps the network overhead cost low and prevents premature and stagnation effectively.

Description

technical field [0001] The invention relates to the field of communication technology, in particular to a non-hybrid ant colony routing method in a content-centric network. Background technique [0002] With the rapid development of the web, the use of the web today has been dominated by the distribution and retrieval of content, while the network technology is still the communication between the host connections. Accessing content and services requires mapping what the user cares about to where the network is. In this context, Content Centric Networking (CCN) was born as a revolutionary future Internet, making data content itself the main unit of network communication, replacing IP with named data in the middle layer, and using " The "publish-request-response" mode, which is directly routed by the content name, has become a research hotspot of the next generation Internet architecture. [0003] In the content-centric network, a problem worth studying is how to optimize th...

AI Technical Summary

Problems solved by technology

[0005] However, the above hybrid ant colony optimization routing algorithm has many shortcomings: because the selection of exploration ants is random and the exploration probability of a fixed size is used to avoid premature stagnation, the exploration ability of the ant colony is constant and cannot change with the state of the network. change; secondly, its convergence quality is average, and an excessive number of forward ants are generated during the execution of the algorithm, which increases the burden on the entire network; more importantly, the lifetime of the node cache is ignored, once the cache expires, Then the optimal path chosen will be invalid

Images