| 大型M/P/C/C排队系统仿真研究 |
| |
| 引用本文： | 林峰,符涛,黄生叶.大型M/P/C/C排队系统仿真研究[J].计算机仿真,2007,24(5):131-133,221. |
| |
| 作者姓名： | 林峰 符涛 黄生叶 |
| |
| 作者单位： | 湖南大学计算机与通信学院,湖南,长沙,410082;湖南大学计算机与通信学院,湖南,长沙,410082;湖南大学计算机与通信学院,湖南,长沙,410082 |
| |
| 摘 要： | 理论上推测Erlang B 公式对服务时问为任意分布的M/G/C/C系统的呼叫损失概率是有效的但缺乏严格证明.据此,对服务时间呈 Pareto 分布的M/P/C/C排队系统的仿真问题进行了研究,特别是对排队系统中服务装置数目很大的情况进行了研究.采用一种名为红黑树的数据结构较好地解决了超长序列、超大C值所造成的计算时间问题,并采用基于事件驱动的时间调度法进行排队仿真,结果与 Erlang-B 公式相符.表明Erlang B公式对M/P/C/C系统的呼叫损失概率是有效的.为采用仿真方法对自相似流下的网络性能进行深入研究打下了基础.
|
| 关 键 词： | 自相似 公式 红黑树 |
| 文章编号： | 1006-9348（2007）05-0130-03 |
| 修稿时间： | 2006-10-232006-12-29 |
Simulation of Large M/P/C/C Queueing System |
| |
| LIN Feng,FU Tao,HUANG Sheng-ye.Simulation of Large M/P/C/C Queueing System[J].Computer Simulation,2007,24(5):131-133,221. |
| |
| Authors: | LIN Feng FU Tao HUANG Sheng-ye |
| |
| Affiliation: | College of Computer and Communication, Hunan University, Changsha Hunan 410082, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Self - similar Formula Red - black tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
