首页 | 本学科首页   官方微博 | 高级检索  
     检索      

清除阻塞的M/P/C/C 排队系统仿真
引用本文:黄生叶,庞宁,黄杰弟,林联运,朱剑刚.清除阻塞的M/P/C/C 排队系统仿真[J].国际商务研究,2006,46(2):86-88.
作者姓名:黄生叶  庞宁  黄杰弟  林联运  朱剑刚
作者单位:湖南大学计算机与通信学院,长沙410082
基金项目:湖南大学校科研和校改项目
摘    要:对清除阻塞型M/P/C/C排队系统进行了大量的仿真研究,结果表明在平均到达率及平均服务时间分别对应相同的情况下,其呼叫损失概率与爱尔兰-B公式符合得很好。这一结论对通信网络规划过程中考虑业务流的自相似性有重要意义。

关 键 词:通信网络  规划  呼叫损失  排队系统  仿真
收稿时间:2005/9/7 0:00:00
修稿时间:2006/1/12 0:00:00

Simulation of an M/P/C/C Queueing System with Cleared Blocking
HUANG Sheng-ye,PANG Ning,HUANG Jie-di,LIN Lian-yun,ZHU Jian-gang.Simulation of an M/P/C/C Queueing System with Cleared Blocking[J].International Business Research,2006,46(2):86-88.
Authors:HUANG Sheng-ye  PANG Ning  HUANG Jie-di  LIN Lian-yun  ZHU Jian-gang
Institution:Institute of Computer and Communications, Hunan University, Changsha 410082, China
Abstract:A great number of simulations for an M/P/C/C queueing system are made. Results show that under the condition of the same average arrival rates, the same number of channels and the same average service time, the call blocking probability is almost the same as that given by the Erlang - B formula. This conclusion is important to communications network engineering where the self - similar property of network traffic cannot be neglected.
Keywords:communication network  plan  call blocking  queueing system  simulation
点击此处可从《国际商务研究》浏览原始摘要信息
点击此处可从《国际商务研究》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号