Network Protection Mechanism using Spanning Tree Algorithm

1. ICE514 Concrete Mathematics Term project presentation Network Protection Mechanism using Spanning Tree Algorithm 2003. 04. 02. Kwang Hyun, Koo Yu Mi, Kim

2. Contents • Background supporting the main idea • Spanning tree algorithm • The concept of protection in the network • Term project main idea • Expected result • Schedule

3. Spanning tree algorithm • Spanning tree for a graph G • Subgraph of G that contains every vertex of G and is a tree • DFS (depth first search) or BFS (breadth first search) to create a spanning tree • Minimum cost spanning tree • Spanning tree of least cost • Algorithms : greedy method • Kruskal • Prim • Sollin

4. 10 12 14 0 0 28 16 1 10 1 10 16 14 18 16 14 6 2 5 6 2 5 22 24 25 25 18 12 4 12 4 24 22 3 22 3 25 28 Kruskal’s algorithm 0 5 2 3 1 6 1 2 3 6 3 4 4 6 4 5 0 1

5. Concept of protection • Recovery framework • Failure detection • Failure correction • Failure localization & isolation • Recovery • Reversion

6. D S Concept of protection (cont.) Primary Backup • Based on pairing one working path with one backup path. • The signal is transmitted on both paths in parallel. • When the working path fails,only D node switches the connection from • working path to backup path.

7. Term project main idea • Object : implementation protection algorithm adapting spanning tree algorithm in the network • Set up disjointed path between source node and destination node using spanning tree algorithm. One denotes working path and the other is protection path. • In the normal case, network can service using working path. When fault occurs in the network link, can service through protection path

8. D S Unused Edge Primary Path Secondary Path Expected result

9. Schedule