多服务员串联排队的强逼近  

STRONG APPROXIMATION FOR A MULTI- SERVER SERIES STRUCTURE QUEUE

作　　者：胡冰[1] 韩海丽[1] 

机构地区：[1]北京邮电大学理学院,北京100876

出　　处：《山东师范大学学报（自然科学版）》2013年第1期11-15,19,共6页Journal of Shandong Normal University(Natural Science)

基　　金：中央高校基本科研业务费专项资金资助项目（BUPT2011RC0704）.

摘　　要：近年来，多服务员排队常用来为大型电话中心网络建模，以便分析其动态行为．笔者研究了一个多服务员串联排队系统，并假设到达过程为更新过程，服务时间独立同分布．利用随机过程极限，在服务强度大于等于1的条件下，得到了队长过程和加权闲期过程的强逼近，从而也将原离散的排队系统近似到一个连续的布朗运动过程，为该系统的进一步分析提供了理论基础．Recently, multi - server queue is usually used to model large call center network and to analyse its dynamic performance. We study a multi - server series structure queue, in which the arrival process is assumed to be renewal process and service times are assumed to be independent and identically distributed. Using stochastic process limit, we obtain the strong approximation of queue length and weighed idle processes under traffic intensity larger than or equal 1. As a result, we approximate the original discrete queueing system to a continuous Brownian motion system, which offer a basis for further theoretical research.

关 键 词：多服务员串联排队 强逼近 布朗运动 

分 类 号：O226[理学—运筹学与控制论]