DocumentCode :
1201501
Title :
A deterministic bound for the access delay of resilient packet rings
Author :
Huang, Changcheng ; Peng, Harry ; Yuan, Fengjie
Author_Institution :
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
Volume :
9
Issue :
1
fYear :
2005
Firstpage :
87
Lastpage :
89
Abstract :
Resilient packet ring (RPR) is a new technology being standardized by the IEEE 802.17 working group. This work presents a ring access delay bound under steady state. The bound is then proved analytically. Furthermore we show that the bound is tight by constructing a worst-case traffic scenario. It is shown that straight overloading scenarios are not the worst case.
Keywords :
IEEE standards; Internet; access protocols; delays; telecommunication traffic; IEEE 802.17 working group; Internet traffic; RPR; access delay; deterministic bound; resilient packet rings; Access protocols; Delay; High-speed networks; Joining processes; Performance analysis; Processor scheduling; Steady-state; Systems engineering and theory; Telecommunication traffic; Traffic control;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2005.1375251
Filename :
1375251
Link To Document :
بازگشت