一种新的应用于弹性分组环的公平算法  

A Novel Fairness Algorithm for Resilient Packet Rings Based on Dichotomy

作　　者：单丹[1] 金杰[1] 陈立[1] 杨宇[1] 

机构地区：[1]天津大学电子信息工程学院通信工程系,天津300072

出　　处：《光子学报》2007年第3期517-520,共4页Acta Photonica Sinica

基　　金：天津市自然基金重点项目(033800211)资助

摘　　要：为了达到高的带宽利用率,理想的空间重用和带宽分配的公平性.本文提出一种新的应用于弹性分组环网络的带宽分配算法,该算法采用了有限集合中收敛速度最快的二分法,通过对公平速率的逐次逼近来实现带宽的动态分配,适用于分布式网络环境.分析和仿真表明采用基于二分法的带宽分配算法能够给每个节点分配到接近理想的公平带宽,整个环路在实现公平性的同时能够得到最大的空间重用并且收剑迅速.In order to achieve high bandwidth utilization, optimum spatial reuse and fairness simultaneously,a new dynamic bandwidth allocation algorithm with low computational complexity and time complexity was presented, which was based on dichotomy. Analyses and simulations prove that using the new algorithm each node can be allocated with an ideal fair rate approximately for its own traffic at each downstream link,and the whole ring can obtain the maximum spatial reuse and converges quickly.

关 键 词：光纤通信技术 弹性分组环 公平算法 二分法 

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