Treelike queueing networks: Asymptotic stationarity and heavy traffic
From MaRDI portal
Publication:1296745
Recommendations
Cites work
- scientific article; zbMATH DE number 3125504 (Why is no real title available?)
- scientific article; zbMATH DE number 3692406 (Why is no real title available?)
- scientific article; zbMATH DE number 27027 (Why is no real title available?)
- scientific article; zbMATH DE number 46885 (Why is no real title available?)
- scientific article; zbMATH DE number 50996 (Why is no real title available?)
- scientific article; zbMATH DE number 69201 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3322728 (Why is no real title available?)
- A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
- Asymptotic stationarity of queues in series and the heavy traffic approximation
- Distances of Probability Measures and Random Variables
- Ergodicity of Jackson-type queueing networks
- Ergodicity of a Jackson network by batch arrivals
- On a class of stochastic recursive sequences arising in queueing theory
- On a tandem queueing model with identical service times at both counters, II
- On the Ergodicity and Stability of the Sequence $w_{n + 1} = f(w_n ,\xi _n )$: Applications to Communication Networks
- On the ergodicity of networks of ·/GI/1/N queues
- Open Queueing Networks in Heavy Traffic
- Relating the waiting time in a heavy-traffic queueing system to the queue length
- Self-similarity in high-speed packet traffic: analysis and modeling of Ethernet traffic measurements
- Some Useful Functions for Functional Limit Theorems
- Stationary representation of queues. I
- The throughput of a series of buffers
Cited in
(5)- The asymptotic behavior of a branching-type polling network in heavy traffic
- Heavy-traffic asymptotics for networks of parallel queues with Markov-modulated service speeds
- A note on cycle times in tree-like queueing networks
- Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks
- Infinite queueing systems with tree structure
This page was built for publication: Treelike queueing networks: Asymptotic stationarity and heavy traffic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296745)