Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers

DOI10.1016/j.jkss.2013.04.001zbMath1295.60103OpenAlexW2086927498MaRDI QIDQ395942

Sunggon Kim

Publication date: 7 August 2014

Published in: Journal of the Korean Statistical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jkss.2013.04.001

zbMATH Keywords

impatient customersqueue length distributiondiscriminatory processor sharingtime scale decomposition method

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers ⋮ Security screening queues with impatient applicants: a new model with a case study

Cites Work

• Unnamed Item
• Discriminatory processor sharing queues with stationary ergodic service times and the performance of TCP in overload
• A decomposition theorem and related results for the discriminatory processor sharing queue
• Congestion at flow level and the impact of user behaviour.
• A diffusion approximation for a Markovian queue with reneging
• Mean sojourn times for phase-type discriminatory processor sharing systems
• A survey on discriminatory processor sharing
• Fluid Limits for Processor-Sharing Queues with Impatience
• Sharing a Processor Among Many Job Classes
• Processor-shared buffers with reneging
• Tail asymptotics for processor-sharing queues
• Time-shared Systems
• Queue-Length Distribution for the Discriminatory Processor-Sharing Queue

This page was built for publication: Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers