Takács' asymptotic theorem and its applications: a survey
From MaRDI portal
Publication:966495
DOI10.1007/S10440-008-9337-9zbMATH Open1192.60099arXiv0712.2480OpenAlexW2952242515MaRDI QIDQ966495FDOQ966495
Authors: Vyacheslav Abramov
Publication date: 23 April 2010
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Abstract: The book of Lajos Tak'acs emph{Combinatorial Methods in the Theory of Stochastic Processes} has been published in 1967. It discusses various problems associated with P_{k,i}=mathrm{P}{sup_{1leq nleq
ho(i)}(N_n-n)<k-i},leqno(*) where is a sum of mutually independent, nonnegative integer and identically distributed random variables, , , , and is the smallest such that , . (If there is no such , then .) (*) is a discrete generalization of the classic ruin probability, and its value is represented as , where the sequence satisfies the recurrence relation of convolution type: and . Since 1967 there have been many papers related to applications of the generalized classic ruin probability. The present survey concerns only with one of the areas of application associated with asymptotic behavior of as . The theorem on asymptotic behavior of as and further properties of that limiting sequence are given on pages 22-23 of the aforementioned book by Tak'acs. In the present survey we discuss applications of Tak'acs' asymptotic theorem and other related results in queueing theory, telecommunication systems and dams. Many of the results presented in this survey have appeared recently, and some of them are new. In addition, further applications of Tak'acs' theorem are discussed.
Full work available at URL: https://arxiv.org/abs/0712.2480
Recommendations
- The work of Lajos Takács on probability theory
- scientific article; zbMATH DE number 1040052
- Tail asymptotics for Pollaczek-Khinchin type series with applications to ruin in perturbed model
- scientific article; zbMATH DE number 4069933
- An extension to the renewal theorem and an application to risk theory
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Bertrand's work on probability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite-time ruin probabilities for classical risk models
- Title not available (Why is that?)
- Title not available (Why is that?)
- A link between wave governed random motions and ruin processes
- Optimal control of finite dams: discrete (2-stage) output procedure
- Title not available (Why is that?)
- Some comments on a theorem of Hardy and Littlewood
- Optimal Control of a Large Dam
- The Effective Bandwidth Problem Revisited
- Asymptotic analysis of the \(GI/M/1/n\) loss system as \(n\) increases to infinity
- Consecutive customer losses in regular and oscillating \(M^{X}/ G /1/ n\) systems
- On a property of a refusals stream
- Asymptotic Behavior of the Number of Lost Messages
- Complementary generating functions for theMX/GI/1/kandGI/My/1/Kqueues and their application to the comparison of loss probabilities
- Ballots, queues and random graphs
- Title not available (Why is that?)
- A single-server queue with limited virtual waiting time
- Losses per cycle in a single-server queue
- A note on losses in M/GI/1/n queues
- Sample path large deviations for queues with many inputs
- Optimal control of a finite dam using PMλΤ policies and penalty cost: total discounted and long run average cases
- Two-stage output procedure of a finite dam
- Optimal control of a dam using Pλ,τM policies and penalty cost when the input process is a compound Poisson process with positive drift
- Heavy-traffic limits for loss proportions in single-server queues
- Optimal control of a finite dam: Wiener process input
- PλM-policy for a dam with input formed by a compound Poisson process
- Average cost under the PMλ, τ policy in a finite dam with compound Poisson inputs
- First-crossing and ballot-type results for some nonstationary sequences
- On the relationship between the distribution of maximal queue length in the M/G/1 queue and the mean busy period in the M/G/1/n queue
- Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach
- Combinatorial and analytic methods in the theory of queues
- Exact convergence rate for the distributions of \(GI\)/\(M\)/\(c\)/\(K\) queue as \(K\) tends to infinity
- A comparison of the stationary distributions of GI/M/c/n and GI/M/c
- A note on the equilibrium M/G/1 queue length
- The remaining service time upon reaching a high level in \(M/G/1\) queues
- The ballot theorem strikes again: Packet loss process distribution
- Title not available (Why is that?)
- Analysis of packet loss processes in high-speed networks
- On loss probabilities in presence of redundant packets and several traffic sources
- Asymptotic behavior of loss probability in GI/M/1/\(K\) queue as \(K\) tends to infinity
- Title not available (Why is that?)
- On the Classical Ruin Problems
- On the remaining service time upon reaching a given level in \(M/G/1\) queues
- Buffer overflow period in a MAP queue
- Title not available (Why is that?)
- Characterizing losses during busy periods in finite buffer systems
- On losses inMX/GI/1/nqueues
- Consecutive customer losses in oscillating \(GI^X/M//n\) systems with state dependent services rates
- Queueing and fluid analysis of partial message discarding policy
- \(q\)-generalization of a ballot problem
- The output of a switch, or, effective bandwidths for networks
- Sharp results on convergence rates for the distribution of \(\text{GI}/ \text{M}/1/K\) queues as \(K\) tends to infinity
- Title not available (Why is that?)
- Title not available (Why is that?)
- A batch-ballot problem and applications
- On the Busy Periods of Single-Server Queues with Poisson Input and General Service Times
- Optimal stopping on trajectories and the ballot problem
- ON THE NUMBER OF REFUSALS IN A BUSY PERIOD
- On dams of finite capacity
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the distribution of the maximum of sums of mutually independent and identically distributed random variables
- On the busy periods for the M/G/1 queue with finite and with infinite waiting room
- Title not available (Why is that?)
- On the length and number of served customers of the busy period of a generalised M/G/1 queue with finite waiting room
Cited In (4)
This page was built for publication: Takács' asymptotic theorem and its applications: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966495)