scientific article; zbMATH DE number 1256754
From MaRDI portal
Publication:4228490
zbMATH Open0936.68010MaRDI QIDQ4228490FDOQ4228490
Authors: Yuval Rabani, Éva Tardos 
Publication date: 18 May 2000
Title of this publication is not available (Why is that?)
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)
Cited In (21)
- 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
- Scheduling nonuniform traffic in a packet switching system with large propagation delay
- Atomic routing games on maximum congestion
- Universal packet routing with arbitrary bandwidths and transit times
- Randomization Does Not Reduce the Average Delay in Parallel Packet Switches
- Near-optimal scheduling of distributed algorithms
- 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
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
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)
