Balance Address Tree Topology for P2P Network
The trust accumulating of peer is a crucial problem of trust management in P2P network. which are long transit delay and high traffic cost of mismatch have been the most hot topics in P2P network effect study. Existing method main focus on DHT based optimizing or IP address or geographic location. In this paper, we proposed BAT(balance address tree) which is derived from b-tree to store logical information of peers, and physical level JoH(jump over hops) routing in BAT. The simulation experiments show that with our BAT and JoH, transit delay and traffic cost in P2P routing have a significant improvement compared with that of without them in P2P network routing
P2P BA T JoH
LUO Zhen LI Zhishu CAI Biao
School of Computer Science Sichuan University Chengdu, Sichuan P.R.China 610065 Network School Chengdu University of Technology Chengdu Sichuan P.R.China 610059
国际会议
成都
英文
83-87
2010-07-07(万方平台首次上网日期,不代表论文的发表时间)