IEEE802.17弹性分组环公平算法研究  

Research on Fairness Algorithm for IEEE802.17 RPR

作　　者：夏明[1] 黄勤珍[1] 

机构地区：[1]西南民族大学,四川成都610041

出　　处：《通信技术》2009年第1期180-182,共3页Communications Technology

摘　　要：在分析研究弹性分组环(RPR)带宽分配的基础上,提出一种新的快速消除拥塞的公平算法(RFCA)。该算法由拥塞链路所在的节点不断计算影响该链路的节点个数及公平带宽分配,并将分析结果告知上游节点。上游节点再次分析计算,直到找出造成拥塞的节点。理论分析及仿真结果表明,RFCA优于现有IEEE802.17采用的AM算法,在保证节点业务发送公平性的同时,消除了AM算法的振荡现象,提高了链路的利用率,并且不影响业务流的空间复用性。This paper analyzes bandwidth allocation of Resilient Packet Ring（RPR） and proposes a new fairness algorithm which can rapidly eliminates the deviation congestion. The algorithm calculates nodes number continuously and allocates the fair bandwidth according to congestion status. Upstream nodes analyzes and calculates again after being informed of analzsis results and available bandwidth until congested nodes are found. Analyses and simulations show that RFCA algorithm is superior to AM algorithm adopted by IEEE802.17. RFCA algorithm guarantees fairness, eliminates concussion of AM algorithm, improves link utilization and has no influence on space reusability of traffic.

关 键 词：弹性分组环 AM算法 快速公平控制算法 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]