Survivable Optical Wdm Networks

Covers these key topics: Shared-mesh protection for optical WDM networks. Survivable traffic grooming for hierarchical optical WDM networks. Survivable data over next-generation SONET/SDH with inverse multiplexing.

Canhui (Sam) Ou received a Ph.D. degree from the University of California, Davis, in 2004. His technical interests include WDM networks, MPLS, optical Ethernet, and FTTx. He is a Principal Member of Technical Staff at SBC Communications, Inc. He worked at Sprint Advanced Technology Laboratories and Fujitsu Laboratories of America as an intern.Biswanath Mukherjee received a Ph.D. degree from University of Washington, Seattle, in 1987. In 1987, he joined the University of California, Davis, where he has been Professor of computer science since 1995, and served as Chairman of computer science during 1997-2000. He is author of Optical Communication Networks book. He is a Member of the Board of Directors of IPLocks, a Silicon Valley startup company. He has consulted for and served on the Technical Advisory Board of a number of startup companies in optical networking. His research interests include lightwave networks, network security, and wireless networks. Dr. Mukherjee is winner of the 2004 Distinguished Graduate Mentoring Award from UC Davis. He serves or has served on the Editorial Boards of the IEEE/ACM Transactions on Networking, IEEE Network, ACM/Baltzer Wireless Networks (WINET), Photonic Network Communications, and others. He also served as Editor-at-Large for optical networking and communications for the IEEE Communications Society. He served as the Technical Program Chair of the IEEE INFOCOM'96 Conference.

Dedication

vii

List of Figures

xv

Preface

xxi

Acknowledgments

xxv

1. INTRODUCTION

1

(8)

1.1 Optical Networking

1

(4)

1.1.1 Telecommunication Networks

1

(1)

1.1.2 Wavelength-Routed WDM Mesh Networks

2

(1)

1.1.3 Survivable WDM Mesh Networks

3

(2)

1.2 An Overview of the Book

5

(4)

1.2.1 Shared-Path Protection

5

(1)

1.2.2 Sub-Path Protection for Scalability and Fast Recovery

5

(1)

1.2.3 Segment Protection

5

(1)

1.2.4 Survivable Traffic Grooming-Dedicated Protection

6

(1)

1.2.5 Survivable Traffic Grooming-Shared Protection

6

(1)

1.2.6 Survivable Data over SONET/SDH

7

(2)

2. SHARED-PATH PROTECTION

9

(20)

2.1 Introduction

9

(2)

2.2 Problem Statement and Complexity Analysis

11

(3)

2.2.1 Problem Statement

11

(2)

2.2.2 Complexity Analysis

13

(1)

2.3 Compute A Feasible Solution (CAFES)

14

(2)

2.3.1 Trap Topology

15

(1)

2.3.2 Backup-Sharing-Caused Trap

15

(1)

2.4 Optimization (OPT)

16

(4)

2.5 Illustrative Numerical Results

20

(4)

2.5.1 Blocking Probability

21

(1)

2.5.2 Percentage of Unreachable Blocking

22

(1)

2.5.3 Resource Overbuild

23

(1)

2.5.4 Average Hop Distance

23

(1)

2.6 Conclusion

24

(1)

Appendix 2.A NP-Completeness of DSPLP Problem

25

(4)

3. SUB-PATH PROTECTION

29

(32)

3.1 Introduction

29

(3)

3.1.1 Related Work

29

(2)

3.1.2 Multi-Domain Optical Networks and Our Proposal

31

(1)

3.1.3 Organization

32

(1)

3.2 Sub-Path Protection

32

(5)

3.2.1 An Illustrative Example

32

(1)

3.2.2 Different Cases

33

(1)

3.2.3 Domain-Border-Node (DBN) Failures

34

(1)

3.2.4 Problem Statement

35

(1)

3.2.5 Proof of NP-Completeness

36

(1)

3.3 ILP Formulation for RWA with Sub-Path Protection

37

(6)

3.3.1 Notations

38

(1)

3.3.2 Sub-Path Protection: Split ILP Formulation

38

(5)

3.3.3 Equivalence of the Split ILP and the Original Problem

43

(1)

3.4 Heuristic

43

(6)

3.4.1 Phase 1: Find Shortest Path Pair for Each Lightpath with Respect to Domain Constraints

44

(2)

3.4.2 Phase 2: Wavelength Assignment

46

(1)

3.4.3 Phase 3: Optimization

46

(3)

3.4.4 Complexity

49

(1)

3.5 Results and Discussions

49

(8)

3.5.1 Recovery Time

50

(2)

3.5.2 Survivability

52

(1)

3.5.3 Scalability

53

(1)

3.5.4 Resource Utilization

54

(3)

3.6 Conclusion

57

(1)

Appendix 3.A NP-Completeness of RWA for Shared-Path Protection

57

(2)

Appendix 3.B NP-Completeness of Optimal Backup Routing (OBR)

59

(2)

4. SEGMENT PROTECTION

61

(24)

4.1 Introduction

61

(1)

4.2 Generalized Segment Protection

62

(11)

4.2.1 Generalized Segment Protection

62

(2)

4.2.2 The GSP Heuristic

64

(4)

4.2.3 Illustrative Numerical Results

68

(5)

4.3 Providing Differentiated Quality of Protection (QoP) Based on Generalized Segment Protection

73

(9)

4.3.1 Motivation

74

(1)

4.3.2 GSP_QoP Heuristic

75

(2)

4.3.3 Illustrative Numerical Results

77

(5)

4.4 Conclusion

82

(3)

5. SURVIVABLE TRAFFIC GROOMING-DEDICATED PROTECTION

85

(30)

5.1 Introduction

85

(3)

5.1.1 Traffic Grooming

86

(1)

5.1.2 Lightpath Protection

86

(1)

5.1.3 Survivable Traffic Grooming

87

(1)

5.1.4 Our Proposal

87

(1)

5.2 Grooming-Node Architecture

88

(1)

5.3 Problem Statement

89

(1)

5.4 Proposed Approaches

89

(5)

5.4.1 Protection-at-Lightpath (PAL) Level

90

(1)

5.4.2 Protection-at-Connection (PAC) Level

91

(1)

5.4.3 PAL vs. PAC: A Qualitative Comparison

92

(2)

5.5 PAL Heuristic

94

(3)

5.5.1 Problem Complexity

94

(1)

5.5.2 PAL Heuristic

95

(1)

5.5.3 Explanation

95

(2)

5.5.4 Optimality

97

(1)

5.5.5 Variations

97

(1)

5.5.6 Computational Complexity

97

(1)

5.6 PAC Heuristic

97

(5)

5.6.1 Node Modeling and Network-State Representation

98

(1)

5.6.2 Route Computation

99

(1)

5.6.3 Lightpath-Setup Strategy

100

(2)

5.6.4 Computational Complexity

102

(1)

5.7 Illustrative Numerical Results

102

(10)

5.7.1 Bandwidth-Blocking Ratio (BBR)

104

(1)

5.7.2 Resource Utilization

104

(3)

5.7.3 Resource-Efficiency Ratio (RER)

107

(3)

5.7.4 Effect of Different Parameters

110

(2)

5.8 Conclusion

112

(1)

Appendix 5.A NP-Completeness of WDM-PAC

112

(3)

6. SURVIVABLE TRAFFIC GROOMING-SHARED PROTECTION

115

(30)

6.1 Problem Statement

115

(1)

6.2 Proposed Schemes

116

(8)

6.2.1 Protection-at-Lightpath (PAL) Level

116

(3)

6.2.2 Mixed Protection-at-Connection (MPAC) Level

119

(1)

6.2.3 Separate Protection-at-Connection (SPAC) Level

120

(1)

6.2.4 A Qualitative Comparison

121

(3)

6.3 Heuristic Algorithms

124

(11)

6.3.1 MPAC Heuristic

124

(6)

6.3.2 SPAC Heuristic

130

(1)

6.3.3 PAL Heuristic

131

(4)

6.4 Illustrative Numerical Results

135

(7)

6.4.1 Bandwidth-Blocking Ratio

135

(2)

6.4.2 Resource Utilization

137

(2)

6.4.3 Resource-Efficiency Ratio

139

(2)

6.4.4 Effects of Different Parameters

141

(1)

6.5 Conclusion

142

(3)

7. SURVIVABLE VIRTUAL CONCATENATION

145

(26)

7.1 Introduction

145

(4)

7.1.1 Next-Generation SONET/SDH Technologies

145

(2)

7.1.2 Motivation for Survivable DoS

147

(1)

7.1.3 Our Contribution

148

(1)

7.1.4 Organization

148

(1)

7.2 Protecting Individual VCG Member (PIVM)

149

(4)

7.2.1 Basic Idea

149

(1)

7.2.2 An Example

149

(1)

7.2.3 Route Computation: General Case

150

(3)

7.3 Provisioning fast Restorable VCG (PREV)

153

(7)

7.3.1 Basic Idea

153

(1)

7.3.2 An Example

153

(1)

7.3.3 Pre-Select a Backup Path for Every Node Pair

154

(2)

7.3.4 Route Computation

156

(4)

7.4 Route Computation with Extensions to Control the Number of VCG Members

160

(1)

7.5 Performance: PIVM vs. PREV

161

(5)

7.5.1 Bandwidth-Blocking Ratio

161

(1)

7.5.2 Resource Overbuild

162

(1)

7.5.3 Fault-Recovery Time

163

(2)

7.5.4 Impact of VCG Size

165

(1)

7.6 Conclusion

166

(1)

Appendix 7.A NP-Completeness of the CMCMP Problem

167

(4)

References

171

(10)

Index

181

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.