arXiv 1809.024362018-09-07cs.DC

On Underlay-Aware Self-Stabilizing Overlay Networks

Thorsten Götte, Christian Scheideler, Alexander Setzer

备注：: A conference version of this paper was accepted at the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)

英文摘要：

We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after $\mathcal{O}(N^2)$ asynchronous rounds where $N$ is the number of nodes in the overlay.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Avatar：一种时空高效的自稳定覆盖网络

Avatar: A Time- and Space-Efficient Self-Stabilizing Overlay Network

覆盖网络对容错计算提出了一个有趣的挑战。许多覆盖网络在动态环境（例如因特网）中操作，其中故障频繁且广泛，并且系统中的进程的数量可能相当大。最近，自稳定覆盖网络已经被提出作为管理这种复杂性的方法。\emph{Self-stabilizing overlay networks}承诺，从任何弱连接配置开始，最终将构建正确的覆盖网络。到目前为止，这种保证是有代价的：节点可能在算法执行期间具有高度，或者算法可能需要很长时间才能达到合法配置。在本文中，我们提出了第一个自稳定的覆盖网络算法，不会产生这种惩罚。具体来说，我们（i）提出了一个新的本地可检查的覆盖网络的基础上的二叉搜索树，和（ii）提供了一个随机算法的自稳定，终止于预期的多对数轮数\emph{and}增加一个节点的程度只有一个多对数因子的期望。

2015-06-04cs.DC

Applications and Implications of a General Framework for Self-Stabilizing Overlay Networks

From data centers to IoT devices to Internet-based applications, overlay networks have become an important part of modern computing. Many of these overlay networks operate in fragile environments where processes are susceptible to faults which may perturb a node's state and the network topology. Self-stabilizing overlay networks have been proposed as one way to manage these faults, promising to build or restore a particular topology from any initial configuration or after the occurrence of any transient fault. To date there have been several self-stabilizing protocols designed for overlay netw…

2021-09-29cs.DC

Self-stabilizing Overlays for high-dimensional Monotonic Searchability

We extend the concept of monotonic searchability for self-stabilizing systems from one to multiple dimensions. A system is self-stabilizing if it can recover to a legitimate state from any initial illegal state. These kind of systems are most often used in distributed applications. Monotonic searchability provides guarantees when searching for nodes while the recovery process is going on. More precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well. Although there already exists a self-sta…

2018-08-30cs.DC

Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks

For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the advantage of being able to recover from any illegal state. However, the vast majority of these networks cannot give any guarantees on its functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific identifier are answered successfully if a node with t…

2016-09-28cs.DC

Network Scaffolding for Efficient Stabilization of the Chord Overlay Network

Overlay networks, where nodes communicate with neighbors over logical links consisting of zero or more physical links, have become an important part of modern networking. From data centers to IoT devices, overlay networks are used to organize a diverse set of processes for efficient operations like searching and routing. Many of these overlay networks operate in fragile environments where faults that perturb the logical network topology are commonplace. Self-stabilizing overlay networks offer one approach for managing these faults, promising to build or restore a particular topology from any w…

2021-09-29cs.DC

Self-Stabilizing Supervised Publish-Subscribe Systems

In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system. That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant …

2017-12-22cs.DC

更多相关论文收起更多论文

Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures (full version)

Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are…

2015-12-21cs.DC

HSkip+：一种用于带宽异构节点的自稳定覆盖网络

HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths

在本文中，我们提出并分析HSkip+，一个自稳定的覆盖网络的节点与任意异构带宽。HSkip+与Jacob等人[PODC 2009]提出的Skip+图具有相同的拓扑结构，但其自稳定机制明显优于Skip+提出的自稳定机制。此外，节点现在根据其带宽而不是根据其标识符来排序。已经针对具有异构带宽的覆盖网络提出了各种其他解决方案，但是它们不是自稳定的。除了HSkip+是自稳定的，它的性能与加入或离开对数直径和度以及任意带宽的对等体网络的时间和工作的最佳先前界限相当。此外，路由消息的膨胀和拥塞与此类网络的最佳先前边界相当，因此HSkip+结合了这两个世界的优势。我们的理论研究得到了模拟的支持，证明HSkip+确实比Skip+表现得更好，并且在高流失率下正确工作。

2014-11-27cs.DCcs.DScs.NI

快照稳定线性消息转发

Snap-Stabilizing Linear Message Forwarding

在本文中，我们提出了第一个快照稳定的消息转发协议，每个节点使用的缓冲区的数量是独立于任何全局参数，即4个缓冲区，每个链接。该协议在节点的线性链上工作，其可能是大规模和动态系统上的覆盖，例如，点对点系统，网格。. .假设拓扑结构保持线性链，并且节点“整齐地”加入和离开，则该协议容忍拓扑结构的变化。我们希望这个协议将是基础上得到类似的结果更一般的拓扑结构。

2010-06-17cs.DC

大规模系统自稳定服务发现框架的优化

Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems

发现和获取服务的能力是开发大规模分布式系统的关键需求。我们考虑动态和不稳定的环境，即对等（P2P）系统。在以前的工作中，我们设计了一个服务发现的解决方案，称为分布式词典放置表（DLPT），基于分层覆盖结构。一个自稳定的版本，使用的信息传播与反馈（PIF）范式。在本文中，我们介绍了自稳定的COPIF（协作PIF）计划。给出了算法的正确性证明.我们使用这种方法来改善分布式P2P框架设计的服务发现。显着有效的实验结果。

2012-07-05cs.DC

CONE-DHT：一种异构存储系统的分布式自稳定算法

CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system

我们考虑的问题，管理一个动态的异构存储系统中的分布式方式，使分配给该系统中的主机的数据量与其容量。为此，必须解决两个中心问题：（1）在具有低度和直径的覆盖网络中组织主机，使得可以有效地检查任何两个主机之间的数据和路由的正确分布，以及（2）在主机之间分布数据，使得分布尊重主机的容量，并且可以容易地随着主机集合或它们的容量改变而适应。我们提出了分布式协议，这些问题是自我稳定的，不需要任何全球知识的系统，如节点的数量或系统的整体能力。在此之前的工作没有解决方案是已知的满足这些性质。

2013-07-25cs.DC

Relays: A New Approach for the Finite Departure Problem in Overlay Networks

A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. To rigorously study self-tabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [12]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all stayi…

2018-09-13cs.DC

Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks

End-to-end communication over the network layer (or data link in overlay networks) is one of the most important communication tasks in every communication network, including legacy communication networks as well as mobile ad hoc networks, peer-to-peer networks, and mesh networks. Reliable end-to-end communications are based on Automatic Repeat reQuest (ARQ) algorithms for dealing with packet failures, such as packet drops. We study ARQ algorithms that exchange packets to deliver (high level) messages in first-in-first-out (FIFO) order without omissions or duplications. We present a self-stabil…

2020-06-10cs.DC

基于包含树的自稳定平衡算法

Self-Stabilizing Balancing Algorithm for Containment-Based Trees

基于容器的树包含各种方便的结构，如B+树，R树和M树。它们被广泛用于在集中式和分布式环境中构建数据索引、范围可查询覆盖、发布/订阅系统。除了它们的多功能性外，它们平衡的形状确保了令人满意的整体性能。最近，它已被证明，他们的分布式实现可以故障恢复。然而，这种鲁棒性是以不平衡结构为代价的。虽然结构在可搜索性方面保持正确，但其性能可能会显着降低。在本文中，我们提出了一个分布式的自稳定算法来平衡基于包含的树。

2012-12-14cs.CCcs.DC

迈向学习增强的P2P网络：带有不可信建议的自稳定图线性化

Towards Learning-Augmented Peer-to-Peer Networks: Self-Stabilizing Graph Linearization with Untrusted Advice

针对P2P网络，提出结合不可信监督者建议的自稳定图线性化算法，在建议正确时实现$O(\log n)$恢复时间，错误时保持原性能，并给出匹配下界。

2025-04-03cs.DC