Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms

DOI10.1093/COMJNL/45.4.423MaRDI QIDQ3148230zbMATH OpenOpenAlexFDO

Authors Alan Roberts, Antonios Symvonis, David R. Wood

Publication date 2002

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7eaca5881f737b56b092a0f729dbcba952ca3797

zbMATH Keywords

routing schedulesynchronous network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• Euro-Par 2004 Parallel Processing
• A lower bound for nearly minimal adaptive and hot potato algorithms
• Hard-potato routing
• A lower bound for nearly minimal adaptive and hot potato algorithms
• Greedy hot-potato routing on the two-dimensional mesh

Cited in

(1)

• Euro-Par 2004 Parallel Processing

This page was built for publication: Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms

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