Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers

DOI10.1007/s00186-017-0623-zzbMath1403.90242OpenAlexW2768274186MaRDI QIDQ1650848

Sunggon Kim

Publication date: 13 July 2018

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-017-0623-z

zbMATH Keywords

impatient customersdiscriminatory processor sharingtime scale decomposition methodsojourn time distribution

Mathematics Subject Classification ID

Gaussian processes (60G15) Queues and service in operations research (90B22)

Uses Software

• invLT

Cites Work

• Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers
• 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 survey on discriminatory processor sharing
• The Differential Equations of Birth-and-Death Processes, and the Stieltjes Moment Problem
• Sharing a Processor Among Many Job Classes
• Direct Solutions of M/G/1 Processor-Sharing Models
• Some Properties of Continued Fractions with Applications in Markov Processes
• Processor-shared buffers with reneging
• Tail asymptotics for processor-sharing queues
• Laplace transform inversions using optimal contours in the complex plane
• Time-shared Systems
• Unnamed Item
• Unnamed Item