Detouring Skip Graph: Efficient Routing via Detour Routes on Skip Graph Topology

Abstract

Skip graph is a distributed data structure that provides a scalable structured overlay network by routing in logarithmic time for resource location and dynamic node addition/deletion. However, most of the routing paths are quite longer than the shortest paths because each node in the network knows only its neighbors, rather than the global topology. In general, long routing paths lead to the high latency and the low fault tolerance. Herein, we propose Detouring Skip Graph, which performs more efficient routing through the use of detour routes. It does not require construction of extra links or modification of its topology; thereby, it shortens the paths without additional costs while maintaining the advantages of Skip Graph. Our evaluation experiments show that the proposed method tends to shorten the paths considerably, and in particular, that the average path length is approximately 20%-30% shorter than that of Skip Graph.