Takács' asymptotic theorem and its applications: a survey
From MaRDI portal
Publication:966495
DOI10.1007/S10440-008-9337-9zbMath1192.60099arXiv0712.2480OpenAlexW2952242515MaRDI QIDQ966495
Publication date: 23 April 2010
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.2480
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
Optimal control of a large dam with compound Poisson input and costs depending on water levels ⋮ Crossings states and sets of states in random walks ⋮ Statistical analysis of single-server loss queueing systems
Cites Work
- 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
- Heavy-traffic limits for loss proportions in single-server queues
- A link between wave governed random motions and ruin processes
- Buffer overflow period in a MAP queue
- Consecutive customer losses in oscillating \(GI^X/M//n\) systems with state dependent services rates
- \(q\)-generalization of a ballot problem
- Some comments on a theorem of Hardy and Littlewood
- Bertrand's work on probability
- Queueing and fluid analysis of partial message discarding policy
- Exact convergence rate for the distributions of \(GI\)/\(M\)/\(c\)/\(K\) queue as \(K\) tends to infinity
- Asymptotic analysis of the \(GI/M/1/n\) loss system as \(n\) increases to infinity
- Sample path large deviations for queues with many inputs
- On the remaining service time upon reaching a given level in \(M/G/1\) queues
- The output of a switch, or, effective bandwidths for networks
- Consecutive customer losses in regular and oscillating \(M^{X}/ G /1/ n\) systems
- The ballot theorem strikes again: packet loss process distribution
- Sharp results on convergence rates for the distribution of GI/M/1/K queues as K tends to infinity
- Optimal control of a finite dam using PMλΤ policies and penalty cost: total discounted and long run average cases
- The Effective Bandwidth Problem Revisited
- First-crossing and ballot-type results for some nonstationary sequences
- On finite-time ruin probabilities for classical risk models
- Optimal control of a finite dam: Wiener process input
- A note on the equilibrium M/G/1 queue length
- Ballots, queues and random graphs
- A batch-ballot problem and applications
- Analysis of packet loss processes in high-speed networks
- A single-server queue with limited virtual waiting time
- Combinatorial and analytic methods in the theory of queues
- 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
- On the Busy Periods of Single-Server Queues with Poisson Input and General Service Times
- Two-stage output procedure of a finite dam
- PλM-policy for a dam with input formed by a compound Poisson process
- A comparison of the stationary distributions of GI/M/c/n and GI/M/c
- On a property of a refusals stream
- Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach
- Optimal control of finite dams: discrete (2-stage) output procedure
- Characterizing losses during busy periods in finite buffer systems
- Average cost under the PMλ, τ policy in a finite dam with compound Poisson inputs
- Optimal control of a dam using Pλ,τM policies and penalty cost when the input process is a compound Poisson process with positive drift
- Optimal stopping on trajectories and the ballot problem
- On losses inMX/GI/1/nqueues
- On loss probabilities in presence of redundant packets and several traffic sources
- Losses per cycle in a single-server queue
- Asymptotic Behavior of the Number of Lost Messages
- A note on losses in M/GI/1/n queues
- ON THE NUMBER OF REFUSALS IN A BUSY PERIOD
- Optimal Control of a Large Dam
- On dams of finite capacity
- On the Classical Ruin Problems
- 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
- On the length and number of served customers of the busy period of a generalised M/G/1 queue with finite waiting room
- Complementary generating functions for theMX/GI/1/kandGI/My/1/Kqueues and their application to the comparison of loss probabilities
- Asymptotic behavior of loss probability in GI/M/1/\(K\) queue as \(K\) tends to infinity
- The remaining service time upon reaching a high level in \(M/G/1\) queues
This page was built for publication: Takács' asymptotic theorem and its applications: a survey