摘要
理论上推测Erlang B公式对服务时间为任意分布的M/G/C/C系统的呼叫损失概率是有效的但缺乏严格证明。据此,对服务时间呈Pareto分布的M/P/C/C排队系统的仿真问题进行了研究,特别是对排队系统中服务装置数目很大的情况进行了研究。采用一种名为红黑树的数据结构较好地解决了超长序列、超大C值所造成的计算时间问题,并采用基于事件驱动的时间调度法进行排队仿真,结果与Erlang-B公式相符。表明Erlang B公式对M/P/C/C系统的呼叫损失概率是有效的。为采用仿真方法对自相似流下的网络性能进行深入研究打下了基础。
The formula of Erlang B is inferred to hold for any M/G/G/C system with general service time distribution, but rigorous proof is absent. Simulation of M/P/G/C queuing system has been researched, especially considering the situation that the number of servers is huge. A kind of data structure named red - black tree is used to solve the time - consuming problem caused by overlong sequence and huge number of servers C. And event - driven time scheduling simulation method is adopted. Simulation results coincides well with Erlang - B formula. This has laid the foundation of further research on using simulation methods to study the performance of self - similar network traffic.
出处
《计算机仿真》
CSCD
2007年第5期131-133,221,共4页
Computer Simulation
基金
湖南省自然科学基金资助项目(06JJ2030)
关键词
自相似
公式
红黑树
Self - similar
Formula
Red - black tree
