6 search results - page 2 / 2 » Nearly Optimal One-To-Many Parallel Routing in Star Networks |
126
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...