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.

中文翻译：

---

绕行跳过图：通过绕行图拓扑上的绕行路由进行有效路由

跳过图是一种分布式数据结构，通过对数时间路由以提供资源结构和动态节点添加/删除操作，从而提供了可伸缩的结构化覆盖网络。但是，大多数路由路径比最短路径长得多，因为网络中的每个节点仅知道其邻居，而不是全局拓扑。通常，较长的路由路径会导致高延迟和低容错能力。在此，我们提出了绕道跳过图，该图通过使用绕道路线执行更有效的路线选择。它不需要构造额外的链接或修改其拓扑；因此，它在不增加成本的情况下缩短了路径，同时保持了跳过图的优势。我们的评估实验表明，所提出的方法倾向于大大缩短路径，特别是，