A collision model for randomized routing in fat-tree networks

DOI10.1016/J.JPDC.2005.04.005zbMATH Open1101.68011OpenAlexW2039321617MaRDI QIDQ2565697FDOQ2565697

Authors Volker Strumpen, Arvind Krishnamurthy 

Publication date 28 September 2005

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.04.005

zbMATH Keywords

Probabilistic analysisCollision modelFat-tree networkRandomized routing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Recommendations

• Randomized broadcast in radio networks with collision detection
• A packet routing protocol for arbitrary networks
• Randomized routing on generalized hypercubes
• scientific article; zbMATH DE number 1760005
• Randomized broadcast in radio networks with collision detection

Cited in

(1)

• On the throughput of degenerate intersection and first-come first-served collision resolution algorithms

This page was built for publication: A collision model for randomized routing in fat-tree networks

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