论文信息 - A Construction Method of Efficient SkipGraph Using The Performance of Peers in Heterogeneous Environment

A Construction Method of Efficient SkipGraph Using The Performance of Peers in Heterogeneous Environment

SkipGraph is an overlay network that was applied to the data structure of SkipList in a peer to peer (P2P) network. Conventional SkipGraph does not take into account communication or the environmental performance of peers and uniformly treats all peers. However, communication and environmental performance differ for individual peers in real environments, and in some cases search efficiency deteriorates depending on the configuration of the topology of SkipGraph. We propose a method of constructing SkipGraph where the transfer delays between peers in small enough. In this method, peers are classified into three types by taking their processing speeds and communication speeds into consideration. We also evaluated the performance of the method of construction.

[1] Randolph Y. Wang,et al. SkipIndex : Towards a Scalable Peer-to-Peer Index Service for High Dimensional Data , 2004 .

[2] Tatsuhiro Tsuchiya,et al. Balance and Proximity-Aware Skip Graph Construction , 2010, 2010 First International Conference on Networking and Computing.

[3] William Pugh,et al. Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.

[4] Jie Wu,et al. Hierarchical P2P Systems in a Small World , 2004 .

[5] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.

[6] William Pugh,et al. Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[7] James Aspnes,et al. Skip graphs , 2003, SODA '03.

[8] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.