Factorized time-dependent distributions for certain multiclass queueing networks and an application to enzymatic processing networks

Authors:
W. H. Mather;J. Hasty;L. S. Tsimring;R. J. Williams
Affiliations:
BioCircuits Institute, University of California, San Diego, USA and Department of Bioengineering, University of California, San Diego, USA;BioCircuits Institute, University of California, San Diego, USA and Department of Bioengineering, University of California, San Diego, USA and Molecular Biology Section, Division of Biological Sci ...;BioCircuits Institute, University of California, San Diego, USA;BioCircuits Institute, University of California, San Diego, USA and Department of Mathematics, University of California, San Diego, La Jolla, USA 92093-0112
Venue:
Queueing Systems: Theory and Applications
Year:
2011

Citing 5
Cited 0

Discrete flow networks: bottleneck analysis and fluid approximations

Mathematics of Operations Research
Numerical Recipes in C++: the art of scientific computing

Numerical Recipes in C++: the art of scientific computing
Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse

Queueing Systems: Theory and Applications
State space collapse with application to heavy traffic limits for multiclass queueing networks

Queueing Systems: Theory and Applications
The equivalence between processor sharing and service in random order

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by applications in biological systems, we show for certain multiclass queueing networks that time-dependent distributions for the multiclass queue-lengths can have a factorized form which reduces the problem of computing such distributions to a similar problem for related single-class queueing networks. We give an example of the application of this result to an enzymatic processing network.