On two product form modifications for finite overflow systems

DOI10.1007/S10479-021-03940-5MaRDI QIDQ2115776zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 21 March 2022

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10479-021-03940-5

zbMATH Keywords

blocking probabilityinsensitivityproduct formstop protocolcall packingoverflow queues

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Markov renewal processes, semi-Markov processes (60K15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Traffic overflow in closed queueing models
• A proof of simple insensitive bounds for a pure overflow system
• Stochastic inequalities for an overflow model
• Individual Traffic Characteristics Queueing Systems with Multiple Poisson and Overflow Inputs
• Overflow networks: approximations and implications to call center outsourcing

Cites work

• scientific article; zbMATH DE number 3938204 (Why is no real title available?)
• scientific article; zbMATH DE number 3967618 (Why is no real title available?)
• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• A Characterization of Product-Form Queuing Networks
• A generalization of Norton's theorem for queueing networks
• A proof of simple insensitive bounds for a pure overflow system
• Approximation for overflow moments of a multiservice link with trunk reservation
• Capacity planning of a perinatal network with generalised loss network model with overflow
• Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
• Closed Queuing Systems with Exponential Servers
• Cyclic Queuing Systems with Restricted Length Queues
• Insensitive bounds for the stationary distribution of non-reversible Markov chains
• Insensitivity in stochastic models
• Insensitivity of blocking probabilities in a circuit-switching network
• Insensitivity of steady-state distributions of generalized semi-Markov processes. I
• Insensitivity of steady-state distributions of generalized semi-Markov processes. Part II
• Managing the overflow of intensive care patients
• Markov population processes
• Networks of Waiting Lines
• Networks of queues and the method of stages
• On practical product form characterizations
• On the Overflow Process from a Finite Markovian Queue
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Probability, Markov chains, queues, and simulation. The mathematical basis of performance modeling.
• Product-form and insensitivity in circuit-switched networks with failing links
• Queuing Networks with Population Size Constraints
• Reversed processes, product forms and a non-product form
• Stochastic inequalities for an overflow model
• Traffic overflow in loss systems with selective trunk reservation
• Weak convergence for generalized semi-Markov processes

Cited in

(3)

• Overflow networks: approximations and implications to call center outsourcing
• On the accuracy of the OPC approximation for a symmetric overflow loss model
• A proof of simple insensitive bounds for a pure overflow system

This page was built for publication: On two product form modifications for finite overflow systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115776)