[e2e] fast restoration/protection

[Jon Crowcroft]

there's loads and loads of fancy algorithms for computing alternate
routes and building k-resiliency etc etc, but does anyone know if
there's a paper on the obvious - if routers were to log routing
tables, and then one correlated this with faults, one could simply
_load_ the alternate forwarding table directly after a link or node
outage from the previous time there had been an outage at that point -
i.e. simply use the fact that the routing system is a distributed 
algoriithm for path finding, but give it some memory:)

j.