An effective longest prefix matching algorithm for speeding up query routing in skip graphs

The tremendous growth of public interest in peer-to-peer (P2P) networks in recent years has initiated a lot of research work on how to design efficient overlay structures for P2P systems. Structured overlay networks that based on various distributed hash tables (DHTs) provide no control over where data is stored and cannot support range queries directly. Ordered overlays such as skip graphs and SkipNet have obviously practical advantages over DHTs, which can support several locality properties and range queries. This paper presents a novel longest prefix matching algorithm for speeding up query routing in skip graphs without consumption of extra memory space. A novel data structure called triple linked list (TLL) is designed to store each node´s pointers in the network. Experimental results show that the TLL-based longest prefix matching algorithm can speed up both exact-match and range queries in different network sizes.