The Locator/Identifier Separation Protocol (LISP) is a proposal aiming at resolving some problem the Internet is facing today like the lack of inbound inter-domain traffic engineering or the continuous growth of the routing table.

The tutorials available on http://inl.info.ucl.ac.be/tutorials/lisp-tutorial present LISP today

You frequently need to resolve IP addresses into their longest-match prefix? RADIX_UDP is for you ;-)

The tool loads a list of prefixes into a radix that can be queried in UDP. The syntax is simple, send a UDP segment in text with the first column being the IP, we don't care about the others ;-)

The server will reply with the same text but with the corresponding prefix prepended.

Example,

create a file "prefix.dat" with this content:

192.0.2.0/24
192.0.2.128/25

start the server:

./radix_udp prefix.dat 45005

query it

“Characteristics of Destination Address Locality in Computer Networks: A Compar-
ison of Caching Schemes,” R. Jain, Computer Networks and ISDN, vol. 18, pp. 243–254, 1989/1990.

This paper is probably the first to think about locality in network traffic. At that time, most of the networks were built on pure proprietary architectures, however, some of the conclusions are still applicable today. However, as the analysis was performed on non IP networks, we'll not discuss the experimental part in this summary.

The Farinacci et al. "LISP Alternative Topology (LISP-ALT)" draft proposes a mechanism to manage EID to RLOCs mapping in the LISP protocol.

The idea of LISP-ALT (ALT for Alternative Topology) propose to build an public Internet overlay to manage mapping in LISP.

The paper "Client-Side Adaptive Search Optimisation for Online Game Server Discovery" presented at Networking'08 and written by G. Armitage aims at reducing response time and resources consumption of server selection in online games.

The paper "Turbo King: Framework for Large-Scale Internet Delay Measurements" published by Leonard and Loguinov at INFOCOM'08 shows the inaccuracies of the King delay estimation framework and propose Turbo King to tackle the problem.

The idea of King is to estimate distance between any to nodes by measuring the time required to resolve a DNS query from a DNS server near the source and a DNS server near the destination.

The INFOCOM'08 paper titled "Minerva: Learning to Infer Network Path Properties" written by Wouhaybi et al. proposes to predict network path properties based on learning techniques.

This last decade, plenty of solutions have been proposed to estimate the path properties between nodes without having to explicitly measure the path between the two nodes. However, most of the techniques (with or without landmarks) require to periodically make some measurements.