Constant time per edge is optimal on rooted tree networks
From MaRDI portal
(Redirected from Publication:5137341)
Recommendations
- scientific article; zbMATH DE number 1263200
- A simple analysis of average queueing delay in tree networks
- Stochastic comparisons for rooted butterfly networks and tree networks, with random environments
- General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
- scientific article; zbMATH DE number 1256754
Cites work
- Average delay in queues with non-stationary Poisson arrivals
- Communication networks: Message path delays
- Extremal properties of the FIFO discipline in queueing networks
- scientific article; zbMATH DE number 3852171 (Why is no real title available?)
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- scientific article; zbMATH DE number 1263200 (Why is no real title available?)
- scientific article; zbMATH DE number 910914 (Why is no real title available?)
- On the comparison of waiting times in tandem queues
- Reduction Methods for Tandem Queuing Systems
- Stochastic ordering and dependence in applied probability
- Stochastic orders
- Technical Note—On the Comparison of Waiting Times in GI/G/1 Queues
Cited in
(2)
This page was built for publication: Constant time per edge is optimal on rooted tree networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137341)