消息交换网络中两种瞬变稳定的点对点通信协议
Two snap-stabilizing point-to-point communication protocols in message-switched networks
摘要：
一个快照稳定协议，从任何配置开始，总是根据它的规范运行。在本文中，我们提出了一个快照稳定协议来解决消息交换网络中的消息转发问题。在这个问题中，我们必须管理系统的资源，以将消息传递到网络的任何处理器。在这个目的中，我们使用路由算法给出的信息。通过稳定的上下文（特别是，系统以任意配置启动），该信息可能被破坏。因此，对于消息转发问题，快照稳定协议的存在意味着即使路由信息最初被损坏，我们也可以要求系统开始转发消息。在本文中，我们提出了两个单元稳定算法（在状态模型）的以下规格的问题：-任何消息可以在有限的时间内生成。- 任何发出的消息都将被传递到其目的地一次，并且在有限时间内仅传递一次。这意味着我们的协议可以传递任何发出的消息，而不管初始配置中路由表的状态如何。这两个算法都是在文献[MS 78]的基础上提出的。每个算法都需要一个特定的方法来转换成一个快速稳定的一个，但他们都没有引入一个显着的过度消耗内存或时间相对于算法[MS 78]。
英文摘要：
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol to solve the message forwarding problem in a message-switched network. In this problem, we must manage resources of the system to deliver messages to any processor of the network. In this purpose, we use information given by a routing algorithm. By the context of stabilization (in particular, the system starts in an arbitrary configuration), this information can be corrupted. So, the existence of a snap-stabilizing protocol for the message forwarding problem implies that we can ask the system to begin forwarding messages even if routing information are initially corrupted. In this paper, we propose two snap-stabilizing algorithms (in the state model) for the following specification of the problem: - Any message can be generated in a finite time. - Any emitted message is delivered to its destination once and only once in a finite time. This implies that our protocol can deliver any emitted message regardless of the state of routing tables in the initial configuration. These two algorithms are based on the previous work of [MS78]. Each algorithm needs a particular method to be transform into a snap-stabilizing one but both of them do not introduce a significant overcost in memory or in time with respect to algorithms of [MS78].
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
