A queueing theoretical proof of increasing property of Polya frequency functions

DOI10.1016/0167-7152(95)00015-1zbMath0851.60090OpenAlexW1968839625MaRDI QIDQ1914308

Ryszard Szekli, Hans Daduna

Publication date: 5 June 1996

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-7152(95)00015-1

zbMATH Keywords

queueing networksPolya frequency counting density functions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (8)

Peacocks Obtained by Normalisation: Strong and Very Strong Peacocks ⋮ Stochastic monotonicity of dependent variables given their sum ⋮ Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates ⋮ Product Form Models for Queueing Networks with an Inventory ⋮ MRL order, log-concavity and an application to peacocks ⋮ Availability Formulas and Performance Measures for Separable Degradable Networks ⋮ On the Correlation Structure of Closed Queueing Networks ⋮ Computable Bounds on the Spectral Gap for Unreliable Jackson Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A concept of negative dependence using stochastic ordering
• The preservation of likelihood ratio ordering under convolution
• Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
• Markov chain models - rarity and exponentiality
• Negative association of random variables, with applications
• On uniform conditional stochastic order conditioned on planar regions
• A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
• The effect of increasing service rates in a closed queueing network
• Throughput bounds for closed queueing networks with queue-dependent service rates
• Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
• Second-Order Properties of the Throughput of a Closed Queueing Network
• Stochastic monotonicity in general queueing networks
• Dependencies in Markovian networks
• On stochastic comparison of random vectors
• Increasing Properties of Polya Frequency Function
• Networks of Waiting Lines
• Closed Queuing Systems with Exponential Servers
• Convergence of stochastic processes

This page was built for publication: A queueing theoretical proof of increasing property of Polya frequency functions