The maintenance of efficient and robust overlay networks is one of the most fundamental and reoccurring themes in networking. This article presents a survey of state-of-the-art algorithms to design and repair overlay networks in a distributed manner. In particular, we discuss basic algorithmic primitives to preserve connectivity, review algorithms for the fundamental problem of graph linearization, and then survey self-stabilizing algorithms for metric and scalable topologies. We also identify open problems and avenues for future research.

中文翻译：

---

自稳定覆盖网络算法综述

维护高效和健壮的覆盖网络是网络中最基本和反复出现的主题之一。本文介绍了以分布式方式设计和修复覆盖网络的最先进算法的调查。特别是，我们讨论了保持连通性的基本算法原语，回顾了图线性化基本问题的算法，然后研究了度量和可扩展拓扑的自稳定算法。我们还确定了未来研究的开放问题和途径。