LI Guang-yu, XIAO Ping-ping. Analysis of RPR fairness algorithm. [J]. (4):24-26(2005) DOI: 10.13756/j.gtxyj.2005.04.008.
Analysis of RPR fairness algorithm
摘要
弹性分组环(RPR
ResilientPacketRing)作为下一代高速城域网的核心技术
具有高的带宽利用率、空间再利用和公平性等优良的特性。但要动态地获得这些特性
必须设计合理的带宽分配算法。文章指出了目前所采用的公平算法中存在的一些问题
探讨了一种更新的带宽分配算法:分布式虚拟时间调度(DVSR
DistributedVirtual-timeSchedulinginRings)算法。
Abstract
The resilient packet ring (RPR) is a new technology for high-speed backbone metropolitan area networks?A key performance objective of RPR is to simultaneously achieve high utilization
spatial reuse
and fairness?The core technical challenge for RPR is the design of a bandwidth allocation algorithm that dynamically achieves these three properties?In this paper
we introduce some problems in current fairness algorithm
and discuss a new dynamic bandwidth allocation algorithm called DVSR(Distributed Virtual-time Scheduling in Rings).