On a processor sharing queue that models balking

DOI10.1007/S00186-010-0328-ZzbMATH Open1203.93153arXiv0905.3700OpenAlexW2126779148MaRDI QIDQ607679FDOQ607679

Authors: Qiang Zhen, Johan S. H. van Leeuwaarden, Charles Knessl 

Publication date: 3 December 2010

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

Abstract: We consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system "balks" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to $n+1$, we obtain explicit expressions for a tagged customer's sojourn time distribution. We consider both the conditional distribution, conditioned on the number of other customers present when the tagged customer arrives, as well as the unconditional distribution. We then evaluate the results in various asymptotic limits. These include large time (tail behavior) and/or large $n$, lightly loaded systems where the arrival rate $lambdao0$, and heavily loaded systems where $lambdaoinfty$. We find that the asymptotic structure for the problem with balking is much different from the standard $M/M/1$-PS queue. We also discuss a perturbation method for deriving the asymptotics, which should apply to more general balking functions.

Full work available at URL: https://arxiv.org/abs/0905.3700

Recommendations

• On the sojourn time distribution in a finite population Markovian processor sharing queue
• Sojourn time distribution in some processor-shared queues
• Markovian queueing system with random balking
• An analysis of steady-state distribution in \(M/M/1\) queueing system with balking based on concept of statistical mechanics
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue

zbMATH Keywords

asymptoticsqueueing theorybalkingprocessor sharing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Automated systems (robots, etc.) in control theory (93C85) Stochastic systems in control theory (general) (93E03)

Cites Work

• On the Lambert \(w\) function
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the sojourn time distribution in a finite capacity processor shared queue
• Waiting Time Distributions for Processor-Sharing Systems
• Fluid limits for processor-sharing queues with impatience
• The waiting time distribution for the random order service \(M/M/1\) queue
• The equivalence between processor sharing and service in random order.
• Response-Time Distribution for a Processor-Sharing System
• QUEUEING WITH BALKING
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
• On sojourn times in the \(M/M/1\)-PS model, conditioned on the number of other users
• On processor sharing and random service
• Analysis of A time‐shared processor
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis of the M/M/1 queue with processor sharing via spectral theory

Cited In (5)

• A Processor-Shared Queue That Models Switching Times: Normal Usage
• Title not available (Why is that?)
• An analysis of steady-state distribution in \(M/M/1\) queueing system with balking based on concept of statistical mechanics
• Additive functionals with application to sojourn times in infinite-server and processor sharing systems
• When random-order-of-service outperforms first-come-first-served

This page was built for publication: On a processor sharing queue that models balking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607679)