RPR公平算法收敛性分析  

Analysis for the converging of Resilient Packet Ring fairness algorithm

作　　者：邓炳光[1] 涂艳丽[1] 张治中[1] 

机构地区：[1]重庆邮电学院通信网与测试技术重点实验室,重庆400065

出　　处：《现代传输》2006年第1期59-62,共4页Modern Transmission

摘　　要：弹性分组环(Resilient Packet Ring,RPR)技术是一种新型的城域网络技术。RPR中最关键的技术之一是环路分布式公平算法。公平算法的目的是计算各个竞争带宽站点分配的带宽。本文研究了RPR公平算法是如何在各个相互竞争带宽的站点中实现带宽的公平分配,并且讨论了公平算法如何使各链路速率收敛至一个公平值。最后,我们也分析讨论了不同 RPR结构参数的lpCoef的设定对系统的收敛性的不同影响。Resilient Packet Ring（RPR） is a new data transport technology of Metropolitan Area Networks （MAN）. One of the key techniques of RPR is ring distributed fairness algorithm. The task of the fairness algorithm is to ensure that all stations get their fair share of the bandwidth, when there is more demand than supply. This paper discusses how the RPR fairness algorithm Is able to divide the bandwidth fairly among contending stations and how fairness algorithm make the link rate converge to the fair value. Finally we show that the setting of the RPR 1pCoef configuration parameter is of crucial Importance for the convergence of the fairness algorithm.

关 键 词：弹性分组环 公平算法 1pCoef 收敛 

分 类 号：TN915[电子电信—通信与信息系统]