Realization probability and throughput sensitivity in a closed jackson network
Copyright policy )Realization probability and throughput sensitivity in a closed jackson network
Realization probability is a new concept pertaining to perturbation analysis of closed queuing networks. The sensitivities of throughputs in a closed single-class Jackson network can be expressed in terms of realization probabilities. In this paper, based on a discussion of perturbation analysis for networks with state-dependent service rates, we derive some new formulas for sensitivities of throughputs using realization probability.
queueing networks, Applications of Markov renewal processes (reliability, queueing networks, etc.), perturbed closed Jackson networks, sensitivity, Queueing theory (aspects of probability theory)
queueing networks, Applications of Markov renewal processes (reliability, queueing networks, etc.), perturbed closed Jackson networks, sensitivity, Queueing theory (aspects of probability theory)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!