Sách GMPLS-achitecture and aplication

Thảo luận trong 'Sách Ngoại Ngữ' bắt đầu bởi Thúy Viết Bài, 5/12/13.

  1. Thúy Viết Bài

    Thành viên vàng

    Bài viết:
    198,891
    Được thích:
    173
    Điểm thành tích:
    0
    Xu:
    0Xu
    Contents
    Preface xvii
    Chapter 1 Multiprotocol Label Switching 1
    1.1 Some History 1
    1.2 Label Switching 2
    1.2.1 Application of MPLS to Existing Switching Networks 4
    1.2.2 Label Stacking 4
    1.3 Signaling Protocols 6
    1.4 Further Reading 7
    Chapter 2 An Overview of Transport Networks 9
    2.1 Transport 9
    2.2 Transport Technologies 10
    2.2.1 Gigabit Ethernet 11
    2.2.2 Time Division Multiplexing 11
    2.2.3 Wavelength Division Multiplexing 13
    2.2.4 Fiber Switching 14
    2.3 Transport Network Topologies 15
    2.3.1 Simple Rings 15
    2.3.2 Bidirectional and Protected Rings 16
    2.3.3 Interconnected Rings and Meshed Rings 17
    2.3.4 Point-to-Point Links 18
    2.3.5 Mesh Networks 20
    2.4 Functional Components and Planes 21
    2.5 Further Reading 23
    Chapter 3 From MPLS to GMPLS 25
    3.1 The Origins of GMPLS 25
    3.1.1 Lambda Switching 26
    3.1.2 Generalizing the Technology 26
    3.2 Basic GMPLS Requirements 28
    3.2.1 What is a Label? 28
    3.2.2 Switching Types 29
    3.2.3 What is a Label Switched Path? 29
    3.2.4 What is Bandwidth? 30
    3.2.5 Bidirectionality of Transport Connections 31
    3.2.6 Separation of Control and Data Planes 32
    3.2.7 Tunneling and Hierarchies 32
    3.3 Further Reading 34
    Chapter 4 GMPLS Signaling 35
    4.1 Introduction to Signaling 35
    4.1.1 Addressing 37
    4.2 Basic GMPLS Signaling 38
    4.2.1 Sessions, Tunnels, and LSPs 38
    4.2.2 LSP Routes 40
    4.2.3 Labels and Resources 42
    4.3 LSP Establishment and Maintenance 44
    4.3.1 Basic Messages 45
    4.3.2 RSVP-TE Messages and Objects 45
    4.3.3 LSP Establishment 47
    4.3.4 Reliable Message Delivery 48
    4.3.5 LSP Maintenance 49
    4.3.6 Error Cases 52
    4.3.7 LSP Teardown 54
    4.3.8 LSP Modification 54
    4.3.9 Bidirectional SLPs 56
    4.4 Fine Control of Label Allocation 56
    4.5 Other Signaling Objects 59
    4.6 Multiple Domains 60
    4.7 Further Reading 61
    Chapter 5 GMPLS Routing 63
    5.1 Routing in IP and Traffic Engineered Networks 63
    5.2 Basic Traffic Engineering Data 64
    5.3 GMPLS Routing Information 65
    5.4 Overview of IP Routing Protocols 67
    5.4.1 Operation of Routing Protocols in
    GMPLS Networks 68
    5.5 Protocol-Specific Extensions 70
    5.5.1 OSPF 70
    5.5.2 IS-IS 70
    5.6 Advanced Features 71
    5.6.1 Graceful Shutdown 71
    5.6.2 Inter-Domain Traffic Engineering 72
    5.7 Further Reading 74
    Chapter 6 Link Management 75
    6.1 Links, Control Channels, and Data Channels 75
    6.2 The Link Management Protocol 76
    6.2.1 LMP Messages 77
    6.2.2 Control Channel Management 78
    6.2.3 Link Discovery and Verification 80
    6.2.4 Link Capabilities 82
    6.2.5 Fault Isolation 82
    6.2.6 Authentication 84
    6.2.7 Implications for Traffic Engineering
    and Link Bundling 84
    6.3 Device-Level Resource Discovery 86
    6.3.1 LMP-WDM 87
    6.4 Further Reading 87
    Chapter 7 GMPLS and Service Recovery 89
    7.1 Failures in Transport Networks 90
    7.2 Network Survivability Definitions 90
    7.3 Service Recovery Cycle 92
    7.4 Service Recovery Classes 95
    7.5 Recovery Levels and Scopes 97
    7.6 Span Recovery 99
    7.6.1 Dedicated Unidirectional 1 þ 1 Span Protection 100
    7.6.2 Dedicated Bidirectional 1 þ 1 Span Protection 101
    7.6.3 Dedicated 1:1 Span Protection with Extra Traffic 102
    7.6.4 Shared M:N Span Protection 105
    7.6.5 Enhanced Span Protection 107
    7.7 Path Recovery 109
    7.7.1 Path Recovery Domain 109
    7.7.2 End-to-End Path Recovery 111
    7.7.3 Path Segment Recovery 122
    7.7.4 Combining Segment and End-to-End Recovery 133
    7.7.5 Fast Re-Route 135
    7.8 Control Plane Recovery 141
    7.8.1 Control Plane Failures 142
    7.8.2 Control Plane Re-Synchronization via Signaling 144
    7.8.3 Control Plane Restoration Using Local Databases 144
    7.8.4 Control Plane Restoration Using Data Plane State 145
    7.8.5 Managing Control Plane Partitioned LSPs 146
    7.9 Further Reading 152
    Chapter 8 GMPLS and Traffic Engineering 155
    8.1 Evolution of Traffic Engineering 155
    8.1.1 Traffic Engineering Through Modifying
    Network Link Metrics 157
    8.1.2 Traffic Engineering Through ECMP 158
    8.1.3 Traffic Engineering Through Service
    Type Based Routing 159
    8.1.4 Traffic Engineering Using Overlays 160
    8.1.5 Traffic Engineering Based on MPLS 161
    8.2 Traffic Engineering in Transport Networks 162
    8.2.1 Traffic Engineering in Photonic Networks 166
    8.3 GMPLS Traffic Engineering Definitions 167
    8.3.1 TE Link Attributes 171
    8.4 GMPLS Traffic Engineering Protocols 178
    8.4.1 OSPF-TE 179
    8.4.2 ISIS-TE 180
    8.5 Traffic Engineering Link Bundling 181
    8.6 Traffic Engineering Regions and Switching Layers 182
    8.6.1 Virtual Network Topology 187
    8.6.2 Hierarchial LSP Protection 189
    8.6.3 Adaptation Capabilities 190
    8.7 Inter-Domain Traffic Engineering 191
    8.7.1 Path Computation with Limited TE Visibility 191
    8.7.2 Provisioning of Inter-Domain LSPs 195
    8.7.3 Handling Inter-Domain LSP Setup Failures 196
    8.8 Service Path Re-Optimization 197
    8.9 Further Reading 198
    Chapter 9 GMPLS Path Computation 199
    9.1 Definitions 199
    9.2 Transport Network Graph Representation 200
    9.3 Basic Single Source Algorithms 202
    9.3.1 Bellman-Ford Algorithm 204
    9.3.2 Dijkstra Algorithm 205
    9.3.3 Modified Dijkstra Algorithm 209
    9.3.4 Breadth First Search Algorithm 210
    9.3.5 Johnson Algorithm 211
    9.4 K Shortest Paths Algorithm 213
    9.5 Diverse Path Computation 216
    9.5.1 Simple Two-Step Approach 218
    9.5.2 Computation of Two Edge-Disjoint Paths 219
    9.5.3 Computation of Two Vertex-Disjoint Paths 220
    9.5.4 Computation of Two Best-Disjoint Paths 223
    9.5.5 Computation of K (K>2) Edge-, Vertex-,
    Best-Disjoint Paths 229
    9.5.6 Computing Physically Disjoint Paths 231
    9.6 Further Reading 232
    hapter 10 Constraint-Based Path Computation 233
    10.1 Attributes Within the Network 234
    10.1.1 Link Attributes 234
    10.1.2 Path Attributes 235
    10.2 Path Computation Constraints 236
    10.2.1 Handling of Exclusions 236
    10.2.2 Handling of Link-Type Constraints 238
    10.2.3 Handling of Inclusions 238
    10.2.4 Handling of Path-Type Constraints 242
    10.3 Optical Trails in Transparent Networks 247
    10.4 Further Reading 257
    hapter 11 Point-to-Multipoint GMPLS 259
    11.1 GMPLS Point-to-Multipoint Traffic Engineering 259
    11.1.1 TE Point-to-Multipoint Related Definitions 262
    11.2 Point-to-Multipoint Tree Computation 264
    11.2.1 P2MP-Related Advertisements 267
    11.3 Signaling Point-to-Multipoint Tunnels 268
    11.3.1 P2MP Tunnel Setup 268
    11.3.2 Processing Leaf Descriptors 271
    11.3.3 P2MP Tunnel Teardown 272
    11.3.4 Handling of Failures 272
    11.4 P2MP Tunnel Decomposition 273
    11.4.1 Tunnel Re-Merge 275
    11.4.2 Limited Branching Capability Problem 278
    11.5 Grafting and Pruning 280
    11.6 Advanced Features 282
    11.6.1 Hierarchical P2MP Tunnels 282
    11.6.2 Inter-Domain P2MP Tunnels 282
    11.6.3 Multi-Layer P2MP Tunnels 286
    11.6.4 Leaf-Initiated Join and Drop Procedures 289
    11.6.5 P2MP Service Recovery 291
    11.6.6 P2MP Tunnel Re-Optimization 293
    11.7 Further Reading 294
    Chapter 12 Layer One Virtual Private Networks 295
    12.1 Layer One Point-to-Point Services 295
    12.2 Layer One VPN Deployment Scenarios 300
    12.2.1 Multi-Service Backbone 300
    12.2.2 Carrier’s Carrier 303
    12.2.3 Layer One Resource Trading 303
    12.2.4 Complex Layer One VPN 304
    12.3 Resource-Sharing Models 307
    12.4 Layer One VPN Functional Model 309
    12.5 Layer One VPN Service Models 310
    12.6 GMPLS-Based Layer One VPN Offerings 314
    12.6.1 GVPNs 315
    12.6.2 GMPLS Overlays 321
    12.7 Further Reading 324
    Chapter 13 Architectural Models 325
    13.1 The Internet’s End-to-End Model 326
    13.1.1 How Far Can You Stretch an
    Architectural Principle? 327
    13.2 GMPLS Service Models 329
    13.2.1 The Peer Model 329
    13.2.2 The Overlay Model 330
    13.2.3 The Hybrid Model 331
    13.3 The ITU-T’s ASON Architecture 332
    13.3.1 Nodes, Links, and Subnetworks 333
    13.3.2 Reference Points 335
    13.3.3 Calls and Connections 337
    13.3.4 Abstract Functional Entities 338
    13.3.5 Managing Connectivity Across Subnetworks 341
    13.3.6 Network Layers and Technology Types 343
    13.4 GMPLS and ASON Networks 344
    13.4.1 The OIF UNI Protocol Extensions 344
    13.4.2 The ITU-T’s UNI and E-NNI Protocols 346
    13.4.3 Applying the GMPLS Overlay Model 347
    13.4.4 Calls and Connections in GMPLS 349
    13.4.5 Contrasting GMPLS and ASON 350
    13.5 Further Reading 350
    Chapter 14 Provisioning Systems 353
    14.1 Structure of Management 354
    14.1.1 Management Tools 354
    14.2 Management Networks 356
    14.3 Proprietary Management Interfaces 356
    14.4 Standardized Management Protocols 357
    14.5 Web Management 360
    14.6 Alarms and Events 361
    14.7 Further Reading 362
    Chapter 15 GMPLS MIB Modules 363
    15.1 MPLS TE MIB Management 363
    15.2 GMPLS MIB Modules 364
    15.3 GMPLS LSR Management 365
    15.4 GMPLS Traffic Engineering LSP Management 367
    15.5 The TE Link MIB Module 369
    15.6 The LMP MIB Module 370
    15.7 The Interfaces MIB Module 372
    15.8 Further Reading 373
    Glossary 375
    Index 395
     

    Các file đính kèm: