自相似业务流下的排队性能分析  

Analysis of Queuing Performance of Self-Similar Traffic Input

作　　者：谢明[1] 叶梧[1] 冯穗力[1] 宋晖[2] 

机构地区：[1]华南理工大学电子与信息学院,广东广州510640 [2]华南师范大学物理与电信工程学院,广东广州510631

出　　处：《华南理工大学学报（自然科学版）》2006年第1期24-28,共5页Journal of South China University of Technology(Natural Science Edition)

基　　金：广东省自然科学基金资助项目(31391)

摘　　要：根据到达时间间隔服从Pareto分布的业务具有自相似性这一结论,利用剩余累积分布函数拟合和矩阵几何方法研究了Pareto分布到达时间间隔和负指数分布服务时间下的网络系统排队性能,并获得了Pareto/M/1/K队列平均排队队长和缓存溢出概率的近似结果.仿真结果表明这种方法具有较高的精确性.As all the traffics whose arrival time interval submits to Pareto distribution have the self-similarity, the queuing behavior of the network system with Pareto distribution inter-arrival time and negative exponential distribution service time distribution is investigated via the fitting technique of complementary cumulative distribution function and the matrix geometric method. The average queue length and buffer overflow probabihty of Pareto/M/1/K queue are then approximately derived. Simulated results are finally presented to verify the accuracy of the proposed method.

关 键 词：业务流 自相似性 排队性能 PARETO分布 超指数分布 相位分布 

分 类 号：TN911[电子电信—通信与信息系统]