Towards a better understanding of pure packet routing

DOI10.1007/3-540-57155-8_230zbMath1504.68011OpenAlexW114386497MaRDI QIDQ5060094

Allan Borodin

Publication date: 18 January 2023

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

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_230

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on evacuation time for deflection routing
• How to emulate shared memory
• Routing, merging, and sorting on parallel models of computation
• Oblivious routing with limited buffer capacity
• Optimal routing algorithms for mesh-connected processor arrays
• On the complexity of an optimal non-blocking commutation scheme without reorganization
• Tight Bounds on the Complexity of Parallel Sorting
• Tight bounds for oblivious routing in the hypercube
• Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
• Efficient Schemes for Parallel Communication
• Efficient dispersal of information for security, load balancing, and fault tolerance
• A Scheme for Fast Parallel Communication
• How much can hardware help routing?

This page was built for publication: Towards a better understanding of pure packet routing