基于树拓扑的快照稳定消息转发算法
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies
摘要：
在本文中，我们考虑的消息转发问题，包括在管理用于转发消息的网络资源。以前的工作在这个问题上提供的解决方案，要么使用大量的缓冲区（即每个处理器n个缓冲区，其中n是网络中的处理器的数量），使解决方案不可扩展，或者，他们保留所有的缓冲区从发送器到接收器只转发一个消息%，而使用D缓冲区（其中D是指网络的直径）。在[1]中引入了每个链路使用恒定数量的缓冲区的唯一解决方案。然而，该解决方案仅适用于链式网络。在本文中，我们提出了一个快照稳定算法的消息转发问题，使用相同的复杂性的缓冲区的数量[1]和工作在树拓扑结构。
英文摘要：
In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor, where n is the number of processors in the network) making the solution not scalable or, they reserve all the buffers from the sender to the receiver to forward only one message %while using D buffers (where D refers to the diameter of the network) . The only solution that uses a constant number of buffers per link was introduced in [1]. However the solution works only on a chain networks. In this paper, we propose a snap-stabilizing algorithm for the message forwarding problem that uses the same complexity on the number of buffers as [1] and works on tree topologies.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
