分布式和自适应最小生成树
Distributed and Autonomic Minimum Spanning Trees
AI总结:
本文提出了一种自适应算法,用于在分布式系统中构建和维护生成树,以实现高效的广播通信。
摘要:
在分布式系统中,使进程广播消息的最常用策略是一对全部通信。然而,这种方法不可扩展,因为它对发送者造成了沉重负担。本文提出了一种自适应算法,使分布式系统中的n个进程能够构建并维护一个连接彼此的生成树。在此背景下,进程是生成树的顶点。根据定义,生成树连接所有进程而不形成环。所提出的算法确保生成树中的每个顶点都有入度和树深度不超过log₂n。当所有进程都正确时,每个进程的度数恰好为log₂n。生成树可以从任意源进程动态创建,并在进程失败或恢复时透明地重新构建。最多n-1个进程可以失败,正确的进程仍通过可扩展的、功能正常的生成树保持连接。为了构建和维护树,进程使用VCube虚拟拓扑,该拓扑也用作故障检测器。基于自适应生成树算法提出了两种广播算法:一种用于尽力而为的广播,另一种用于可靠广播。提供了仿真结果,包括与其他替代方案的比较。
英文摘要:
The most common strategy for enabling a process in a distributed system to broadcast a message is one-to-all communication. However, this approach is not scalable, as it places a heavy load on the sender. This work presents an autonomic algorithm that enables the $n$ processes in a distributed system to build and maintain a spanning tree connecting themselves. In this context, processes are the vertices of the spanning tree. By definition, a spanning tree connects all processes without forming cycles. The proposed algorithm ensures that every vertex in the spanning tree has both an in-degree and the tree depth of at most $log_2 n$. When all processes are correct, the degree of each process is exactly $log_2 n$. A spanning tree is dynamically created from any source process and is transparently reconstructed as processes fail or recover. Up to $n-1$ processes can fail, and the correct processes remain connected through a scalable, functioning spanning tree. To build and maintain the tree, processes use the VCube virtual topology, which also serves as a failure detector. Two broadcast algorithms based on the autonomic spanning tree algorithm are presented: one for best-effort broadcast and one for reliable broadcast. Simulation results are provided, including comparisons with other alternatives.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。