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

多服务员串联排队的强逼近
引用本文:胡冰,韩海丽. 多服务员串联排队的强逼近[J]. 山东师范大学学报(自然科学版), 2013, 28(1): 11-15,19
作者姓名:胡冰  韩海丽
作者单位:北京邮电大学理学院,100876,北京
基金项目:中央高校基本科研业务费专项资金资助项目
摘    要:近年来,多服务员排队常用来为大型电话中心网络建模,以便分析其动态行为.笔者研究了一个多服务员串联排队系统,并假设到达过程为更新过程,服务时间独立同分布.利用随机过程极限,在服务强度大于等于1的条件下,得到了队长过程和加权闲期过程的强逼近,从而也将原离散的排队系统近似到一个连续的布朗运动过程,为该系统的进一步分析提供了理论基础.

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

STRONG APPROXIMATION FOR A MULTI-SERVER SERIES STRUCTURE QUEUE
Hu Bing , Han Haili. STRONG APPROXIMATION FOR A MULTI-SERVER SERIES STRUCTURE QUEUE[J]. Journal of Shandong Normal University(Natural Science), 2013, 28(1): 11-15,19
Authors:Hu Bing    Han Haili
Affiliation:Hu Bing Han Haili ( School of Science, Beijing University of Posts and Telecommunications, 100876, Beijing, China )
Abstract: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.
Keywords:multi -server series structure queue  strong approximation  Brownian motion
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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