Factorization identities for reflected processes, with applications
From MaRDI portal
Publication:2854072
Abstract: We derive factorization identities for a class of preemptive-resume queueing systems, with batch arrivals and catastrophes that, whenever they occur, eliminate multiple customers present in the system. These processes are quite general, as they can be used to approximate Levy processes, diffusion processes, and certain types of growth-collapse processes; thus, all of the processes mentioned above also satisfy similar factorization identities. In the Levy case, our identities simplify to both the well-known Wiener-Hopf factorization, and another interesting factorization of reflected Levy processes starting at an arbitrary initial state. We also show how the ideas can be used to derive transforms for some well-known state-dependent/inhomogeneous birth-death processes and diffusion processes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3866301 (Why is no real title available?)
- scientific article; zbMATH DE number 1460450 (Why is no real title available?)
- scientific article; zbMATH DE number 3309705 (Why is no real title available?)
- scientific article; zbMATH DE number 3093719 (Why is no real title available?)
- A Lévy input model with additional state-dependent services
- A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
- A path decomposition for Markov processes
- An Introduction to the Theory of Point Processes
- An Introduction to the Theory of Point Processes
- Analytic proof of Pecherskii-Rogozin identity and Wiener-Hopf factorization
- Applied Probability and Queues
- Calculating transient characteristics of the erlang loss model by numerical transform inversion
- Fluctuation identities for lévy processes and splitting at the maximum
- Fluctuation theory in continuous time
- Lévy processes with adaptable exponent
- Markov Chains
- Numerical Inversion of Laplace Transforms of Probability Distributions
- On the First Passage Time Across a Given Level for Processes with Independent Increments
- On the infimum attained by a reflected Lévy process
- On the time-dependent moments of Markovian queues with reneging
- The First Passage Problem for a Continuous Markov Process
- The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions
- The moments of the \(M\)/\(M\)/\(s\) queue length process
- Time-Dependent Solution of the Many-Server Poisson Queue
- Transient analysis of reflected Lévy processes
- Transient behavior of regulated Brownian motion, II: Non-zero initial conditions
- Transient behavior of the M/M/1 queue via Laplace transforms
- Transient behavior of the M/M/1 queue: Starting at the origin
Cited in
(5)- On the study of the running maximum and minimum level of level-dependent quasi-birth–death processes and related models
- Transient analysis of a stationary Lévy-driven queue
- On classes of Bitcoin-inspired infinite-server queueing systems
- On the time-dependent behavior of preemptive single-server queueing systems with Poisson arrivals
- Different versions of ILU and IUL factorizations obtained from forward and backward factored approximate inverse processes. I
This page was built for publication: Factorization identities for reflected processes, with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854072)
