103 search results - page 8 / 21 » Oblivious routing on geometric networks |
ALGOSENSORS
2004
Springer
15 years 5 months ago
2004
Springer
116
click to vote
ALGOSENSORS
2004
Springer
15 years 5 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
IV
2007
IEEE
15 years 6 months ago
2007
IEEE
We consider routing methods for networks when geographic positions of nodes are available. Instead of using the original geographic coordinates, however, we precompute virtual coo...