A three-layer routing protocol of structured peer-to-peer overlay networks

The performance of structured peer-to-peer overlay networks depends on the routing protocols mainly. The current protocols we used usually maintain a O(logN) routing table and O(logN) routing hops. To get better routing speed with less scale routing table, using O(1) node finger to get O(N) route path, a new protocol named CSSP was presented. This protocol has three layers: cache-nodes layer, super-node layer, and successor-node layer. A short routing table was made to record “L” cache nodes, one super node and one successor node. Algorithms for maintaining the route table was presented in this paper. A selection algorithm was presented to select the super node who could cache all of the nodes. And the cache-nodes, super-node and successor-node ensure the high performance of the CSSP. Compared to chord, pastry and etc., the CSSP increases the performance in routing table maintaining, routing hops, fault-tolerance and the amount of trembled nodes while some nodes inject and eject the CSSP p2p system. The conclusion shows that the CSSP is an efficient route algorithm, but also some problems waiting for further study.