Searching among intervals and compact routing tables

Algorithmica ◽  
1996 ◽  
Vol 15 (5) ◽  
pp. 448-466 ◽  
Author(s):  
G. N. Frederickson
Keyword(s):  
Compact Routing ◽  
Compact Routing Tables ◽  
Routing Tables

Designing networks with compact routing tables

Algorithmica ◽  
1988 ◽  
Vol 3 (1-4) ◽  
pp. 171-190 ◽  
Author(s):  
Greg N. Frederickson ◽  
Ravi Janardan
Keyword(s):  
Compact Routing ◽  
Compact Routing Tables ◽  
Routing Tables

scholarly journals Practical Compact Routing on Sparse Graphs

2021 ◽  
Author(s):  
Kai Hormann ◽  
Craig Gotsman
Keyword(s):  
Routing Algorithm ◽  
Nested Dissection ◽  
Sparse Graphs ◽  
Compact Routing ◽  
Vertex Graph ◽  
Vertex Separators ◽  
Practical Algorithm ◽  
Routing Tables ◽  
Basic Version ◽  
Advanced Version

We describe a simple and practical algorithm for compact routing on graphs which admit compact and balanced vertex separators. Using a recursive nested dissection of then-vertex graph based on these separators, we construct routing tables with as few as O(log n) entries per vertex in a preprocessing step. They support handshaking-based routing on the graph with moderate stretch, where the handshaking can be implemented similarly to a DNS lookup. We describe a basic version of the algorithm that requires modifiable headers and a more advanced version which eliminates this need and provides better stretch. A number of algorithmic parameters control a graceful tradeoff between the size of the routing tables and the stretch. Our routing algorithm is most effective on planar graphs and unit disk graphs of moderate edge/vertex density.

scholarly journals Practical Compact Routing on Sparse Graphs

2021 ◽  
Author(s):  
Kai Hormann ◽  
Craig Gotsman
Keyword(s):  
Routing Algorithm ◽  
Nested Dissection ◽  
Sparse Graphs ◽  
Compact Routing ◽  
Vertex Graph ◽  
Vertex Separators ◽  
Practical Algorithm ◽  
Routing Tables ◽  
Basic Version ◽  
Advanced Version

We describe a simple and practical algorithm for compact routing on graphs which admit compact and balanced vertex separators. Using a recursive nested dissection of then-vertex graph based on these separators, we construct routing tables with as few as O(log n) entries per vertex in a preprocessing step. They support handshaking-based routing on the graph with moderate stretch, where the handshaking can be implemented similarly to a DNS lookup. We describe a basic version of the algorithm that requires modifiable headers and a more advanced version which eliminates this need and provides better stretch. A number of algorithmic parameters control a graceful tradeoff between the size of the routing tables and the stretch. Our routing algorithm is most effective on planar graphs and unit disk graphs of moderate edge/vertex density.

Sign in / Sign up

Export Citation Format

Share Document