Research On De Bruijn Graph Based Routing Of Peer-to-peer Network

Peer-to-Peer network is a combination of distributed system and computer network,and a computer network which adopts work of upsides mode. In P2P network,every node has free behavior,equal function and interacting interlinkage,and all node make up of a network by self-organizable manner. Because P2P network has advantage of high resource utilizing rate,good expansibility,strong dynamic and haleness,it has wide future.In P2P network,Design of routing model directly influences capability of P2P network,and research of routing model is very importance for P2P network development. In contrast with other routing model, structured P2P network can exact,fast route message and locate data object by Distributed Hash Table,so structured routing model become a very import content of P2P network research.This paper present a de Bruijn graph based routing model of P2P network,adopting de Bruijn graph by way of P2P overlay topology structure, every node of network with responsibility for maintaining an area of virtual 2-dimension Descartes coordinate space,accomplishing model's naming and distributing of data,neighbor relation of node,routing arithmetic,issuance of data,join and quit of node. Through experimenting emulation and analyzing data,it can see that node degree,load balance and routing path length of routing model are improved.