Status已發表Published
A Joining Shortest Queue with MAP Inputs
Zhaotong Lian1; Wenhui Zhou2; Baohe Su3
2009
Conference Name8th International Symposium on Operations Research and Its Applications
Source PublicationLecture Notes in Operations Research 8
Pages25-32
Conference Date2009.9.20-22
Conference PlaceOperations Research Society of China Zhangjiajie, China
PublisherWORLD PUBLISHING CORPORATION, 137 CHAONEI DAJIE, BEIJING 100010, PEOPLES R CHINA
Abstract

In this paper we study a MAP/M/K system with join-the-shortest-queue (JSQ) discipline 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 I In. 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 queueing measures, including stationary joint queuelength distribution and sojourn time distribution. We also compare the effect of JSQ and randomly-join-queue.

KeywordShortest Queue Map Level-expanding Sojourn Time Busy Period
Indexed ByCPCI-S
Language英語English
WOS Research AreaOperations Research & Management Science
WOS SubjectOperations Research & Management Science
WOS IDWOS:000274237200004
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionDEPARTMENT OF ACCOUNTING AND INFORMATION MANAGEMENT
University of Macau
Affiliation1.Faculty of Business Administration, University of Macau
2.School of Business Administration, South China University of Technology
3.Zhuhai College, Jinan University
First Author AffilicationFaculty of Business Administration
Recommended Citation
GB/T 7714
Zhaotong Lian,Wenhui Zhou,Baohe Su. A Joining Shortest Queue with MAP Inputs[C]:WORLD PUBLISHING CORPORATION, 137 CHAONEI DAJIE, BEIJING 100010, PEOPLES R CHINA, 2009, 25-32.
APA Zhaotong Lian., Wenhui Zhou., & Baohe Su (2009). A Joining Shortest Queue with MAP Inputs. Lecture Notes in Operations Research 8, 25-32.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhaotong Lian]'s Articles
[Wenhui Zhou]'s Articles
[Baohe Su]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhaotong Lian]'s Articles
[Wenhui Zhou]'s Articles
[Baohe Su]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhaotong Lian]'s Articles
[Wenhui Zhou]'s Articles
[Baohe Su]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.