Treelike queueing networks: Asymptotic stationarity and heavy traffic

DOI10.1214/AOAP/1028903538zbMath0938.60093OpenAlexW2076935433MaRDI QIDQ1296745

Richard F. Serfozo, Kuo-Hwa Chang, Władysław Szczotka

Publication date: 23 November 1999

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1028903538

zbMATH Keywords

weak convergencestationary processqueueing networkequilibrium distribution

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic stationarity of queues in series and the heavy traffic approximation
• Self-similarity in high-speed packet traffic: analysis and modeling of Ethernet traffic measurements
• On a class of stochastic recursive sequences arising in queueing theory
• Relating the waiting time in a heavy-traffic queueing system to the queue length
• Ergodicity of Jackson-type queueing networks
• On the Ergodicity and Stability of the Sequence $w_{n + 1} = f(w_n ,\xi _n )$: Applications to Communication Networks
• Open Queueing Networks in Heavy Traffic
• A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
• On the ergodicity of networks of ·/GI/1/N queues
• Stationary representation of queues. I
• Some Useful Functions for Functional Limit Theorems
• The throughput of a series of buffers
• On a tandem queueing model with identical service times at both counters, II
• Ergodicity of a Jackson network by batch arrivals
• Distances of Probability Measures and Random Variables

This page was built for publication: Treelike queueing networks: Asymptotic stationarity and heavy traffic