Practical Compact Routing on Sparse Graphs

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.

Practical Compact Routing on Sparse Graphs

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.

Improved Compact Routing Schemes for Random Interconnects

Random topology has been an increasingly favorable approach for designing interconnection networks, as it can provide a combination of low latency and incremental network growth that could not be provided by the traditional rigid topologies. However, the common shortest-path routing in a random interconnect poses a scalability problem, for it requires global network info to make routing decisions and so, the routing table size (RTS) can be very large. Therefore, this manuscript would aim to revisit the well-known research area of landmark-based compact routing and to improve the universal routing schemes for the specific case of random interconnects. It would propose new landmark-based compact routing schemes, using 2 heuristic techniques to select landmarks that are evenly spaced, which would reduce the RTS in the well-known Thorup and Zwick's scheme by up to 18% and produce a shorter average path length.