摘要： 弹性分组环是城域网发展的重要方向。为了实现基于优先级区分的业务服务质量，弹性分组环采用基于优先级区分的队列以及转发机制。利用M/G/1/K排队模型分析弹性分组环中各类业务缓存中的分组队列长度。与M/G/1排队模型相比，该模型可以获得更准确的结果，实用价值较高。
关键词:
弹性分组环,
M/G/1/K排队模型,
分组传输延时,
队列长度
Abstract: Resilient Packet Ring(RPR) is one of the important development orientation of LANs. In order to guarantee the QoS of traffic based on priority division, RPR adopts the multiple-channel and multiple-queue to differentiate the traffic with priorities. This paper uses M/G/1/K model to analyze the length of RPR queue systems. Comparing with M/G/1 model, the model can get exacter result and is more valuable in application.
Key words:
Resilient Packet Ring(RPR),
M/G/1/K queuing model,
packet transfer delay,
queue length
中图分类号:
刘秋明, 蔡志勇, 王健. 弹性分组环中的队列长度分析[J]. 计算机工程, 2010, 36(11): 108-110.
LIU Qiu-Meng, CA Zhi-Yong, WANG Jian. Queue Length Analysis in Resilient Packet Ring[J]. Computer Engineering, 2010, 36(11): 108-110.