On the cycle maximum of birth-death processes and networks of queues
From MaRDI portal
Publication:6135888
DOI10.1016/j.indag.2023.06.001zbMath1524.60229arXiv2205.15929OpenAlexW4379879646MaRDI QIDQ6135888
Publication date: 28 August 2023
Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.15929
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality between the Erlang loss system and a finite source queue
- Asymptotically balanced functions and stochastic compactness of sample extremes
- Product form in networks of queues with batch arrivals and batch services
- Extremes and related properties of random sequences and processes
- Extreme values of birth and death processes and queues
- Extreme value theory for queues via cycle maxima
- A generalization of Norton's theorem for queueing networks
- On the Lambert \(w\) function
- Limit theorems for records from discrete distributions
- Busy period analysis of the state dependent M/M/1/K queue
- Exact-Order Asymptotic Analysis for Closed Queueing Networks
- Product forms for queueing networks with state-dependent multiple job transitions
- On the Cycle Maximum of Mountains, Dams and Queues
- Technical Note—On Normalizing Constants in Queueing Networks
- Maxima and exceedances of stationary Markov chains
- Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem
- A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates
- ON AN EQUIVALENCE BETWEEN LOSS RATES AND CYCLE MAXIMA IN QUEUES AND DAMS
- Extreme value theory for a class of discrete distributions with applications to some stochastic processes
- Technical Note—On a Formula Dual to Erlang's Loss Formula
- On the Stochastic Matrices Associated with Certain Queuing Processes
This page was built for publication: On the cycle maximum of birth-death processes and networks of queues