REVIEW 4 cited by
Analysis of Markovian Arrivals and Service with Applications to Intermittent Overload
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In many important real-world queueing settings, arrival and service rates fluctuate over time. We consider the MAMS system, where the arrival and service rates each vary according to an arbitrary finite-state Markov chain, allowing intermittent overload to be modeled. This model has been extensively studied, and we derive results matching those found in the literature via a somewhat novel framework. We derive a characterization of mean queue length in the MAMS system, with explicit bounds for all arrival and service chains at all loads, using our new framework. Our bounds are tight in heavy traffic. We prove even stronger bounds for the important special case of two-level arrivals with intermittent overload. Our framework is based around the concepts of relative arrivals and relative completions, which have previously been used in studying the MAMS system, under different names. These quantities allow us to tractably capture the transient correlational effect of the arrival and service processes on the mean queue length.
Forward citations
Cited by 4 Pith papers
-
Adaptive Approximation Schemes for Matching Queues
Adaptive queue-length-based matching policies can be approximated to within (1 minus epsilon) in polynomial time for constant-size networks and for fixed-dimensional Euclidean networks with abandonment.
-
Improving Multiresource Job Scheduling with Markovian Service Rate Policies
A new class of Markov-chain-driven scheduling policies for multiresource jobs is throughput-optimal and admits additively tight mean response time bounds under preemptive, non-preemptive, and setup-time preemption models.
-
Learning in Strategic Queuing Systems with Small Buffers
With a one-packet buffer at each server, no-regret learning queues keep a strategic queueing system stable when total service capacity exceeds three times total arrival rate, and at least double capacity is necessary.
-
Transform Method for Stochastic Processing and Matching Networks
The transform method derives exact functional equations for steady-state queue-length transforms and recovers heavy-traffic limits and non-asymptotic tail bounds across a broad class of stochastic service networks.
Discussion (0). Continue with ORCID to comment.