有限缓冲区反馈非循环擦除网络的吞吐量和延迟
Throughput and Latency of Acyclic Erasure Networks with Feedback in a Finite Buffer Regime
摘要：
有限缓冲区擦除网络的精确马尔可夫建模分析是一个非常困难的问题，由于在系统中的大量的状态。在这样的网络中，分组丢失是由于链路擦除或被满缓冲区阻塞。在本文中，我们提出了一种新的方法，迭代估计网络的性能参数，更重要的是减少了计算复杂性相比，精确的分析。这是第一个工作，分析研究了有限内存的影响，一般有线非循环网络的吞吐量和延迟与擦除链路。作为一个案例研究，随机数据包路由方案与理想的反馈的链接。提出的框架产生了一个相当准确的估计的概率分布的缓冲区占用的中间结点，使用它，我们不仅可以识别拥塞和饥饿的节点，而且还获得解析表达式的吞吐量和平均延迟的数据包在网络中。这里提出的理论框架可以应用于许多有线网络，从互联网到更未来的应用，如各种通信和网络编码场景下的片上网络。
英文摘要：
The exact Markov modeling analysis of erasure networks with finite buffers is an extremely hard problem due to the large number of states in the system. In such networks, packets are lost due to either link erasures or blocking by the full buffers. In this paper, we propose a novel method that iteratively estimates the performance parameters of the network and more importantly reduces the computational complexity compared to the exact analysis. This is the first work that analytically studies the effect of finite memory on the throughput and latency in general wired acyclic networks with erasure links. As a case study, a random packet routing scheme with ideal feedback on the links is used. The proposed framework yields a fairly accurate estimate of the probability distribution of buffer occupancies at the intermediate nodes using which we can not only identify the congested and starving nodes but also obtain analytical expressions for throughput and average delay of a packet in the network. The theoretical framework presented here can be applied to many wired networks, from Internet to more futuristic applications such as networks-on-chip under various communication and network coding scenarios.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
