1 / 18

Algorithm for enumerating all recovery paths against single span of a network

Algorithm for enumerating all recovery paths against single span of a network. <Team 13> Sung-Hwan Park ( ozjezz@icu.ac.kr ) Jeong-Hee Ryou ( viva02@icu.ac.kr ) ICE514 Term Project 2003. 5. 21. Contents. Introduction Background Theory Implementation of Algorithm References. Introduction.

tao
Download Presentation

Algorithm for enumerating all recovery paths against single span of a network

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Algorithm for enumerating all recovery paths against single span of a network <Team 13> Sung-Hwan Park (ozjezz@icu.ac.kr) Jeong-Hee Ryou (viva02@icu.ac.kr) ICE514 Term Project 2003. 5. 21

  2. Contents • Introduction • Background Theory • Implementation of Algorithm • References RSVP 및 실시간 인터넷 서비스 기술

  3. Introduction • Given Situation • We have already known database of Node and Link. • The Link is monitored. • Motivation • Something is changed. (ex. broken) Search for an alternate path. (Recovery) • Only one node is fully used. Manage the resource. (Resource Minimization) RSVP 및 실시간 인터넷 서비스 기술

  4. Introduction • Our Work • Enumerate all available paths for Recovery. • Construct database of recovery paths for Resource Minimization. RSVP 및 실시간 인터넷 서비스 기술

  5. Background Theory • Graph Theory • The information of a graph are stated in matrix form. • Associated matrixes • Adjacency matrix, incidence matrix, distance matrix,….. • Incidence matrix • Both nodes and edges in a graph are labeled. • Let the nodes of graph G be labeled v1,v2,…..vp • and the edges be labeled e1,e2,…..eq. • The incidence matrix B of G is the p xq binary matrix • bij= 1 if vi is incident with ej • 0 otherwise. { RSVP 및 실시간 인터넷 서비스 기술

  6. Implementation of Algorithm • Algorithm • Matrix • Node = node in network • Edge = link between nodes in network • Results • Enumerate all available routes for certain source and destination node. • Construct database of all paths among all nodes. RSVP 및 실시간 인터넷 서비스 기술

  7. Implementation of Algorithm • Sample network • Matrix B [no_nodes][no_links]= 2 1 2 0 3 6 4 5 0 1 4 3 7 0 1 2 3 4 5 6 7 0 1 1 0 0 0 0 0 0 1 1 0 1 1 1 0 0 0 2 0 0 1 0 0 1 1 0 3 0 0 0 1 0 1 0 1 4 0 1 0 0 1 0 1 1 RSVP 및 실시간 인터넷 서비스 기술

  8. Implementation of Algorithm S:0, D:1 1 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 1 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 0 0 1 0 1 1 0 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 1 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 0 0 1 0 1 1 1 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 1 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 0 0 1 0 1 1 0,1 0,4,1 0 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 1 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 1 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 0 0 1 0 1 1 0,4,2,1 RSVP 및 실시간 인터넷 서비스 기술

  9. Implementation of Algorithm • Result • Source : 0, Destination : 1 • available routes • 0 1 • 0 4 1 • 0 4 2 1 • 0 4 2 3 1 • 0 4 3 1 • 0 4 3 2 1 RSVP 및 실시간 인터넷 서비스 기술

  10. Implementation of Algorithm RSVP 및 실시간 인터넷 서비스 기술

  11. Implementation of Algorithm RSVP 및 실시간 인터넷 서비스 기술

  12. Implementation of Algorithm RSVP 및 실시간 인터넷 서비스 기술

  13. Implementation of Algorithm RSVP 및 실시간 인터넷 서비스 기술

  14. Implementation of Algorithm RSVP 및 실시간 인터넷 서비스 기술

  15. Implementation of Algorithm RSVP 및 실시간 인터넷 서비스 기술

  16. Implementation of Algorithm RSVP 및 실시간 인터넷 서비스 기술

  17. Future Work • The number of paths is large in big network. How can we manage the many paths for resource optimization? RSVP 및 실시간 인터넷 서비스 기술

  18. References [1] Meir Herzberg and Stephen J.Bye, “An Optimal Spare-Capacity Assignment Model for Survivable Networks with Hop Limits” IEEE 1994. [2] Fred Buckley and Frank Harary, “Distance in Graphs” 1990. [3] Douglas B.West, “Introduction to Graph Theory” 2001. [4] P. Mateti and N. Deo, "On algorithms for enumerating all circuits of a graph," SIAM J. Comput., Vol. 5, No. 1, Mar. 1976, pp. 90-99. [5] M. H. MacGregor and W. D. Grover, "Optimized k-shortest-paths Algorithm for Facility Restoration," Software - Practice and Experience, Vol. 24, No. 9, pp. 823-834. RSVP 및 실시간 인터넷 서비스 기술

More Related