| 应用于弹性分组环的带宽分配的公平算法 |
| |
| 引用本文： | 夏颖.应用于弹性分组环的带宽分配的公平算法[J].齐齐哈尔大学学报(自然科学版),2007,23(3):15-19. |
| |
| 作者姓名： | 夏颖 |
| |
| 作者单位： | 齐齐哈尔大学通信与电子工程学院,黑龙江,齐齐哈尔,161006 |
| |
| 摘 要： | 提出一种新的应用于弹性分组环网络的带宽分配算法，该算法采用了有限集合中收敛速度最快的二分法，通过对公平速率的逐次逼近来实现带宽的动态分配，适用于分布式网络环境。分析和仿真表明，采用基于二分法的带宽分配算法能够给每个节点分配到接近理想的公平带宽。整个环路在实现公平性的同时能够得到最大的空间重用并且收剑迅速。
|
| 关 键 词： | 弹性分组环 公平算法 二分法 |
| 文章编号： | 1007-984X（2007）03-0015-05 |
| 修稿时间： | 2007-03-15 |
A fairness bandwidth allocation algorithm for resilient packet rings based on dichotomy |
| |
| XIA Ying.A fairness bandwidth allocation algorithm for resilient packet rings based on dichotomy[J].Journal of Qiqihar University(Natural Science Edition),2007,23(3):15-19. |
| |
| Authors: | XIA Ying |
| |
| Abstract: | Resilient packet ring(RPR) is a technology for metropolitan backbone networks.The key objective of RPR is to achieve high bandwidth utilization,optimum spatial reuse and fairness simultaneously.A new dynamic bandwidth allocation algorithm with low computational complexity and time complexity is presented,which is 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. |
| |
| Keywords: | resilient packet rings fairness algorithm dichotomy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
