On the cycle maximum of birth-death processes and networks of queues
From MaRDI portal
(Redirected from Publication:6135888)
Abstract: This paper considers the cycle maximum in birth-death processes as a stepping stone to characterisation of the cycle maximum in single queues and open Kelly-Whittle networks of queues. For positive recurrent birth-death processes we show that the sequence of sample maxima is stochastically compact. For transient birth-death processes we show that the sequence of sample maxima conditioned on the maximum being finite is stochastically compact. We show that the Markov chain recording the total number of customers in a Kelly-Whittle network is a birth-death process with birth and death rates determined by the normalising constants in a suitably defined sequence of closed networks. Explicit or asymptotic expressions for these normalising constants allow asymptotic evaluation of the birth and death rates, which, in turn, allows characterisation of the cycle maximum in a single busy cycle, and convergence of the sequence of sample maxima for Kelly-Whittle networks of queues.
Recommendations
- Extreme values of birth and death processes and queues
- On cycle maxima, first passage problems and extreme value theory for queues
- Maximum entropy two-station cyclic queues with multiple general servers
- Some universal limits for nonhomogeneous birth and death processes
- Weak convergence limits for closed cyclic networks of queues with multiple bottleneck nodes
Cites work
- A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates
- A generalization of Norton's theorem for queueing networks
- Asymptotically balanced functions and stochastic compactness of sample extremes
- Busy period analysis of the state dependent M/M/1/K queue
- Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem
- Duality between the Erlang loss system and a finite source queue
- Exact-order asymptotic analysis for closed queueing networks
- Extreme value theory for a class of discrete distributions with applications to some stochastic processes
- Extreme value theory for queues via cycle maxima
- Extreme value theory. An introduction.
- Extreme values of birth and death processes and queues
- Extremes and related properties of random sequences and processes
- scientific article; zbMATH DE number 4013703 (Why is no real title available?)
- scientific article; zbMATH DE number 3174015 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 193528 (Why is no real title available?)
- Limit theorems for records from discrete distributions
- Maxima and exceedances of stationary Markov chains
- ON AN EQUIVALENCE BETWEEN LOSS RATES AND CYCLE MAXIMA IN QUEUES AND DAMS
- On the Cycle Maximum of Mountains, Dams and Queues
- On the Lambert \(w\) function
- On the Stochastic Matrices Associated with Certain Queuing Processes
- Product form in networks of queues with batch arrivals and batch services
- Product forms for queueing networks with state-dependent multiple job transitions
- Technical Note—On a Formula Dual to Erlang's Loss Formula
- Technical Note—On Normalizing Constants in Queueing Networks
Cited in
(2)
This page was built for publication: On the cycle maximum of birth-death processes and networks of queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135888)
