An Interactive Verification of CIST-Partitions on Some Cayley Graphs
Verify a CIST-partition of 5-D alternating group network (AGN_5)
Verify a CIST-partition of 5-D bubble sort graph (BS_5)
Verify a CIST-partition of 5-D star graph (S_5)
Show two CISTs of 5-D bubble sort graph (BS_5)
Show two CISTs of 5-D star graph (S_5)
Input: CIST_1, CIST_2 and destination node d
Output: The protection routing Rd
Step 1. Let T_i' be the skeleton(remove leaf edges) of CIST_i while i in {1,2}.
Step 2. By symmetry, node d is belong to T1'.
Step 3. Let edge e be the leaf edge of CIST_2 adjacent to node d.
Step 4. The protection routing Rd contains the edges of T1' and T2' and edge e, and all the links are directed to node d.
Step 5. Output Rd.
[42] J. Tapolcai, Sfficient conditions for protection routing in IP networks, Optim. Lett., vol.7, no.4, pp.723-730, 2013.
Show the protection routing of 5-D alternating group network while desination node is 12345
Show the protection routing of 5-D bubble sort graph while desination node is 12345
Show the protection routing of 5-D star graph while desination node is 12345
Simulations on alternating group networks