On Queue Length of RPR
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 RPRS 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.
Mingsong Chen Xueming Wei Shengyuan Zhou Faliang Ao
Dept. of Communications and Information Engineering Guilin University of Electronic Technology Guilin ,541004, China
国际会议
2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)
广西桂林
英文
1772-1776
2006-06-25（万方平台首次上网日期，不代表论文的发表时间）