Universal Packet Routing with Arbitrary Bandwidths and Transit Times
From MaRDI portal
Publication:3009776
DOI10.1007/978-3-642-20807-2_29zbMath1341.68007OpenAlexW115409852MaRDI QIDQ3009776
Publication date: 24 June 2011
Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15679
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
Scheduling Bidirectional Traffic on a Path ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ A tight bound on the speed-up through storage for quickest multi-commodity flows ⋮ O(log m)-approximation for the routing open shop problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- Efficient delay routing
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Time-constrained scheduling of weighted packets on trees and meshes
- Scheduling time-constrained communication in linear networks
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- Direct routing: Algorithms and complexity
- A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria
- The Quickest Transshipment Problem
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times
- Packet Routing on the Grid
- Packet Routing: Complexity and Algorithms
- Real-Time Message Routing and Scheduling
- Shortest-Path Routing in Arbitrary Networks
- Quickest Flows Over Time
This page was built for publication: Universal Packet Routing with Arbitrary Bandwidths and Transit Times
