论文部分内容阅读
弹性分组环(RPR)是基于分组的城域网发展的重要方向;公平性是RPR的关键技术之一;而传统的公平性概念并不适用于RPR,该文在首先定义适用于RPR的公平性概念的基础上,进一步分析了现今RPR协议草案中的公平算法,并针对此公平算法在非平衡流条件下的缺陷提出了改进方案-RPR节点流聚集(RPR-NIA)公平算法。仿真验证的结果表明,在非平衡流条件下,RPR-NIA公平算法在保证节点流聚集公平性的基础上能减轻振荡幅度,提高节点平均吞吐量,从而获得更高的带宽利用率;并且能够实现多拥塞节点条件下链路带宽分配的公平性。
Resilient packet ring (RPR) is an important direction of packet-based metropolitan area network development. Fairness is one of the key technologies of RPR. However, the traditional concept of fairness does not apply to RPR. This paper first defines the fairness of RPR This paper further analyzes the fairness algorithm in the current draft of RPR protocol and proposes an improved scheme of RPR-NIA fairness algorithm based on the fairness algorithm in the unbalanced flow. The simulation results show that the RPR-NIA fairness algorithm can reduce the oscillation amplitude and increase the average throughput of nodes, so as to obtain higher bandwidth utilization rate under the condition of unbalanced flow. Achieve fairness of link bandwidth allocation under multi-congestion conditions.