RBTree: A New and Scalable P2P Model Based on Gossiping

A major challenge in peer-to-peer systems is the problem of efficiently locating data or resources and scalability. According to the actual practical heterogeneous network system, we explore a fast and scalable super-peer P2P network model based on a rigorous binary tree code algorithm. In our model, if the size of network is small, file lookups are resolved with only one hop. As the systempsilas scale become larger, it can expand automatically based on the super-peerpsilas capability and suit for large scale system. In the worst case, file lookups are resolved with only three hops. Experimental results and theoretical analysis show that the problem of efficiently lookups and scalability in P2P systems are resolved.