Please use this identifier to cite or link to this item: https://doi.org/10.1007/s11134-012-9335-5
DC FieldValue
dc.titleDiffusion approximations for open Jackson networks with reneging
dc.contributor.authorHuang, J.
dc.contributor.authorZhang, H.
dc.date.accessioned2014-12-12T07:59:57Z
dc.date.available2014-12-12T07:59:57Z
dc.date.issued2013-08
dc.identifier.citationHuang, J., Zhang, H. (2013-08). Diffusion approximations for open Jackson networks with reneging. Queueing Systems 74 (4) : 445-476. ScholarBank@NUS Repository. https://doi.org/10.1007/s11134-012-9335-5
dc.identifier.issn02570130
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/116978
dc.description.abstractWe consider generalized Jackson networks with reneging in which the customer patience times follow a general distribution that unifies the patience time without scaling adopted by Ward and Glynn (Queueing Syst 50:371-400, 2005) and the patience time with hazard rate scaling and unbounded support adopted by Reed and Ward (Math Oper Res 33:606-644, 2008). The diffusion approximations for both the queue length process and the abandonment-count process are established under the conventional heavy traffic limit regime. In light of the recent work by Dai and He (Math Oper Res 35:347-362, 2010), the diffusion approximations are obtained by the following four steps: first, establishing the stochastic boundedness for the queue length process and the virtual waiting time process; second, obtaining the C-tightness and fluid limits for the queue length process and the abandonment-count process; then third, building an asymptotic relationship between the abandonment-count process and the queue length process in terms of the customer patience time. Finally, the fourth step is to get the diffusion approximations by invoking the continuous mapping theorem. © 2013 Springer Science+Business Media New York.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/s11134-012-9335-5
dc.sourceScopus
dc.subjectAbandonment-count process
dc.subjectDiffusion approximation
dc.subjectOpen Jackson network
dc.subjectQueue length process
dc.subjectReneging
dc.typeArticle
dc.contributor.departmentDECISION SCIENCES
dc.description.doi10.1007/s11134-012-9335-5
dc.description.sourcetitleQueueing Systems
dc.description.volume74
dc.description.issue4
dc.description.page445-476
dc.identifier.isiut000320961300004
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Jan 10, 2022

WEB OF SCIENCETM
Citations

2
checked on Jan 10, 2022

Page view(s)

130
checked on Jan 13, 2022

Google ScholarTM

Check

Altmetric


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