首页期刊视频编委会征稿启事出版道德声明审稿流程读者订阅论文查重联系我们English
引用本文
  • 谭步律,阮方.一种基于流的环公平算法[J].电讯技术,2004,44(3):144 - 148.    [点击复制]
  • .A Distributed Fairness Algorithm for Ring Based on Flows[J].,2004,44(3):144 - 148.   [点击复制]
【打印本页】 【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 1383次   下载 59 本文二维码信息
码上扫一扫!
一种基于流的环公平算法
0
()
摘要:
同时实现空间复用和公平分配是弹性分组环(RPR)的重要目标,在很多环境下按流分配是合理的策略。本文提出一种以GPS(Genemlized Processor Sharing)为基础的算法DFAR—BF。各节点根据本地拥塞状态独立计算公平值,通过控制包向上游反馈,上游节点在比较反馈和本地信息后调整各个流的接入量。仿真表明本算法在一个源节点接入多个流时,能够实现按流公平,在非平衡流的情况下.能够充分利用带宽而不产生抖动。
关键词:  弹性分组环 公平性 空间复用协议 算法
DOI:10.3969/j.issn.1001-893X.
基金项目:
A Distributed Fairness Algorithm for Ring Based on Flows
()
Abstract:
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.
Key words:  RPR,Fairness,SRP,Alogrithm
安全联盟站长平台