A steady state bound for resilient packet rings

Author

Huang, Changcheng ; Peng, Harry ; Yuan, Fengjie ; Hawkins, John

Author_Institution

Carleton Univ., Ottawa, Ont., Canada

Volume

7

fYear

2003

fDate

1-5 Dec. 2003

Firstpage

4054

Abstract

Resilient packet ring (RPR) is a new technology being standardized in the IEEE 802.17 working group. The paper presents the performance of 1TB-RPR, a proposal made to the working group. 1TB-RPR deploys a rate-based fairness algorithm rather than the quota-based algorithm that has been widely used in legacy ring schemes. This fairness algorithm significantly reduces access delays under steady state and allows RPR to be scalable in today´s MAN/WAN environments. A ring access delay bound under steady state is given. The bound is then proved using both analytical and simulation approaches. Furthermore, we show that the bound is tight by constructing a worst-case traffic scenario. It is shown that straight overloading scenarios may not be the worst case.

Keywords

computer network reliability; delays; metropolitan area networks; telecommunication traffic; wide area networks; IEEE 802.17 working group; MAN; WAN; access delay; overloading scenario; rate-based fairness algorithm; resilient packet rings; steady state bound; Analytical models; Delay; Joining processes; Proposals; Protocols; Steady-state; Telecommunication traffic; Token networks; Traffic control; Wide area networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE

Print_ISBN

0-7803-7974-8

Type

conf

DOI

10.1109/GLOCOM.2003.1258990

Filename

1258990