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.
Highlights
A N OVERLAY network is an application-level logical network built on an existing network such as the Internet
Skip Graph [7] is a distributed data structure that provides a scalable structured overlay managing pairs of a key and a value. It works as a distributed hash table (DHT) and archives good load balancing for data management
Even if keys are not hashed, it constructs a balanced topology that performs routing in logarithmic time for resource location and dynamic node addition/deletion, unlike some typical DHTs [8], [9]
Summary
A structured overlay constructs an autonomous distributed network according to a specific data structure or some protocols; thereby providing reachability to target nodes, high scalability, high fault tolerance, and some useful functions. Owing to these properties, application to a variety of large-scale distributed systems has been proposed; e.g., distributed key/value stores [2], video streaming [3], and online games [4]. Skip Graph [7] is a distributed data structure that provides a scalable structured overlay managing pairs of a key and a value. Skip Graph without hashing supports range queries [10], [11] as a result of preserving the order of keys
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
