论文部分内容阅读
在分析研究弹性分组环(RPR)带宽分配的基础上,提出一种新的快速消除拥塞的公平算法(RFCA)。该算法由拥塞链路所在的节点不断计算影响该链路的节点个数及公平带宽分配,并将分析结果告知上游节点。上游节点再次分析计算,直到找出造成拥塞的节点。理论分析及仿真结果表明,RFCA优于现有IEEE802.17采用的AM算法,在保证节点业务发送公平性的同时,消除了AM算法的振荡现象,提高了链路的利用率,并且不影响业务流的空间复用性。
Based on the analysis of RPR bandwidth allocation, this paper proposes a new fast congestion canceling fairness algorithm (RFCA). In this algorithm, the node where the congested link resides continuously calculates the number of nodes and the fair bandwidth allocation affecting the link, and notifies the upstream node of the analysis result. The upstream node analyzes the calculation again until it finds the node that caused the congestion. The theoretical analysis and simulation results show that RFCA is superior to the existing AM algorithm adopted by IEEE802.17, which can eliminate the oscillation of the AM algorithm and improve the utilization of the link while ensuring the fairness of the node services and does not affect the service Spatial reusability.