Section: Application Domains

Routing in the Internet

The localized data-structures developed in the project, in particular the near-shortest path representation of a graph, can be naturally applied to routing in the Internet. More, precisely it can be applied to compact routing information while preserving routing along near-shortest routes. The current solution, based on BGP, uses routing tables of size linear in the number of T1-routers. The increase of the number of these routers, and so of the resulting routing tables, negatively impacts the routing time to forward each packet in the routers.

One of the goals of the project (see also Section  8.3 ) is to provide routing tables for the Internet network with sublinear size while achieving near-shortest path routing.