即时编码，无需重传即可实现完全可靠性
On-the-Fly Coding to Enable Full Reliability Without Retransmission
摘要：
本文提出了一种新的可靠性算法，特别是有用的重传是有问题的或不可能的。在多媒体或多播通信的情况下，以及在延迟容忍网络（DTN）的上下文中，经典的重传方案在数据传输性能方面可能适得其反，或者当确认路径并不总是可用时不可能。事实上，在长延迟链路，数据包重传具有成本的意义，必须尽量减少，在本文中，我们详细介绍了一种新的可靠性机制与隐式确认策略，可以使用这些新的DTN的建议，多媒体流量或在多播传输协议的背景下。这个建议是基于一个新的飞行擦除编码的概念，专门设计用于操作高效可靠的双向链路传输。这个建议，名为Tehrs，允许统一的完整的可靠性与纠错方案。在本文中，我们模型的性能，这一建议，并证明与原型，我们可以实现完全的可靠性，而无需确认路径确认。事实上，主要的研究结果是，TECHNOLOGY是不敏感的数据丢失，同时确保更快的数据可用性的应用程序相比，其他传统的确认方案。最后，我们做好了将该算法集成到拥塞控制协议中的第一步工作。
英文摘要：
This paper proposes a new reliability algorithm specifically useful when retransmission is either problematic or not possible. In case of multimedia or multicast communications and in the context of the Delay Tolerant Networking (DTN), the classical retransmission schemes can be counterproductive in terms of data transfer performance or not possible when the acknowledgment path is not always available. Indeed, over long delay links, packets retransmission has a meaning of cost and must be minimized.In this paper, we detail a novel reliability mechanism with an implicit acknowledgment strategy that could be used either within these new DTN proposals, for multimedia traffic or in the context of multicast transport protocols. This proposal is based on a new on-the-fly erasure coding concept specifically designed to operate efficient reliable transfer over bi-directional links. This proposal, named Tetrys, allows to unify a full reliability with an error correction scheme. In this paper, we model the performance of this proposal and demonstrate with a prototype, that we can achieve a full reliability without acknowledgment path confirmation. Indeed, the main findings are that Tetrys is not sensitive to the loss of acknowledgments while ensuring a faster data availability to the application compared to other traditional acknowledgment schemes. Finally, we pave the first step of the integration of such algorithm inside a congestion controlled protocol.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
