Balance address tree topology for P2P network

Author

Zhen Luo ; Zhishu Li ; Biao Cai

Author_Institution

Sch. of Comput. Sci., Sichuan Univ., Chengdu, China

Volume

6

fYear

2010

fDate

9-11 July 2010

Firstpage

83

Lastpage

87

Abstract

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.

Keywords

optimisation; peer-to-peer computing; telecommunication network routing; telecommunication network topology; trees (mathematics); DHT based optimization; IP address; P2P network routing; balance address tree topology; jump over hops routing; trust management; Computational modeling; Educational institutions; Optimized production technology; BAT; JoH; P2P;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on

Conference_Location

Chengdu

Print_ISBN

978-1-4244-5537-9

Type

conf

DOI

10.1109/ICCSIT.2010.5563591

Filename

5563591