As a distributed hash table (DHT) routing overlay, Skip Graph is used in a variety of peer-to-peer (P2P) systems including cloud storage. The overlay connectivity of P2P systems is negatively affected by the arrivals and departures of nodes to and from the system that is known as churn. Preserving connectivity of the overlay network (i.e., the reachability of every pair of nodes) under churn without compromising the overlay latency is a performance challenge in every P2P system including the Skip Graph-based ones. The existing decentralized churn stabilization solutions that are applicable to Skip Graphs mainly optimize the connectivity of the system under churn and do not consider routing latency of overlay as an optimization goal. Additionally, those existing solutions change the message complexity of Skip Graphs, distort its topology, or apply constant message overhead to the system. In this paper, we propose Interlaced , a fully decentralized churn stabilization mechanism for Skip Graphs that provides drastically stronger overlay connectivity and faster search queries without changing the asymptotic complexity of the Skip Graph in terms of storage, computation, and communication. We also propose the Sliding Window De Bruijn Graph (SWDBG ) as a tool to predict the availability of nodes with high accuracy. Our simulation results show that in comparison to the best existing DHT-based solutions, Interlaced improves the overlay connectivity of the Skip Graph under churn with the gain of about $1.73$ times. Likewise, compared to the existing availability prediction approaches for P2P systems, SWDBG is about $1.26$ times more accurate. A Skip Graph that benefits from Interlaced and SWDBG is about $2.47$ times faster on average in routing the queries under churn compared to the best existing solutions. We also present an adaptive extension of Interlaced to be applied to other DHTs, for example, Kademlia.

作为分布式哈希表（DHT）路由覆盖图，跳过图可用于包括云存储在内的各种对等（P2P）系统。P2P系统的覆盖连通性产生负面被称为到达和节点，并从该系统的偏离影响流失。在不影响覆盖延迟的情况下，在不增加覆盖延迟的情况下保持覆盖网络的连通性（即，每对节点的可达性）是每个P2P系统（包括基于跳过图的系统）中的性能挑战。现有的适用于跳过图的分散式搅动稳定解决方案主要是优化搅动下的系统的连通性，并且没有将覆盖的路由延迟视为优化目标。此外，这些现有解决方案会更改“跳过图”的消息复杂性，扭曲其拓扑结构或对系统施加恒定的消息开销。在本文中，我们提出隔行扫描，是用于“跳过图”的完全分散的搅动稳定机制，可在不改变“跳过图”在存储，计算和通信方面的渐近复杂性的情况下，提供更强大的覆盖连接性和更快的搜索查询。我们还建议使用滑动窗口De Bruijn图（SWDBG）作为预测节点可用性的工具。我们的仿真结果表明，与现有最佳的基于DHT的解决方案相比，Interlaced可以在流失情况下提高“跳过图”的覆盖连接性，其增益约为$\mathrm{1个}。73$次。同样，与现有的P2P系统可用性预测方法相比，SWDBG大约$\mathrm{1个}。26$倍更准确。受益于隔行扫描和SWDBG的跳过图是关于$2。47$与最佳的现有解决方案相比，在按流失进行路由查询时平均要快两倍。我们还提出了将隔行的自适应扩展应用于其他DHT，例如Kademlia。