scientific article; zbMATH DE number 1263200

MaRDI QIDQ4234071zbMATH OpenFDO

Authors Mor Harchol-Balter, David Wolfe

Publication date 27 August 2001

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Recommendations

• The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
• General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
• scientific article; zbMATH DE number 1256755

Cited in

(14)

• Packet delay caused by stack-algorithm for overcritical income flow
• Adaptive packet routing for bursty adversarial traffic
• A mathematical framework for designing a low-loss, low-delay internet
• Routing and delay analysis models for high-speed networks
• Tight bounds for the tail of the packet waiting time distribution in buffered networks
• Waiting Times at Very Fast, Constant Service Time Merger Nodes
• The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
• On the average delay for routing subject to independent deflections
• An optimal probabilistic routing policy for a large packet–switched network
• Packet delay in models of data networks
• On the Age of Information With Packet Deadlines
• A simple analysis of average queueing delay in tree networks
• Stochastic analysis of dynamic processes
• Constant time per edge is optimal on rooted tree networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234071)