Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus

DOI10.1007/978-3-540-79228-4_20zbMath1139.68328OpenAlexW1496593514MaRDI QIDQ3502649

Andre Osterloh

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_20

Mathematics Subject Classification ID

Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packet routing in fixed-connection networks: A survey
• Potential function analysis of greedy hot-potato routing
• Randomized Single-Target Hot-Potato Routing
• Hard-Potato routing
• A New Bound for Pure Greedy Hot Potato Routing
• Greedy hot-potato routing on the two-dimensional mesh
• Sharp approximate models of deflection routing in mesh networks

This page was built for publication: Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus