Performance Evaluation of In-network Packet Retransmissions using Markov Chains
Performance Evaluation of In-network Packet Retransmissions using Markov Chains
复制标题
使用马尔可夫链进行网内数据包重传的性能评估
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
S. Gjessing
中科院分区：
文献类型：
--
作者：
Runa Barik;M. Welzl;Peyman Teymoori;Safiqul Islam;S. Gjessing
我们考虑网络内部的数据包在一段端到端的路径上的重传，使用马尔可夫链公式的问题，我们评估的影响的丢失概率在网络段负责重传以及本地RTT和端到端超时之间的比率。我们还获得了最佳的高速缓存大小所需的重传取决于数据包丢失和高速缓存阻塞概率。我们的研究表明，作为端到端超时的函数的重传路径段的本地RTT显着影响数据包缓存时间。我们还观察到，一个小的增量在数据包丢失概率高于阈值可以严重影响高速缓存填充的百分比，而不管该高速缓存大小。我们的研究结果适用的用例包括最近的IETF提案，称为“LOOPS”，递归网络架构和在特殊网络场景中使用逐跳重传的提案，例如信息中心网络（ICN）。
We consider the retransmission of packets inside the network on a segment of an end-to-end path. Using a Markov chain formulation of the problem, we evaluate the effect of the loss probability in the network segment that is responsible for retransmission as well as the ratio between the local RTT and the end-to-end timeout. We also obtain the optimal cache size required for retransmission depending on the packet loss and cache blocking probabilities. Our study reveals that the local RTT of the path segment for retransmission as a function of the end-to-end timeout significantly influences the packet caching time. We also observe that a small increment in the packet loss probability above a threshold can severely affect the percentage of cache filling irrespective of the cache size. Use cases to which our findings apply include a recent IETF proposal called “LOOPS”, recursive network architectures and proposals that use hop-by-hop retransmissions in special network scenarios, e.g. for Information-Centric Networking (ICN).