弹性分组环RPR的公平算法研究

字数:12859.页数:28 论文编号:TX126

弹性分组环RPR的公平算法研究

摘 要

弹性分组环RPR是当今城域网中一种新型的网络结构和数据传输技术。其中带宽公平算法是带宽资源高效利用的保证。本文的重点是对RPR中的带宽公平分配算法进行深入的研究。文章首先阐述了RPR公平算法的目标和RIAS公平原则,接着对几种具有代表性的RPR公平算法(Gandalf、Alladin和DVSR)进行了具体的剖析，分析了上述几种算法的运作机制并对它们的性能进行了比较。在此基础上，本文又分析了一种能满足RPR协议所要求的公平算法即DBFA算法，同时给出了这种算法的主要思想及其运作机制。后本文给出了VC++6.0环境下的有关几种算法的验证，并提出了全文的结论。

关键词:弹性分组环；公平算法；公平速率；RIAS公平；空间复用

The Study on Fairness Algorithm of Resilient Packet Ring(RPR)

Abstract

Resilient Packet Ring(RPR) is a new network structure and data transport technology in the modern metropolitan area networks. And the RPR fair algorithm is the guarantee of effective usage of the bandwidth resources. The focus of the paper is the research which goes deep into the RPR fair algorithm. The goal of the RPR fair algorithm and the principle of RIAS fairness are expounded in the paper in the first place. Then, several representative algorithms for the RPR networks are thoroughly analyzed, including Gandalf, Alladin and DVSR. The running mechanisms of each scheme are analyzed respectively and the performance comparisons are made among them. Based on the previous investigation, one new RPR fair algorithm named DBFA which can achieve the requirement of the RPR protocol is analyzed, and the basic idea and operating mechanism of this algorithm is also given in the paper. Finally, the verification of some related algorithms in the VC++6.0 environment is presented, and the conclusion of the whole paper is given.

Key words: Resilient Packet Ring；Fairness Algorithm；Fair Rate；RIAS Fairness；Spatial Reuse

目 录

1 引 言 1

1.1 课题背景 1

1.2 本课题研究的意义 1

1.3 本课题研究的方法 1

2 相关基础理论 1

2.1 弹性分组环之技术简介 1

2.2 弹性分组环网之基本特征 2

2.3 弹性分组环网中节点的体系结构 3

2.4 弹性分组环中的通用帧结构 4

2.5 弹性分组环协议之参考模型 4

3 弹性分组环中的公平算法 5

3.1 RPR公平算法的目标要求 5

3.2 RIAS公平原则 5

3.3现有的RPR公平算法 6

3.3.1 RPR公平算法的分类 6

3.3.2几种具有代表性的RPR公平算法 7

3.3.3几种公平算法的比较 10

4 一种新的RPR公平算法（DBFA） 11

4.1方案描述 11

4.2算法描述与分析 13

5 VC++6.0环境下验证几种算法 15

5.1 Gandalf算法的验证 15

5.2 DVSR算法的验证 16

5.3 DBFA算法的验证 17

结 论 18

参考文献 19

致 谢 20

附 录 22