Pith. sign in

REVIEW 1 cited by

Diffusion limits for networks of Markov-modulated infinite-server queues

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

arxiv 1712.04251 v1 pith:UPPSAQ5V submitted 2017-12-12 math.PR

classification math.PR
keywords processbackgroundlimitqueuesarrivalcentraldependdiffusion
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper studies the diffusion limit for a network of infinite-server queues operating under Markov modulation (meaning that the system's parameters depend on an autonomously evolving background process). In previous papers on (primarily single-node) queues with Markov modulation, two variants were distinguished: one in which the server speed is modulated, and one in which the service requirement is modulated (i.e., depends on the state of the background process upon arrival). The setup of the present paper, however, is more general, as we allow both the server speed and the service requirement to depend on the background process. For this model we derive a Functional Central Limit Theorem: we show that, after accelerating the arrival processes and the background process, a centered and normalized version of the network population vector converges to a multivariate Ornstein-Uhlenbeck process. The proof of this result relies on expressing the queueing process in terms of Poisson processes with a random time change, an application of the Martingale Central Limit Theorem, and continuous-mapping arguments.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal scheduling of critically loaded multiclass GI/M/n+M queues in an alternating renewal environment

    math.OC 2019-08 conditional novelty 7.0 of 10

    For multiclass many-server queues with alternating service interruptions and renewal arrivals in the Halfin-Whitt regime, the paper proves that the optimal diffusion-scale costs converge to the optimal costs of a limi...

Pith tools