摘要

By combining port set with adaptive forwarding strategy, an ant colony algorithm based on hierarchical distribution uniformity was proposed. Through perceiving routing pheromone, the optimal path was selected. At the same time, the algorithm was optimized by considering both convergence time and precision. Simulation results show that the algorithm has better performance in terms of the delay of content request and node load balance.

全文