基于超爱尔兰分布的自相似网络排队模型研究  

Research on queuing model of self-similar network based on hyper-erlang distribution

作　　者：徐兴[1] 岳学军[1] 林涛[1] 

机构地区：[1]华南农业大学工程学院电子工程系,广州510642

出　　处：《计算机工程与应用》2012年第18期71-75,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.69972051);广东高校优秀青年创新人才培育项目(No.LYM10035);广东省农业机械化科研课题项目

摘　　要：现有网络的业务流研究表明,多种通信业务中普遍存在自相似特性,但是如何对自相似业务流进行建模和分析一直是个难解问题。基于超爱尔兰拟合算法,建立了到达为泊松分布,服务时间为超爱尔兰分布的M/HErD/1/K自相似排队模型,推导得到呼叫损失概率、平均排队队长等排队性能的解析解。在实际业务环境下和传统的M/M/1/K排队模型进行了仿真对比,结果表明M/HErD/1/K模型不仅可有效表征业务流的快挂业务特性,而且能仿真出该网络在业务负荷较重时潜在的运营风险,对实际网络运营管理具有重要的指导作用。Research on network measurement has shown the presence of self-similar properties in great number of network traces, but how to build self-similar queuing model and analyze it has been a problem. On the basis of hyper-erlang fitting method, M/HErd/1/K queuing model with passion arrive rate and hyper-erlang service time is pro-posed, and the queuing performance of the self-similar network service is derived. Compared with traditional M/M/1/K queuing model under real trace, new model effectively describes not only the quick-hang traffic attribute, but also the potential risk under heavy traffic load. So the proposed model is better, and it is instructive to the network operation and maintenance.

关 键 词：超爱尔兰分布 排队模型 自相似 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]