网络循环的伊索寓言
Aesop Fable for Network Loops
摘要：
检测数据网中的环路通常涉及对跳限制进行倒计数或在每一跳处缓存数据以检测循环。使用跳数限制意味着数据包的来源必须知道数据包在没有环路的情况下可以传输的最大距离。这也意味着一个循环直到它行进了最大距离才被检测到，即使那是许多循环。在每一跳缓存数据包签名（如哈希或随机数）可能需要在每一跳都占用大量内存，因为缓存的信息必须在循环转发数据包的时间内持续存在。本文提出了一种新的分布式循环检测机制的基础上的TornessandHare算法，可以快速检测循环，而无需缓存每个包的数据在每一跳与适量的额外的状态，在每个包。
英文摘要：
Detecting loops in data networks usually involves counting down a hop limit or caching data at each hop to detect a cycle. Using a hop limit means that the origin of a packet must know the maximum distance a packet could travel without loops. It also means a loop is not detected until it travels that maximum distance, even if that is many loops. Caching a packet signature at each hop, such as a hash or nonce, could require large amounts of memory at every hop because that cached information must persist for as long as a loop could forward packets. This paper presents a new distributed loop detection mechanism based on a Tortoise and Hare algorithm that can quickly detect loops without caching per-packet data at each hop with a modest amount of additional state in each packet.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
