Tier_Flat: a routing algorithm for HiFiP2P, a kind of P2P network parallel simulator

In order to provide correct and efficient routing for the HiFiP2P, a parallel high fidelity P2P simulator, to enable it to efficiently carry out scalable P2P network parallel simulations, the paper adopts the parallel network topology partition mechanism of minimizing the border routing, and brings forward the Tier_Flat routing algorithm based on the hierarchical routing model of Internet and the local static route computation and lookup algorithm (called Flat), for implementing the remote and local static routing of the HiFiP2P. It can achieve the search efficiency of O(1) time complexity at the cost of the minimal O(³√N⁴) storage space complexity. The results of the study show that the Tier_Flat algorithm has the advantages of short routing computing time, small memory occupation in route table and efficient query. It provides efficient routing service for scalable P2P network parallel simulations on the HiFiP2P platform.