O (congestion + dilation) hot-potato routing on leveled networks

DOI10.1007/S00224-004-1136-8zbMATH Open1093.68001OpenAlexW2089758777MaRDI QIDQ706318FDOQ706318

Authors: Costas Busch 

Publication date: 8 February 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1136-8

Recommendations

• scientific article; zbMATH DE number 1256693
• Euro-Par 2004 Parallel Processing
• A lower bound for nearly minimal adaptive and hot potato algorithms
• Scheduled Hot-Potato Routing
• Efficient bufferless packet switching on trees and leveled networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (2)

• Networks on which hot-potato routing does not livelock
• Efficient bufferless packet switching on trees and leveled networks

This page was built for publication: \(\widetilde{O}\) (congestion + dilation) hot-potato routing on leveled networks

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