A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A survey on interval routing
2000
Theoretical Computer Science
We survey in this paper the classical results, and also the most recent results, in the ÿeld of Interval Routing, a well-known strategy to code in a compact way distributed routing algorithms. These results are classiÿed in several themes: characterization, compactness and shortest path, dilation and stretch factor, speciÿc class of graphs (interconnection networks, bounded degree, planar, chordal rings, random graphs, etc.), and the other recent extensions proposed in the literature: dead-lock
doi:10.1016/s0304-3975(99)00283-2
fatcat:gxqzru4kurdafgbrofsehe6zdm