關鍵詞:彈性分組環(huán)；公平算法；公平速率；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.
