HELC: a High Efficiency and Low Cost structured Peer-to-Peer overlay without Distributed Hash Table
For such a highly distributed and heterogeneous environment as P2P system, information reflection and collection, lack of centralised control and non-cooperation are just some of the challenges. In order to build an ideal P2P system, there are two key problems to be solved: (1) how to make the overlay robust; (2) how information can be located and routed at a low cost without global view of the system. We have designed a hierarchical P2P overlay and combined its robust characteristic with the merits of a structured P2P overlay. Differing from the traditional hierarchical P2P tree-like structure, (1) this article presents a High Efficiency and Low Cost (HELC) structured P2P overlay composed of levels and layers, which uses small world characteristics to improve efficiency and decrease the cost of routing. (2) Unlike normal redundant mechanisms for solving the single fault problem: Tri-Information Center mechanism is presented to improve robustness. (3) A source ranking mechanism is proposed to discourage free riding and whitewashing and to encourage frequent information exchanges among peers. The HELC will be not only more efficient because it applies the DHT-like routing algorithm in the unstructured P2P overlay, but also more adaptive to suit highly dynamic environment.
Li, Deng, Zhigang Chen, Hui Liu, and Athanasios P. Vasilakos. "HELC: a High Efficiency and Low Cost structured Peer-to-Peer overlay without Distributed Hash Table." International Journal of Autonomous and Adaptive Communications Systems 1, no. 1 (2008): 55-81.
International Journal of Autonomous and Adaptive Communications Systems