Rare events in queueing systems -- A survey
From MaRDI portal
Publication:1324094
DOI10.1007/BF01158947zbMath0804.90059OpenAlexW2078545019MaRDI QIDQ1324094
Publication date: 18 May 1994
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158947
large deviationsperturbation analysisvariance reductionrepairable systemsbusy periodtriangular schemequeueing processessmall parameter methodregenerative simulationprobabilities of rare events
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Boundedness conditions for relative error in fast simulation of reliability of non-Markovian systems, Asymptotic distribution of the downtime of a monotone system, Ergodic and light traffic properties of a complex repairable system, Nonlinearly Perturbed Stochastic Processes and Systems, Markov-modulated finite-source queueing models in evaluation of computer and communication systems, Flows of rare events for regularly perturbed semi-Markov processes, Necessary and sufficient conditions for convergence of first-rare-event-time processes for perturbed semi-Markov processes, Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes, Processor sharing: a survey of the mathematical theory, A review of my scientific publications. Masters and coworkers, Estimating reliability parameters under insufficient information, Evaluation of steady state probabilities of the \(\bullet/\mathrm{G}/\infty\) queuing system for different input flow models, A Taylor series approach for service-coupled queueing systems with intermediate load, A Maclaurin-series expansion approach to multiple paired queues, Light-traffic analysis of random access systems without collisions, A Poisson Limit Theorem for Reliability Models Based on Markov Chains, Taylor-series approximations for queues with arrival correlation, Reliability analysis of complex communication systems, I. N. Kovalenko's scientific works, Simulation of monotone failures of a system with different orders of smallness of random variables that determine its functioning, Comparative analysis of two modified fast simulation methods for evaluation of the failure probability of a rank structure system
Cites Work
- A complete coupling proof of Blackwell's renewal theorem
- The queue GI/G/1: Finite moments of the cycle variables and uniform rates of convergence
- Ladder heights and the Markov-modulated M/G/1 queue
- Error bounds for exponential approximations of geometric convolutions
- Conjugate processes and the simulation of ruin problems
- On the use of stochastic processes in modeling reliability problems
- Approximations for waiting time in GI/G/1 systems
- Simulation methods of queues: An overview
- A new proof of finite moment conditions for GI/G/1 busy periods
- Markov and Markov reward model transient analysis: An overview of numerical approaches
- Uniform estimate of reliability for a complex regenerated system with unlimited number of repairs units
- Construction of a stationary regenerative process
- Phase-type representations in random walk and queueing problems
- Light traffic equivalence in single-server queues
- An introduction to the regenerative method for simulation analysis
- Sample-path analysis of processes with imbedded point processes
- Regenerative queueing processes and their qualitative and quantitative analysis
- Second-order approximation to the characteristic function of certain point-process integrals
- On remaining full busy periods of GI/G/c queues and their relation to stationary point processes
- Asymptotic methods in reliability theory: a review
- Waiting-Time Percentiles in the Multi-server Mx/G/c Queue with Batch Arrivals
- Some results on renewal equations
- On the busy period distribution of the M/G/2 queueing system
- The coupling of regenerative processes
- An algorithmic approach to non-homogeneous semi-markov processes
- On the busy-period distributions of M/G/1/K queues by state-dependent arrivals and FCFS/LCFS-P service disciplines
- Finiteness of moments of partial busy periods for M/G/C queues
- A queue with service times dependent on their order within the busy periods
- Approximation of the queue-length distribution of an M/GI/s queue by the basic equations
- Perturbation theory for unbounded Markov reward processes with applications to queueing
- Perturbation theory for Markov reward processes with applications to queueing systems
- A note on the equilibrium M/G/1 queue length
- Large deviation results for time-dependent queue length distributions
- Transient analysis of a m/m/r machine interference model
- Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks
- Exponential expansion for the tail of the waiting-time probability in the single-server queue with batch arrivals
- Open Queueing Systems in Light Traffic
- Applications of limit theorems for switching processes
- Assessing the reliability of a system with checking and preventive maintenance by the analytical-statistical method
- Transient and busy period analysis of the GIG/1 Queue as a Hilbert factorization problem
- Analytical-statistical estimates for some reliability and efficiency measures of semi-Markov systems
- Queueing Simulation in Heavy Traffic
- The abscissa of convergence of the Laplace transform
- On cycle maxima, first passage problems and extreme value theory for queues
- A Variant of the Conditional Expectation Variance Reduction Technique and Its Application to the Simulation of the GI/G/1 Queues
- Stationarity detection in the initial transient problem
- Limit Theorems for Dissipative Flows
- The probability generating functional
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
