A network of priority queues in heavy traffic: One bottleneck station

DOI10.1007/BF02411464zbMath0818.60081MaRDI QIDQ1813707

Martin I. Reiman, Burton Simon

Publication date: 25 June 1992

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

zbMATH Keywords

stationary distributionreflected Brownian motionopen queueing networkMarkov routingheavy traffic principlessojourn time processes

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (4)

A law of the iterated logarithm for the sojourn time process in queues in series ⋮ Limit non-stationary behavior of large closed queueing networks with bottlenecks ⋮ Asymptotic Properties of a Recursive Procedure for Simultaneous Estimation ⋮ Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies

Cites Work

• Unnamed Item
• Unnamed Item
• The QNET method for two-moment analysis of open queueing networks
• Stochastic discrete flow networks: Diffusion approximations and bottlenecks
• Weak convergence of compound stochastic process. I
• Open Queueing Networks in Heavy Traffic
• A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
• Interpolation Approximations of Sojourn Time Distributions
• An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals
• An Interpolation Approximation for Queueing Systems with Poisson Input
• A multiclass feedback queue in heavy traffic
• Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks
• Open Queueing Systems in Light Traffic
• Light traffic derivatives via likelihood ratios
• Simterpolation: A Simulation based Interpolation Approximation for Queueing Systems
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• A limit theorem for priority queues in heavy traffic
• Weak convergence theorems for priority queues: preemptive-resume discipline
• Multiple channel queues in heavy traffic. I

This page was built for publication: A network of priority queues in heavy traffic: One bottleneck station