Contributions to the Theory of Series Priority Queues |
Common terms and phrases
Abelian theorem absolutely convergent aggregate busy period analysis arrival epochs arrival process arriving item assume bona fide random bounded variation property busy period law C₂ characterize conditional probability continuous parameter process convergence d₂ define denote discrete parameter process easily seen employed event existence exponentially distributed follows identically distributed independent init interarrival item being processed item type items of type items processed Jaiswal 19 Kesten and Runnenburg kth machine Laplace transform Laplace-Stieltjes transforms lattice variable Lemma limit distribution Markov process notation number of items number of type occurs priority classes Priority Queues problem proof queue model queues in series Re(s regenerative structure renewal process satisfied Section 1.2 sequence Si,k single channel queue stationarity property susup total processing transition functions type i items type k busy zero avoiding transition ΣΑ ཝཱ