论文标题
链接容量分布和最佳能力以供有能力的网络性能
Link Capacity Distributions and Optimal Capacities for Competent Network Performance
论文作者
论文摘要
这项工作解决了评估数据包流网络的最佳链路容量以最小化的目的。我们提出了网络中数据包流的简单模型，并提出了一种数字方法，以评估网络任何任意边缘的数据包流概率质量函数，用于给定的路由算法和流量率。我们进一步讨论了在每个边缘分配最佳能力的技术，以实现所需的最小拥堵并讨论相关的权衡。我们的框架是围绕泊松流量的假设而构建的，但是数值方法适合任何一般分布的数据包涌入。最后，我们定义了链接能力分配的全球性能的指标，并讨论网络结构对容量分配和性能的影响。
This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate packet flow probability mass function at any arbitrary edge of the network for a given routing algorithm and traffic rate. We further discuss techniques of assigning optimal capacity at each edge for attaining desired minimized congestion and discuss related trade-offs. Our framework is built around the assumption of Poisson traffic, however the numerical approach fits for any general distribution of packet influx. Lastly, we define metrics of global performance of link capacities allocation and discuss the effect of network structure on capacity allocation and performance.
