1 / 34

Survivable Telecommunication Network Design Under Different Types of Failures

Survivable Telecommunication Network Design Under Different Types of Failures. Hanan Luss and Richard T. Wong. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS — PART A: SYSTEMS AND HUMANS, VOL. 34, NO. 4, JULY 2004. Presented by Huan-Ting Chen, OPLab, IM, NTU 2007/3/19. Author.

temira
Download Presentation

Survivable Telecommunication Network Design Under Different Types of Failures

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. Survivable Telecommunication Network Design Under Different Types of Failures Hanan Luss and Richard T. Wong IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART A: SYSTEMS AND HUMANS, VOL. 34, NO. 4, JULY 2004 Presented by Huan-Ting Chen, OPLab, IM, NTU 2007/3/19

  2. Author - Hanan Luss received the the Ph.D. degree in operations research from the University of Pennsylvania,Philadelphia, in 1973. - He is an Adjunct Professor at Columbia University, New York. - Richard T. Wong received the Ph.D. degrees from the Cambridge, 1978. - He is currently a Senior Operations Research Analyst with United Parcel Service. OPLab, IM, NTU

  3. Outline • Introduction - Principal Issues for Survivable Network Design - Message of Paper • Three approaches - Under Partial Link Failure - Under Link Failure - Under Node Failure • Conclusions OPLab, IM, NTU

  4. Outline • Introduction - Principal Issues for Survivable Network Design - Message of Paper • Three approaches - Under Partial Link Failure - Under Link Failure - Under Node Failure • Conclusions OPLab, IM, NTU

  5. Introduction • Principal Issues for Survivable Network Design - Reroute the traffic of a failure of a network element - Restoration protocols OPLab, IM, NTU

  6. Introduction • Message of Paper - Augmenting capacities - Under a single failure OPLab, IM, NTU

  7. Outline • Introduction - Principal Issues for Survivable Network Design - Message of Paper • Three Approaches - Under Partial Link Failure - Under Link Failure - Under Node Failure • Conclusions OPLab, IM, NTU

  8. Three Approaches • Three different scenarios - Restoration under a single partial link failure - Restoration under a single link failure - Restoration under a single node failure OPLab, IM, NTU

  9. Under Partial Link Failure • Augments network capacity • Under a single partial link failure - A link component failed on one link OPLab, IM, NTU

  10. Notation OPLab, IM, NTU

  11. Under Partial Link Failure • Guarantees the network will survive a single partial link failure on any link of G(N , A). • Goal - Constructs a spanning tree V(N , A) where each link (i , j)V(N , A) has f(i , j)C. OPLab, IM, NTU

  12. Under Partial Link Failure • [C – s(k,l) ] + [s(k,l) – s’(k,l) ] = C – s’(k,l) OPLab, IM, NTU

  13. Under Partial Link Failure Add (1,4) and (1,5) to the spanning tree Add capacity C to (1,3) and add it to the spanning tree Add capacity C to (1,2) and add it to the spanning tree 10 6 7 7 6 10 10 6 7 10 OPLab, IM, NTU

  14. Under Partial Link Failure OPLab, IM, NTU

  15. Under Link Failure • Augments network capacity • Under a single link failure • g(i , j)：Traffic on link (i , j) that needs to be restored in the event that link (i , j) A fails. OPLab, IM, NTU

  16. Under Link Failure 3 4 2 1 2 2 2 1 5 1 OPLab, IM, NTU

  17. Under Link Failure Add C to these links and decrease the original g(i,j) by 1 3 4 2 5 1 OPLab, IM, NTU

  18. Under Link Failure Two subnetworks 3 4 1 0 1 1 2 0 5 1 OPLab, IM, NTU

  19. Under Link Failure Add C to these linksand decrease the original g(i,j) by 1 3 4 2 5 1 OPLab, IM, NTU

  20. Under Link Failure OPLab, IM, NTU

  21. Under Node Failure • Augments network capacity • Under a single node failure • Construct a restoration ring OPLab, IM, NTU

  22. Notation OPLab, IM, NTU

  23. Under Node Failure t(1,2,3,4) = 1 t(1,3,4) = 1 t(1,5,4) = 2 t(1,4) = 4 t(1,2,3) = 1 t(1,3) = 1 t(3,4,5) = 2 t(3,5) = 2 OPLab, IM, NTU

  24. N(2) ＝ {t(1,2,3,4) , t(1,2,3)}t(1,2,3,4) =1 is reroute on link (1,4) (1,4) + 1 t(1,2,3) = 1 is reroute on link (1,3) (1,3) + 1 Update N(2) ＝ Under Node Failure N(3) = {t(1,2,3,4) , t(1,3,4)} t(1,2,3,4) =1 is reroute on link (1,4) Update N(3) = {t(1,3,4) =1} N(4) = {t(3,4,5) } t(3,4,5) =1 is reroute on link (3,5) Update N(4) = {t(3,4,5) = 1} N(5) = {t(1,5,4)} t(1,5,4) =1 is reroute on link (1,4) Update N(5) = {t(1,5,4) = 1} OPLab, IM, NTU

  25. Under Node Failure 1 1 1 OPLab, IM, NTU

  26. Under Node Failure • After one iteration the updated traffic value are t (1,4) = 2 t (3,5) = 1 OPLab, IM, NTU

  27. N(3) ＝ {t(1,3,4) } t(1,3,4) =1 is reroute on link (1,4) (1,4) + 1 Update N(3) = N(4) = {t(3,4,5) }t(3,4,5) =1 is reroute on link (3,5) (3,5) + 1 Update N(4)＝ N(5) = {t(1,5,4)} t(1,5,4) =1 is reroute on link (1,4) Update N(5) = Under Node Failure 1 1 1 OPLab, IM, NTU

  28. Under Node Failure OPLab, IM, NTU

  29. Outline • Introduction - Principal Issues for Survivable Network Design - Message of Paper • Three approaches - Under Partial Link Failure - Under Link Failure - Under Node Failure • Conclusions OPLab, IM, NTU

  30. Conclusions • The goal of this paper is to present severalsurvivable designs by augmenting capacities along prudently selected variants of spanning tree and ring structures. • Future work may evaluate the designs by comparing the results to those obtained by other heuristics. OPLab, IM, NTU

  31. Thanks for your listening OPLab, IM, NTU

  32. OPLab, IM, NTU

  33. Consider a network with multiple disconnected subnetworks and suppose a spanning tree can be constructed on the complementary graphs of subnetworks m = 1 , 2 . The number of links comprising the two spanning trees is less than the number of links of a spanning tree on the complementary graph of a subnetwork that is the union of the two. Consider two disconnected subnetworks. A spanning tree always exists on the complementary graph of a subnetwork that is the union of the two. OPLab, IM, NTU

  34. Under Partial Link Failure • C – s’(k,l): traffic units need be rerouted. • s(k,l) – s’(k,l) : traffic units can be absorbed by the remaining spare on other components of link (k,l). • C – s(k,l) : traffic units can be routed between nodes k and l using spare capacity on paths comprised of other links. • [C – s(k,l) ] + [s(k,l) – s’(k,l) ] = C – s’(k,l) OPLab, IM, NTU

More Related