Design of the P2P system based on heterogeneous characters

Abstract

A hierarchical of 160-bit ID space is constructed based on the node's location information (network heterogeneous) and the node's processing capability (node heterogeneous) etc. The problem of the topology consistency is solved by making the hierarchical ID space compatible with that of the physical network. The relay of weighed reputation method is used to realize the storage and collection of the "key data" in the P2P system. This method is also used to select the super nodes providing the service functions and to choose the "lawful" data objects dynamically.