scientific article; zbMATH DE number 1256754
From MaRDI portal
Publication:4228490
Recommendations
Cited in
(22)- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- Constant time per edge is optimal on rooted tree networks
- Communication in parallel systems
- Stackelberg Routing in Arbitrary Networks
- Bounding Residence Times for Atomic Dynamic Routings
- Atomic routing games on maximum congestion
- Scheduling nonuniform traffic in a packet switching system with large propagation delay
- Universal packet routing with arbitrary bandwidths and transit times
- Near-optimal schedules for simultaneous multicasts
- Near-optimal scheduling of distributed algorithms
- Randomization Does Not Reduce the Average Delay in Parallel Packet Switches
- Direct routing: Algorithms and complexity
- Task swapping networks in distributed systems
- Scheduling problems in transportation networks of line topology
- Efficient bufferless packet switching on trees and leveled networks
- On the benefit of supporting virtual channels in wormhole routers
- General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
- A simpler proof for \(O(\mathrm{congestion} + \mathrm{dilation})\) packet routing
- Packet task processing in distributed computational environments with inalienable resources
- Adaptive packet routing for bursty adversarial traffic
- Online packet-routing in grids with bounded buffers
- A packet routing protocol for arbitrary 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 Q4228490)
