DESIGN: Reachability under vertex failures

[Raajay Viswanathan]

Summary

We currently verify k-edge connectivity using the max flow problem on our ETG. Commonly, vertex connectivity can also be modelled edge connectivity by splitting a vertex and adding an unit edge between them. It is a bit tricky in our case sice the ETG-s already split the edges; in fact there are 2p edges for a router with p processes. The main challenges are:

1. Ensure vertex connectivity in the presence of arbitrary connectivity under no failure scenarios; this might be because of ACLs, absence of route re-distribution.