Many-to-many routing on trees via matchings

DOI10.1016/S0304-3975(97)00049-2zbMath0901.68019MaRDI QIDQ1390958

Grammati E. Pantziou, Alan Roberts, Antonios Symvonis

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

packet routingoff-line routinghot-potato routingmatching routing modelon-line routing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Related Items (4)

Direct routing: Algorithms and complexity ⋮ Collision-free network exploration ⋮ On-line matching routing on trees ⋮ ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on evacuation time for deflection routing
• A lower bound for nearly minimal adaptive and hot potato algorithms
• A unified framework for off-line permutation routing in parallel networks
• Routing Permutations on Graphs via Matchings
• Routing permutations on graphs via matchings
• Routing permutations on a graph
• Fast deflection routing for packets and worms

This page was built for publication: Many-to-many routing on trees via matchings