计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (12): 127-128.
• 网络、通信与安全 • 上一篇 下一篇
裴涛 曹炬 凌少东
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
Received:
Revised:
Online:
Published:
摘要： 本文根据排队理论对带有优先级的多服务台信元调度问题进行了定量分析，推导出了每个级别的信元平均时延及丢包率的计算公式，并进行了计算机仿真。根据理论分析和仿真结果，得出了在缓冲区既定的情况下，可以采用提高服务率或者是增加服务台数来有效的降低平均时延和丢包率的结论。由已经得到的公式，我们可以确定将平均时延及丢包率控制在所允许的范围的服务率和服务台数。
关键词: 排队, 优先级, 多服务台, 丢包率, 平均时延
Abstract: According to the queuing theory , this paper conducts the quantitative analysis on cell scheduling strategies of priorities class. After these, we derive the formula of the average cell delay and the cell loss ratio. Through computer simulation and contrastive analysis, we conclude that we must enhance the cell service ratio or increase the number of the servers when we want to reduce the average cell delay and the cell loss ratio. Based on the formula, we can determine the cell service ratio and the number of the servers which curbs the average cell delay and the cell loss ratio in the permissive range.
Key words: queue, priority class, multiserver, cell loss ratio, average cell delay
裴涛 曹炬 凌少东. 信元调度问题中有优先级的多服务台排队系统研究[J]. 计算机工程与应用, 2007, 43(12): 127-128.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I12/127
