Tandem queues with subexponential service times and finite buffers
From MaRDI portal
(Redirected from Publication:600897)
Recommendations
- Asymptotics of stochastic networks with subexponential service times
- Tandem queues with blocking: A comparison between dependent and independent service
- Stationary tail asymptotics of a tandem queue with feedback
- New bounds for expected cycle times in tandem queues with blocking
- On the exact asymptotics for the stationary sojourn time distribution in a tandem of queues with light-tailed service times
Cites work
- scientific article; zbMATH DE number 3662270 (Why is no real title available?)
- scientific article; zbMATH DE number 627763 (Why is no real title available?)
- scientific article; zbMATH DE number 3322619 (Why is no real title available?)
- A General Class of Closed Fork and Join Queues with Subexponential Service Times
- An Approximation Method for Tandem Queues with Blocking
- Asymptotic expansions for waiting time probabilities in an \(M/G/1\) queue with long-tailed service time
- Asymptotics of stochastic networks with subexponential service times
- Asymptotics of subexponential max plus networks: the stochastic event graph case
- Convolution tails, product tails and domains of attraction
- Cyclic queueing networks with subexponential service times
- Discrete and continuous time modulated random walks with heavy-tailed increments
- Estimates for the probability of ruin with special emphasis on the possibility of large claims
- Heavy tails in multi-server queue
- LOWER BOUNDS FOR LRD/GI/1 QUEUES WITH SUBEXPONENTIAL SERVICE TIMES
- Large claims approximations for risk processes in a Markovian environment
- Large tandem queueing networks with blocking
- Moments and tails in monotone-separable stochastic networks.
- On convolution tails
- On the subexponential properties in stationary single-server queues: a Palm-martingale approach
- On the tails of waiting-time distributions
- Packet reordering in networks with heavy-tailed delays
- Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
- Sampling at subexponential times, with queueing applications
- Steady-state asymptotics for tandem, split-match and other feedforward queues with heavy tailed service
- Subexponential asymptotics for stochastic processes: Extremal behavior, stationary distributions and first passage probabilities
- Subexponential asymptotics of a Markov-modulated random walk with queueing applications
- Subexponential asymptotics of the waiting time distribution in a single-server queue with multiple Markovian arrival streams
- Tail asymptotics for M/G/1 type queueing processes with subexponential increments
- Tails for (max, plus) recursions under subexponentiality
- Tails in generalized Jackson networks with subexponential service-time distributions
- The impact of a heavy-tailed service-time distribution upon the \(\text{M}/\text{GI}/s\) waiting-time distribution
Cited in
(13)- A General Class of Closed Fork and Join Queues with Subexponential Service Times
- Explicit expressions for moments of waiting times in Poisson driven deterministic two-node tandem queues with blocking
- scientific article; zbMATH DE number 4048817 (Why is no real title available?)
- Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times
- Bounds for the expected delays in some tandem queues
- Asymptotic properties of first passage times for two tandem queues:time to empty the system
- Large tandem queueing networks with blocking
- scientific article; zbMATH DE number 5812604 (Why is no real title available?)
- Simple bounds and monotonicity results for finite multi-server exponential tandem queues
- Exact tail asymptotics of a tandem queue with LRD service times
- Response time in a tandem queue with blocking, Markovian arrivals and phase-type services
- Bounding the performance of tandem queues with finite buffer spaces
- Asymptotic results on infinite tandem queueing networks
This page was built for publication: Tandem queues with subexponential service times and finite buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600897)
