We want to use the characterisation of internet hosts, e.g. by embedding into an ICS or by providing a distance-function, to create an overlay network which improves the communication patterns in between the hosts of the overlay. To achieve this, the following properties of the overlay are desirable:
- The graph of the overlay resembles a spanner-graph.
- The graph of the overlay has a constant node-degree.
- The graph of the overlay supports a local routing strategy.
Local routing means that one host only needs to have information of its immediate neighbors or, as a bit relaxed rule, of its indirect neighbors up to a certain, but constant, hop-distance. Our goal is, to create overlay networks, which can themselves serve as underlays for other application-layer overlays.
As a starting-point, we have reviewed the existing ICS approaches and found an approach that provided high accuracy, using the L-infinity metric for embedding. Currently we are researching the construction of four-sector-graphs under the L-infinity metric and their properties.
Other research tracks are the examination of properties of delaunay triangulations which are constructed using arbitrary distance functions, performing efficient multicast-communication on the constructed overlays and fallback mechanisms for cases where local routing fails.