Open Access System for Information Sharing

Login Library

 

Working Paper
Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
DC FieldValueLanguage
dc.contributor.authorKo, Young Myoung-
dc.contributor.authorPender, Jamol-
dc.date.accessioned2016-01-26T02:57:01Z-
dc.date.available2015-06-10T06:44:47Z-
dc.date.available2016-01-26T02:57:01Z-
dc.date.created2015-06-10-
dc.date.issued2015-06-10-
dc.identifier.citation-en_US
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/9197-
dc.description.abstractThis paper presents a novel methodology for approximating the queue length (thenumber of customers in the system) distributions of time-varying non-Markovian manyserverqueues (e.g., Gt/Gt/nt queues), where the number of servers (nt) is large. Ourmethodology consists of two steps. The first step uses phase-type distributions toapproximate the general inter-arrival and service times, thus generating an approximatingP ht/P ht/nt queue. The second step develops strong approximation theory toapproximate the P ht/P ht/nt queue with fluid and diffusion limits. However, by naivelyrepresenting the P ht/P ht/nt queue as a Markov process by expanding the state space,we encounter the lingering phenomenon even when the queue is overloaded. Lingeringtypically occurs when the mean queue length is equal or near the number of servers,however, in this case it also happens when the queue is overloaded and this time is notof zero measure. As a result, we develop an alternative representation for the queuelength process that avoids the lingering problem in the overloaded case, thus allowingfor the derivation of a Gaussian diffusion limit. Finally, we compare the effectivenessof our proposed method with discrete event simulation in a variety parameter settingsand show that our approximations are very accurate.en_US
dc.language.isoenen_US
dc.publisher-en_US
dc.titleApproximations for the Queue Length Distributions of Time-Varying Many-Server Queuesen_US
dc.title.alternativeAn approximation algorithm for the queue length distributions of time-varying many-server queuesen_US
dc.typeWorking Paperen_US
dc.date.updated2015-06-11-
dc.identifier.doi-en_US

qr_code

  • mendeley

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

Views & Downloads

Browse