Tier_Flat:P2P网络并行模拟器(HiFiP2P)的一种路由算法  

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

作　　者：余传亮[1] 张宏莉[1] 杨贤清[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《高技术通讯》2010年第9期899-904,共6页Chinese High Technology Letters

基　　金：973计划(2007CB311101);新世纪优秀人才计划(NCEF07-0245)资助项目

摘　　要：为了给P2P网络并行模拟器HiFiP2P提供正确高效的路由,使其能够高效地执行大规模P2P网络并行模拟,基于互联网中的层次路由模型和Flat本地静态路由计算和查找算法,采取边界路由最小化的并行网络拓扑划分机制,设计了Tier_Flat路由算法,用以实现HiFiP2P的远程和本地静态路由,它以最低O((N^4)^(1/3))的空间开销,取得了O(1)的查找效率。结果表明,Tier_Flat路由算法路由计算时间短,路由表内存占用小,路由查询速度快,为HiFiP2P平台的大规模P2P网络并行模拟提供了高效的路由服务。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 （3√N4） 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.

关 键 词：并行模拟 HiFiP2P 网络拓扑划分 Tier_Flat路由算法 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]