DocumentCode :
460629
Title :
On Queue Length of RPR
Author :
Chen, Mingsong ; Wei, Xueming ; Zhou, Shengyuan ; Ao, Faliang
Author_Institution :
Dept. of Commun. & Inf. Eng., Guilin Univ. of Electron. Technol.
Volume :
3
fYear :
2006
fDate :
25-28 June 2006
Firstpage :
1772
Lastpage :
1776
Abstract :
Resilient packet ring (RPR) is a new technology has just been standardized as IEEE 802.17 for metropolitan area networks (MAN). RPR can be regarded as a buffer (or register) insertion ring. Thus, the buffer size configuration is very important to the performance of RPR. Currently, it is lacked for its theoretic analysis. In this paper, we initiated RPR´s queue length into queuing theory and investigated their relations with throughput and number of nodes. The results are very close to those of engineering. It also turns out some new points such as queue length does not increase linearly with number of nodes as in our imagination
Keywords :
IEEE standards; WiMax; queueing theory; telecommunication network topology; telecommunication traffic; IEEE 802.17; MAN; RPR; buffer insertion ring; buffer size configuration; metropolitan area networks; queue length; queuing theory; resilient packet ring; Add-drop multiplexers; Analytical models; Bandwidth; Delay; Metropolitan area networks; Protocols; Queueing analysis; Switches; Throughput; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Circuits and Systems Proceedings, 2006 International Conference on
Conference_Location :
Guilin
Print_ISBN :
0-7803-9584-0
Electronic_ISBN :
0-7803-9585-9
Type :
conf
DOI :
10.1109/ICCCAS.2006.285017
Filename :
4064243
Link To Document :
بازگشت