Traffic Grooming in Optical Wdm... | Buy

Traffic Grooming in Optical WDM Mesh Networks captures the state-of-the-art in the design and analysis of network architectures, protocols, and algorithms for implementing efficient traffic grooming in optical WDM mesh networks. Key topics include:- Static traffic grooming- Dynamic traffic grooming- Grooming models and policies- Grooming node architectures- Design of grooming network- Traffic grooming in next-generation SONET/SDH networksThe authors investigate traffic-grooming problems in optical WDM mesh networks from various aspects. They cover static and dynamic traffic grooming, as well as grooming policies for both environments. A fundamental graph model for traffic-grooming networks is proposed. A variety of grooming-node architectures are examined and their performances compared. Design of traffic-grooming networks using different node architectures is explored, and traffic grooming in next-generation SONET/SDH networks is presented.

Prof. Mukherjee is a leading & highly respected researcher in the field. He has published a successful optical networking textbook with McGraw-Hill and has published extensively in IEEE Transactions and other related publications. He is also Editor for the Springer series on Optical Networks.

Dedication

v

List of Figures

xiii

List of Tables

xvii

Preface

xix

Acknowledgments

xxiii

Overview

1

(16)

Background

1

(1)

Traffic Grooming in SONET Ring Network

2

(7)

Node Architecture

2

(2)

Single-Hop Grooming in SONET/WDM Ring

4

(1)

Multi-Hop Grooming in SONET/WDM Ring

5

(1)

Dynamic Grooming in SONET/WDM Ring

6

(2)

Grooming in Interconnected SONET/WDM Rings

8

(1)

Traffic Grooming In Wavelength-Routed WDM Mesh Network

9

(8)

Network Provisioning

10

(2)

Network Design and Planner

12

(1)

Grooming with Protection Requirement in WDM Mesh Network

13

(2)

Grooming with Multicast in WDM Mesh Network

15

(1)

Protocols and Algorithm Extensions for WDM Network Control

16

(1)

Static Traffic Grooming

17

(26)

Introduction

17

(2)

General Problem Statement

19

(1)

Node Architecture

20

(2)

Mathematical (ILP) Formulation

22

(7)

Multi-Hop Traffic Grooming

23

(5)

Single-Hop Traffic Grooming

28

(1)

Formulation Extension for Fixed-Transceiver Array

28

(1)

Computational Complexity

29

(1)

Illustrative Numerical Results From ILP Formulations

29

(4)

Heuristic Approach

33

(6)

Routing

33

(1)

Wavelength Assignment

34

(1)

Heuristics

35

(1)

Heuristic Results and Comparison

36

(3)

Mathematical Formulation Extension

39

(2)

Extension for Network Revenue Model

39

(1)

Illustrative Results

40

(1)

Conclusion

41

(2)

A Generic Graph Model

43

(28)

Introduction

43

(3)

Challenges of Traffic Grooming in a Heterogeneous WDM Mesh Network

44

(1)

Contributions of this Chapter

45

(1)

Construction of an Auxiliary Graph

46

(4)

Solving the Traffic-Grooming Problem Based on the Auxiliary Graph

50

(7)

The IGABAG Algorithm

51

(1)

The INGPROC Procedure and Traffic-Selection Schemes

51

(3)

An Illustrative Example

54

(3)

Grooming Policies and Weight Assignment

57

(4)

Grooming Policies

57

(1)

Weight Assignment

58

(3)

Numerical Examples

61

(7)

Comparison of Grooming Policies

61

(3)

Comparison of Traffic-Selection Schemes in a Relatively Small Network

64

(2)

Comparison in a Larger Representative Network

66

(2)

Conclusion

68

(3)

Dynamic Traffic Grooming

71

(22)

Introduction

71

(2)

Traffic Engineering In Optical WDM Networks Through Traffic Grooming

71

(1)

Optical WDM Network Heterogeneity

72

(1)

Organization

72

(1)

Node Architecture in a Heterogeneous WDM Backbone Network

73

(2)

Provisioning Connections in Heterogeneous WDM Network

75

(5)

Resource Discovery

76

(2)

Route Computation

78

(2)

Signaling

80

(1)

A Generic Provisioning Model

80

(5)

Graph Model

80

(3)

Engineering Network Traffic Using the Proposed Graph Model

83

(1)

Computational Complexity

84

(1)

Illustrative Numerical Examples

85

(7)

Comparison of Grooming Policies

85

(2)

Performance under Different Scenarios

87

(5)

Conclusion

92

(1)

Grooming Switch Architectures

93

(22)

Introduction

93

(1)

Grooming Switch Architectures and Grooming Schemes

94

(7)

Single-Hop Grooming OXC

94

(1)

Multi-Hop Partial-Grooming OXC

95

(3)

Multi-Hop Full-Grooming OXC

98

(1)

Light-tree-Based Source-Node Grooming OXC

99

(1)

Summary

100

(1)

Approaches and Algorithms

101

(4)

Single-Hop and Multi-Hop Grooming using an Auxiliary Graph Model

101

(2)

Source-Node Grooming Using Light-Tree Approach

103

(2)

Illustrative Numerical Results

105

(8)

Bandwidth Blocking Ratio (BBR)

106

(4)

Wavelength Utilization

110

(1)

Resource Efficiency Ratio (RER)

110

(3)

Conclusion

113

(2)

Sparse Grooming Network

115

(10)

Problem Statement and Mathematical Formulation

116

(3)

Maximizing Network Throughput

118

(1)

Minimizing Network Cost

119

(1)

Heuristic Approaches

119

(2)

Grooming-Node-Selection Schemes

120

(1)

Traffic-Routing Schemes

120

(1)

Illustrative Numerical Examples

121

(3)

Conclusion

124

(1)

Network Design with OXCS of Different Bandwidth Granularities

125

(30)

Introduction

125

(1)

Problem Statement and Challenges

126

(4)

Problem Formulation

126

(1)

Challenges

127

(3)

Our Approach

130

(1)

Construction of an Auxiliary Graph

130

(10)

Node Representation

130

(6)

Circuits and Induced Topology

136

(2)

Auxiliary Graph for the Network

138

(2)

Framework for Network Design Based on the Auxiliary Graph

140

(10)

Algorithm for Routing a Connection Request

140

(2)

An Illustrative Example

142

(4)

Weight Assignment

146

(2)

Network Design Framework

148

(2)

Numerical Examples and Discussion

150

(3)

Conclusion

153

(2)

Traffic Grooming in Next-Generation Sonet/SDH

155

(12)

Virtual Concatenation

155

(5)

SONET Virtual Concatenation

156

(1)

Benefits of Virtual Concatenation: a Network Perspective

156

(2)

Illustrative Numerical Examples

158

(2)

Inverse Multiplexing

160

(5)

Problem Statement and Proposed Approaches

161

(2)

Illustrative Numerical Results

163

(2)

Conclusion

165

(2)

References

167

(6)

Index

173

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.