一种基于流的环公平算法  

A Distributed Fairness Algorithm for Ring Based on Flows

作　　者：谭步律[1] 阮方[1] 

机构地区：[1]清华大学电子工程系,北京100084

出　　处：《电讯技术》2004年第3期144-148,共5页Telecommunication Engineering

摘　　要：同时实现空间复用和公平分配是弹性分组环(RPR)的重要目标,在很多环境下按流分配是合理的策略。本文提出一种以GPS(GeneralizedProcessorSharing)为基础的算法DFAR-BF。各节点根据本地拥塞状态独立计算公平值,通过控制包向上游反馈,上游节点在比较反馈和本地信息后调整各个流的接入量。仿真表明本算法在一个源节点接入多个流时,能够实现按流公平,在非平衡流的情况下,能够充分利用带宽而不产生抖动。Realizing spatial reuse and fairness allocation simultaneously is a main object of Resilient Packet Ring (RPR), and achieving fairness based on flows is reasonable in many situations. This paper presents an algorithm DFAR-BF based on Generalized Processor Sharing(GPS). Each node calculates fairness value according to congestion status independently, and sends feedback packets upstream. Upstream nodes adjust accessing rate of every flow after comparing local and feedback information. Simulation shows that this algorithm achieves fairness and high utilization. It also resists oscillation under unbalance flow scenarios.

关 键 词：弹性分组环 公平性 空间复用协议 算法 

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