A Joining Shortest Queue with MAP Inputs

摘要：

In this paper we study a MAP/M/K system with jointhe-shortest-queue (JSQ) disci pline which consists of k servers and k queues with infinite buffers. An arrival joins the shortest queue and in the case that there are n (n≤k) queues having the same shortest length, the customer will join any one of these shortest queues with probability 1/n. We model the system as a level expanding QBD (LDQBD) process with expanding-block-structured generator matrix by defining the sum of the multi-queue lengths as the level. This method enable us to quantify the regular queue ing measures, including stationary joint queue length distribution and sojourn time distribution. We also compare the effect of JSQ and randomly-joinqueue.

关键词： Queue MAP Level-ezpanding Sojourn Time Busy Period

作者: Zhaotong Lian Wenhui Zhou Baohe Su

作者单位: Faculty of Business Administration, University of Macau, Macau SAR, China School of Business Administration, South China University of Technology, China Zhuhai College, Jinan University, Zhuhai, Guangdong, China

会议类型: 国际会议

会议名称: The 8th International Symposium on Operations Research and Its Applications(第八届运筹及其应用国际专题讨论会 ISORA09)

会议地点: 张家界

会议语种:英文

页码: 25-32

在线出版日期: 2009-09-20（万方平台首次上网日期，不代表论文的发表时间）