Sciweavers

6 search results - page 2 / 2
» Nearly Optimal One-To-Many Parallel Routing in Star Networks
Sort
View
SPAA
2005
ACM
13 years 10 months ago
Oblivious routing on geometric networks
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 ...
Costas Busch, Malik Magdon-Ismail, Jing Xi