Tandem queues with subexponential service times and finite buffers
type: Item
instance of: scholarly article
title: Tandem queues with subexponential service times and finite buffers
zbMATH Open document ID: 1205.60159
author: Jung-Kyung Kim
author: Hayriye Ayhan
published in: Queueing Systems
publication date: 2010-11-03T00:00:00Z
review text: The authors study tandem queues with subexponential service times and finite waiting room between stations. They derive (max, +) linear recursion formulas for the departure times of customers from stations, and using these they obtain the tail asymptotics of the response and waiting times of the customers. They find these asymptotics for both communication blocking and manufacturing blocking schemes.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5809645
zbMATH Keywords: subexponential distribution
zbMATH Keywords: tail asymptotics
zbMATH Keywords: communication blocking
zbMATH Keywords: manufacturing blocking
zbMATH Keywords: response time
zbMATH Keywords: waiting time
reviewed by: Moshe Shaked
MaRDI profile type: Publication
full work available at URL: s11134-010-9182-1
OpenAlex ID: W2055663167
cites work: Subexponential asymptotics for stochastic processes: Extremal behavior, stationary distributions and first passage probabilities
cites work: Tail asymptotics for M/G/1 type queueing processes with subexponential increments
cites work: Large claims approximations for risk processes in a Markovian environment
cites work: Sampling at subexponential times, with queueing applications
cites work: A General Class of Closed Fork and Join Queues with Subexponential Service Times
cites work: Cyclic queueing networks with subexponential service times
cites work: Moments and tails in monotone-separable stochastic networks.
cites work: Q4304869
cites work: Asymptotics of stochastic networks with subexponential service times
cites work: Asymptotics of subexponential max plus networks: the stochastic event graph case
cites work: Tails in generalized Jackson networks with subexponential service-time distributions
cites work: Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
cites work: An Approximation Method for Tandem Queues with Blocking
cites work: Q5601945
cites work: Convolution tails, product tails and domains of attraction
cites work: Tails for (max, plus) recursions under subexponentiality
cites work: On convolution tails
cites work: Estimates for the probability of ruin with special emphasis on the possibility of large claims
cites work: Heavy tails in multi-server queue
cites work: Discrete and continuous time modulated random walks with heavy-tailed increments
cites work: Steady-state asymptotics for tandem, split-match and other feedforward queues with heavy tailed service
cites work: Subexponential asymptotics of a Markov-modulated random walk with queueing applications
cites work: Packet reordering in networks with heavy-tailed delays
cites work: Large tandem queueing networks with blocking
cites work: On the subexponential properties in stationary single-server queues: a Palm-martingale approach
cites work: On the tails of waiting-time distributions
cites work: Q3860551
cites work: Subexponential asymptotics of the waiting time distribution in a single-server queue with multiple Markovian arrival streams
cites work: The impact of a heavy-tailed service-time distribution upon the \(\text{M}/\text{GI}/s\) waiting-time distribution
cites work: Asymptotic expansions for waiting time probabilities in an \(M/G/1\) queue with long-tailed service time
cites work: LOWER BOUNDS FOR LRD/GI/1 QUEUES WITH SUBEXPONENTIAL SERVICE TIMES
DOI: 10.1007/S11134-010-9182-1
description: scientific article; zbMATH DE number 5809645