Redundant De Bruijn graph based location and routing for large-scale peer-to-peer system

A fundamental problem in large peer-to-peer application is finding a routing method by which the user can efficiently locate the nodes those stores a particular data item. In this paper we present a new resource routing method: redundant De Bruijn routing graph(RDBR). Every node in RDBR has main routing label and assistant routing label, a group of nodes with same main routing label constitute of a redundant routing group. At the time of new nodes join these routing groups can split into several small redundant routing group; at the time of nodes left several neighbor redundant routing group can combine into one large redundant routing group. Experiment and theory analysis show that redundant De Bruijn routing graph keeps the virtual of traditional De Bruijn graph and overcome some short coming of traditional De Bruijn graph: It is more robust to nodes failure, it has more bisection width, its node join and leave procedure is simpler.