Range-Key Extension of the Skip Graph

In the Skip Graph, which is a structured overlay network that supports range retrievals, a key is supposed to consist of a single value. Therefore, the Skip Graph cannot perform range-to-range retrievals. In the present research, we extend the Skip Graph, enabling it to retain a range as a key, and propose the Range-Key Skip Graph, which can perform range-to-range retrievals. We also implement the proposed scheme and evaluate it on the PlanetLab.

[1]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[2]  Luís E. T. Rodrigues,et al.  GeoPeer: a location-aware peer-to-peer system , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

[3]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[4]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

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

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

[7]  Shinji Shimojo,et al.  A Location-Based Peer-to-Peer Network for Context-Aware Services in a Ubiquitous Environment , 2005, 2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops).