Euro-Par 2004 Parallel Processing

DOI10.1007/B99409zbMATH Open1096.68557OpenAlexW2477312825MaRDI QIDQ5311348FDOQ5311348

Authors Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer 

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99409

Mathematics Subject Classification ID

Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1256693
• Hard-potato routing
• Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms
• Scheduled Hot-Potato Routing
• Randomized Single-Target Hot-Potato Routing

Cited In (7)

• Semi-preemptive routing on trees
• \(\widetilde{O}\) (congestion + dilation) hot-potato routing on leveled networks
• Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
• Hard-potato routing
• Networks on which hot-potato routing does not livelock
• Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms
• Scheduling problems in transportation networks of line topology

This page was built for publication: Euro-Par 2004 Parallel Processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311348)