Tandem queues with subexponential service times and finite buffers

DOI10.1007/S11134-010-9182-1zbMATH Open1205.60159OpenAlexW2055663167MaRDI QIDQ600897FDOQ600897

Hayriye Ayhan, Jung-Kyung Kim

Publication date: 3 November 2010

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-010-9182-1

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

zbMATH Keywords

response timetail asymptoticssubexponential distributionwaiting timecommunication blockingmanufacturing blocking

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Convolution tails, product tails and domains of attraction
• On convolution tails
• Heavy tails in multi-server queue
• Discrete and continuous time modulated random walks with heavy-tailed increments
• Title not available (Why is that?)
• Packet reordering in networks with heavy-tailed delays
• Estimates for the probability of ruin with special emphasis on the possibility of large claims
• Large claims approximations for risk processes in a Markovian environment
• Title not available (Why is that?)
• The impact of a heavy-tailed service-time distribution upon the \(\text{M}/\text{GI}/s\) waiting-time distribution
• Asymptotic expansions for waiting time probabilities in an \(M/G/1\) queue with long-tailed service time
• Sampling at subexponential times, with queueing applications
• Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
• Moments and tails in monotone-separable stochastic networks.
• Subexponential asymptotics of the waiting time distribution in a single-server queue with multiple Markovian arrival streams
• On the tails of waiting-time distributions
• On the subexponential properties in stationary single-server queues: a Palm-martingale approach
• Subexponential asymptotics for stochastic processes: Extremal behavior, stationary distributions and first passage probabilities
• Subexponential asymptotics of a Markov-modulated random walk with queueing applications
• An Approximation Method for Tandem Queues with Blocking
• Cyclic queueing networks with subexponential service times
• Tails in generalized Jackson networks with subexponential service-time distributions
• Tail asymptotics for M/G/1 type queueing processes with subexponential increments
• Asymptotics of stochastic networks with subexponential service times
• Large tandem queueing networks with blocking
• Steady-state asymptotics for tandem, split-match and other feedforward queues with heavy tailed service
• Tails for (max, plus) recursions under subexponentiality
• A General Class of Closed Fork and Join Queues with Subexponential Service Times
• LOWER BOUNDS FOR LRD/GI/1 QUEUES WITH SUBEXPONENTIAL SERVICE TIMES
• Asymptotics of subexponential max plus networks: the stochastic event graph case

Cited In (9)

• A General Class of Closed Fork and Join Queues with Subexponential Service Times
• Title not available (Why is that?)
• Bounds for the expected delays in some tandem queues
• Title not available (Why is that?)
• Large tandem queueing networks with blocking
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• 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)