A collision model for randomized routing in fat-tree networks

DOI10.1016/J.JPDC.2005.04.005zbMath1101.68011OpenAlexW2039321617MaRDI QIDQ2565697

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)

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