Successive survivable routing result for Network 5 (18 nodes, 27 links)

1. Click "Topology" button after nodes are stable.
2. In "Show paths" state, use mouse to select/deselect source/destination nodes of a flow. Its working and backup paths will be shown.
3. Any single LINK failure can be protected by backup paths in the first applet. Results for any single NODE failure is in the second graph. Results for network 6 are here.
4. This page is under developing, algorithm animation coming soon...
5. A related topic for packet-level ns simulation of a restoration protocol RAFT in shown here.

• Yu Liu, David Tipper, and Peerapon Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," In proceeding of IEEE Computer communication conference INFOCOM 2001, Anchorage, Alaska, April 22-26, 2001. (PDF).
• Yu Liu, David Tipper, “Successive survivable routing for node failures,” submitted to GlobeCom 2001

Other papers on the SSR algorithm are given in DRCN01, BOUND and MULTI.  DRCN01 considers the cases of nonlinear link cost and failure dependent path restoration.  BOUND paper gives upper and lower bound of the spare capacity allocation problem (SCA) and prove SCA is NP-complete.  MULTI paper extends matrix based SCA models and SSR for multilayer network survivability problems. 

• Yu Liu, David Tipper, “Spare capacity allocation for non-linear cost and failure dependent path restoration,” to appear Proceeding of the Third International Workshop on Design of Reliable Communication Networks, DRCN 2001, Budapest, Hungary, 7-10 October 2001 (PDF)
• Yu Liu, David Tipper, “Complexity and bounds of spare capacity allocation problem,” under submission
• Yu Liu, David Tipper, “Complexity and bounds of spare capacity allocation problem,” under submission