A packet routing protocol for arbitrary networks
From MaRDI portal
Recommendations
Cited in
(20)- Efficient delay routing
- Adaptive packet routing for bursty adversarial traffic
- A collision model for randomized routing in fat-tree networks
- Packet Routing on the Grid
- Survey on oblivious routing strategies
- Shortest-Path Routing in Arbitrary Networks
- scientific article; zbMATH DE number 1283996 (Why is no real title available?)
- scientific article; zbMATH DE number 1305398 (Why is no real title available?)
- scientific article; zbMATH DE number 637522 (Why is no real title available?)
- scientific article; zbMATH DE number 1123084 (Why is no real title available?)
- scientific article; zbMATH DE number 1760011 (Why is no real title available?)
- A simpler proof for \(O(\mathrm{congestion} + \mathrm{dilation})\) packet routing
- Universal routing schemes
- Improved algorithms for latency minimization in wireless networks
- On the benefit of supporting virtual channels in wormhole routers
- Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
- Communication in parallel systems
- Two exact algorithms for the packet scheduling problem
- Near-optimal schedules for simultaneous multicasts
- The impact of local policies on the quality of packet routing in paths, trees, and rings
This page was built for publication: A packet routing protocol for arbitrary networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596630)
