28
1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

Embed Size (px)

Citation preview

Page 1: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

1

EL736 Communications Networks II: Design and

Algorithms

Class10: Restoration and Protection Design of Resilient

NetworksYong Liu11/28/2007

Page 2: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

2

Outline

Resilient Network Design

Link Capacity Re-establishment

Demand Flow Re-establishment

Separated Normal and Protection Design

Page 3: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

3

Resilient Network Design

Objective: design networks to be resilient (robust) against failure situations such that all demands can be carried when portion of network resources are temporally failed

Recovery Mechanisms: ProtectionProtection (Pre-provisioned): to (Pre-provisioned): to resolve a conflict due to a failure resolve a conflict due to a failure prior to the failure occurringprior to the failure occurring

RestorationRestoration (Post-provisioned): to (Post-provisioned): to resolve a failure only once the failure resolve a failure only once the failure has occurredhas occurred

Page 4: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

4

Protection Illustration

2

15

3

1

97

8

1614 17

20

654

12

131110

242322

2118 19

Source Destination

Working path

Path-protection backup (link-disjoint)

Page 5: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

5

Classification of Protection

1+1 (Full) Protection: data transmitted data transmitted simultaneously on a simultaneously on a primary path and a primary path and a dedicated backup path; dedicated backup path; switch to backup path in switch to backup path in case the primary path case the primary path fails. fails. [hot-standby][hot-standby]

1:1 Protection:1:1 Protection: data data transmitted only on transmitted only on primary path; switch to primary path; switch to backup path in case the backup path in case the primary path fails. primary path fails.

M:N Protection:M:N Protection: M back-up M back-up paths protect N primary paths protect N primary paths (recover from up to paths (recover from up to M failures out of N paths) M failures out of N paths)

PrimaryPrimary

BackupBackup

S t

N PrimaryN Primary

M BackupM Backup

S t

Page 6: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

6

2

15

3

1

97

8

1614 17

20

654

12

131110

242322

2118 19

Restoration Illustration

Source Destination

Working path

Restored path

Page 7: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

7

Recovery in Traffic & Transport Networks

Traffic Network: packets/calls traversing failed links re-route on surviving links (link capacity can be used for normal and recovery traffic)

Transport Network: reserved recovery capacity for automated switch over

Resilient Network Design: how much recovery capacity needed to accommodate packets/calls re-routing?

Recovery CapacityRecovery Capacity reserved vs. existingreserved vs. existing

• Can it be used for normal traffic?Can it be used for normal traffic? dedicated vs. shareddedicated vs. shared

• Only used for recovery of specific links/demands? Only used for recovery of specific links/demands? integrated vs. incremental designintegrated vs. incremental design

• Recovery considered when build the normal topology? Recovery considered when build the normal topology?

Page 8: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

8

Link/Path Re-establishment

Link Re-establishment traffic on a failed link rerouted different flows follow same route

Path Re-establishment end-end flows on a failed link re-established

different flows might have different routes

Page 9: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

9

Protection Priorities

Mission Critical Traffic -- Predetermined restoration path with pre-allocated capacity

Premium Traffic -- Predetermined restoration path without pre-allocated capacity

Public Traffic -- Restoration path calculated in the fly

Low Priority Traffic -- Preemptable working paths, may be unprotected

Page 10: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

10

Characterization of Failure States

link availability coefficients

path availability coefficients

demand volume

Page 11: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

11

Simplest Protection: path diversity

Pro.s: zero reconfiguration Con.s: low efficiency, doesn’t explore bandwidth on

alternate paths

Page 12: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

12

Generalized Path Diversity surviving paths realize surviving demands

Page 13: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

13

Link Capacity Re-establishment

failure assumption: total failure on a single link, recover from any single link recovery capacity reserved, shared among all

possible link failures

Page 14: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

14

Link Capacity Re-establishment

Page 15: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

15

Hot-Standby Link Protection recovery capacity: reserved, dedicated to each specific link

single restoration path for each link

Page 16: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

16

Hot-Standby Link Protection

Page 17: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

17

Demand Flow Re-establishment restore individual flows instead of link capacities

not restricted to single link failure

recovery capacity unreserved, can also be used for normal traffic,.

more efficient solution

Page 18: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

18

Unrestricted Reconfiguration flows can reconfigured arbitrarily for each

failure state reconfiguration before/after failures

Page 19: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

19

Restricted Reconfiguration

global reconfiguration incurs large overhead

restriction: don’t touch flows not on failed links

potentially less efficient solution

Page 20: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

20

Restricted Reconfiguration

Page 21: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

21

Path Restoration under Budget Constraint

Budget lower than lowest cost to fully recover all demand under all failure states

recover portions of demands maximize the lowest portion among all demands under all

failure states

Page 22: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

22

Path Restoration under Budget Constraint

Page 23: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

23

Separated Normal and Protection Design

Cheapest Solution: design normal and protection capacity and flow simultaneously in a coordinated way.

In practice: Phase I: design normal capacity/flow; Phase II: design protection capacity/flow for phase I solution

Page 24: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

24

Phase I

Page 25: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

25

Phase II

Page 26: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

26

Protection Design with Given Capacity

link capacities given reserve a portion of capacity to recover from any

possible single link failure [reserved, shared] to guarantee full recovery, what is the maximal portion

of demand can be carried?

Page 27: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

27

Protection Design with Given Capacity

Page 28: 1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007

28

Extensions

what if recovery capacity on each link is not reserved ?

solution tells lowest ratio for all demands, what about other demands with potential higher ratios? Max-min allocation?