Efficient delay routing

DOI10.1016/S0304-3975(97)00198-9zbMath0902.68086MaRDI QIDQ1128715

Miriam Di Ianni

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

packet routing schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Approximating call-scheduling makespan in all-optical networks ⋮ Computational complexity of convoy movement planning problems ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to emulate shared memory
• Communication-efficient parallel algorithms for distributed random-access machines
• Optimization, approximation, and complexity classes
• Approximation algorithms for combinatorial problems
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• 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
• Efficient routing in all-optical networks
• A Scheme for Fast Parallel Communication
• An algorithmic approach to the Lovász local lemma. I
• Randomized Routing and Sorting on Fixed-Connection Networks
• Greedy Packet Scheduling
• A packet routing protocol for arbitrary networks
• Greedy packet scheduling on shortest paths (preliminary version)
• Fast deflection routing for packets and worms

This page was built for publication: Efficient delay routing