Rate Conservation Laws for Multidimensional Processes of Bounded Variation with Applications to Priority Queueing Systems
Fabrice Guillemin () and
Ravi Mazumdar ()
Additional contact information
Fabrice Guillemin: France Telecom R&D
Ravi Mazumdar: Purdue University
Methodology and Computing in Applied Probability, 2004, vol. 6, issue 2, 135-159
Abstract:
Abstract In this paper we derive a multidimensional version of the rate conservation law (RCL) for càdlàg processes of bounded variation. These results are then used to analyze queueing models which have a natural multidimensional characterization, such as priority queues. In particular the RCL is used to establish certain conservation laws between the idle probabilities for such queues. We use the relations to provide a detailed analysis of preemptive resume priority queues with M/G inputs. Special attention is paid to the validity of the so-called reduced service rate approximation.
Keywords: rate conservation; jump processes; bounded variation; priority (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1023/B:MCAP.0000017710.98631.46 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:6:y:2004:i:2:d:10.1023_b:mcap.0000017710.98631.46
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009
DOI: 10.1023/B:MCAP.0000017710.98631.46
Access Statistics for this article
Methodology and Computing in Applied Probability is currently edited by Joseph Glaz
More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().