Infinitesimal perturbation analysis of the M/G/1/K queue

Weibo Gong · Paul Glasserman

11 citations0/0 files storedIEEE Conference on Decision and Control (CDC)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Simulation Techniques and Applications Petri Nets in System Modeling

Abstract

Infinitesimal perturbation analysis (IPA) estimation algorithms are developed for an M/G/1/K queue using the equivalence relation between the M/G/1/K queue and a queue in a two-server cyclic network. The algorithm can be derived directly from an alternative representation of the sample paths of the M/G/1/K queue as a function of the decision parameters. The consistency of the algorithm is proved for the case of an M/M/1/K queue. The results can be useful in decentralized optimization of computer networks.>

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 11 citations exist upstream.

References

1983Perturbation analysis and optimization of queueing networks 1989Sensitivity Analysis for Simulations via Likelihood Ratios 1988Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue 1987Smoothed (conditional) perturbation analysis of discrete event dynamical systems 1980Continuity of Generalized Semi-Markov Processes 1988Convergence Properties of Infinitesimal Perturbation Analysis Estimates 1984Convergence of parameter sensitivity estimates in a stochastic experiment 1987Infinitesimal perturbation analysis for general discrete event systems

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.