Meshbased Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Wayne D. Grover
 出版商: Prentice Hall PTR
 出版日期: 20030826
 售價: $1,300
 貴賓價: 9.5 折 $1,235
 語言: 英文
 頁數: 880
 裝訂: Hardcover
 ISBN: 013494576X
 ISBN13: 9780134945767
下單後立即進貨 (3週~5週)
買這商品的人也買了...

貴賓價: $1,568MPLS and Label Switching Networks, 2/e

貴賓價: $882Network Simulation Experiments Manual
商品描述
Description:
Meshbased survivability offers many advantages, but the research, educational and perational communications communities need to absorb new concepts and ideas about network operation; letting the network selforganize its own logical configuration for example. Operators also need to understand, evaluate and adopt new methods and models for network design and planning. This book is designed to contribute to enabling this evolution towards meshbased survivable networking.
Table of Contents:
About the Book's Web Site www.ee.ualberta.ca/~grover/
Foreword.
Preface.
Acknowledgements.
Introduction and Outline.
I. PREPARATIONS.
1. Orientation to Transport Networks and
Technology.
Aggregation of Service Layer Traffic into
Transport Demands. Concept of Logical versus Physical Networks: Virtual
Topology. Multiplexing and Switching. Concept of Transparency. Layering and
Partitioning. Plesiochronous Digital Hierarchy (PDH). SONET / SDH. SONET
Overheads. Generic SONET Terminal Multiplexer. Generic SONET Add/Drop
Multiplexer. Digital CrossConnect Systems. Hubs, Grooming and Backhaul.
Fundamental Efficiency of Edge Grooming and Core Transport. Broadband ISDN and
Asynchronous Transfer Mode (ATM). Concept of LabelSwitching: The Basis of ATM
and MPLS. MultiProtocol Label Switching (MPLS). Network Planning Aspects of
Transport Networks. Modularity and EconomyofScale. Fiber Route Structures.
Network Redundancy. SharedRisk Entities and Fault Multiplication. Demand
Patterns. Short and LongTerm Transport Network Planning Contexts.
2. Internet Protocol and Optical Networking.
Increasing Network Efficiency. DWDM and Optical
Networking. Coarse and Dense WDM. Optical Amplifiers. Regenerators. Optical
Add/drop Multiplexers (OADMs). Transparent, Opaque and Translucent Optical
Networks. Routing and Wavelength Assignment (RWA) Problem. Optical
CrossConnects (OXC). Wavelength Path Optical Crossconnect (WPOXC). Optical
CrossConnect for Virtual Wavelength Paths (VWPOXC). Partial Wavelength
Converting OXC (PVWPOXC). DataCentric Payloads and Formats for the Transport
Network. Computer Interconnect and SAN. Gigabit Ethernet (GbE) and 10 Gb/s
Ethernet (10GbE). Enhancing SONET for Data Transport. Generalized Framing
Procedure (GFP). Virtual Concatenation (VC). Link Capacity Adjustment Scheme
(LCAS). Optical Service Channels and Digital Wrapper. Optical Service Channel
(OSC). Digital Wrapper. IPCentric Control of Optical Networks. Basic Internet
Protocols. TCP. OSPF. MultiProtocol Label Switching (MPLS). Extensions for
IPCentric Control of Optical Networks. OSPFTE. Link Management Protocol (LMP).
MPlS and Generalized MPLS (GMPLS). ConstraintBased Routing Label Distribution
Protocol (CRLDP). Network Planning Issues. Does IPCentric Control Also Imply
an “Allrouter” Network? Concept of a “Transport Stabilized” Internet.
3. Failure Impacts, Survivability Principles,
and Measures of Survivability.
Transport Network Failures and Their Impacts.
Causes of Failure. Crawford's Study. Effects of Outage Duration. Is 50 ms
Restoration Necessary? Survivability Principles from the Ground Up. Physical
Layer Survivability Measures. Physical Protection Methods. Reducing Physical
Protection Costs with Restoration Schemes. Physical Layer Topology
Considerations. The Problem of Diversity Integrity. Survivability at the
Transmission System Layer. “Linear” Transmission Systems. Automatic Protection
Switching (APS). Reversion. “Extra Traffic” Feature. AIS Concept. Hitless
Switching. Unidirectional PathSwitched Rings (UPSR). Bidirectional
LineSwitched Rings (BLSR). Resilient Packet Rings (RPR). Ring Covers.
Generalized Loopback Networks. System Layer Protection Without 100% Redundancy:
pCycles. Logical Layer Survivability Schemes. Concepts of Protection,
Restoration and Distributed Preplanning. Span Restoration or Span Protection.
Metamesh. pCycles. Path Restoration. SharedBackup Path Protection (SBPP).
Segmented or ShortLeap Shared Protection (SLSP). GMPLS Automatic Reprovisioning
as a Restoration Mechanism. Service Layer Survivability Schemes. Comparative
Advantages of Different Layers for Survivability. Measures of Outage and
Survivability Performance. McDonald's ULE. The (U,D,E) Framework for Quantifying
Service Outages. Measures of Network Survivability. Restorability. Reliability.
Availability. Concept of “Unavailability”. Series Unavailability Relationships.
Parallel Unavailability Relationships. SeriesParallel Reductions. Network
Reliability. TwoTerminal Network Reliability. Factoring the Graph and
Conditional Decomposition. Expected Loss of Traffic and of Connectivity.
Expected Loss of Traffic (ELT). Annual Expected Downtime of Connection (AEDC).
4. Graph Theory, Routing, and Optimization.
Graph Theory Related to Transport Networking.
Set Concepts and Notation. Graph Theory as it Relates to Transport Networks.
Transport Network Terminology. Distinct and Disjoint Routes. Data
Representations of Graphs. Computational Complexity. Asymptotic Notation. P and
NP. Shortest Path Algorithms. Concepts of Labeling and Scanning. The Dijkstra
Algorithm. Bhandari's Modified Dijkstra Algorithms. BFS Dijkstra. Modified
Dijkstra. kShortest Path Algorithms. All Distinct Routes. Maximum Flow: Concept
and Algorithm. The MinCut MaxFlow Theorem. Maximum Flow Algorithm. The Trap
Topology. kShortest Paths as an Approximation to Maximum Flow. Shortest
Disjoint Path Pair. Finding Biconnected Components of a Graph. The CutTree.
Finding All Cycles of a Graph. Fundamental Set of Cycles. DepthFirst Search for
Cycle Enumeration. Optimization Methods for Network Design. Linear and Integer
Programming. The Role and Limitations for Mathematical Programming. General
Symbolic Form of an LP or ILP. Example Development of an Optimization Model.
Making the Problem an Integer Linear Program. Duality. Unimodularity and Special
Structures. Network Flow Problems. The Transportation Problem. TwoTerminal MCNF
(or Minimum Cost Routing). Maximum Flow as an MCNF. MultiCommodity Maximum Flow
(MCMF). Maximum Sum MultiCommodity Maximum Flow (MSMCMF). Maximum Concurrent
MCMF (MConMF). Techniques for Formulating LP/ILP Problems. Mutual Exclusion.
Switching. Peak Minimizing. Bicriteria Studies and Pareto Optimal Solutions.
Representing Routes and Graph Topology. Modularity of Capacity. Implicit
Representation of Functionality. Tips for Getting the Solutions. Lagrangean
Techniques. VectorMatrix Notation for an LP Problem. Lagrange Multipliers.
Extension to Inequalities. Lagrangean Relaxation and the Lagrangean Dual.
Complexity of LP and ILP. Other Combinatorial Optimization Methods:
MetaHeuristics. Simulated Annealing. Genetic Algorithms. Tabu Search.
Comparison of Optimization Techniques.
II. STUDIES.
5. SpanRestorable and SpanProtected Mesh
Networks.
Updating the View of Span Restoration.
Operational Concepts for Span Restoration. Details of the Span Restoration (SR)
Concept. Concept of Distributed SelfHealing Mesh Restoration and DRAs.
SelfOrganizing Nodal Interaction via Statelets. Distributed Protection
Preplanning with a DRA. The Working Capacity Envelope Concept for Dynamic
Demands. DemandAdaptive Definition of the Working Capacity Envelope. Concept of
FirstFailure Protection and SecondFailure Restoration. Spare Capacity Design
of SpanRestorable Mesh Networks. Overview of the Problem. Basic NodeArc
Formulation. Basic ArcPath Formulation. Herzberg and Bye's HopLimited
Formulation. LargeScale Practicality of HopLimited ArcPath SCA. Concept of a
Threshold Hop Limit. CutOriented Formulations of the SCA Problem. Venables'
Iterated Cutsets Method for SCA. Summary: A Complete CutOriented SCA
Methodology. Jointly Optimized Working and Spare Capacity Assignment. Joint
Capacity Allocation (JCA) Model. Isolated Nodal Bounding Considerations. Effect
of Capacity Balance on Redundancy. Understanding the JCA Benefit. Operational
Strategy for JCABased Incremental Capacity Planning. The Forcer Concept. Forcer
Analysis Procedure. Modular SpanRestorable Mesh Capacity Design. ModularAware
Spare Capacity Allocation (MSCA). Modular Joint Capacity Allocation (MJCA).
Comparative Results with the Modular Design Formulations. Modeling Modularity
with PerChannel Provisioning Costs. A Generic Policy for Generating Eligible
Route Sets. Generating Eligible Restoration Route Sets. Generating Eligible
Route Sets for Working Paths. Chain Optimized Mesh Design for Low Connectivity
Graphs. The MetaMesh Concept. Chain Subnetworks Under Ordinary SCA or JCA.
Logical Chain Bypass Spans. Restoration in the Bypassed Chains. Design Method to
Effect the MetaMesh Concept. Sample Results. SpanRestorable Capacity Design
with Multiple Service Classes. How MultiQoP Span Restoration Works. MultiQoP
Capacity Design. MultiQoP MJCA. Sample Results on MultiQoP Designs.
Approximation Models for MultiQoP Design. Maximum Revenue MultiQoP Design.
Incremental Capacity Planning for SpanRestorable Networks. What Value for
Rearrangeability? Bicriteria Design Methods for SpanRestorable Mesh Networks.
Bicriteria Design for Reducing Restoration Path Lengths. Bicriterion Design for
Maintenance Risk Reduction. Bicriterion Design for Best Efforts and Preemptible
Services.
6. Path Restoration and Shared Backup Path
Protection.
Understanding Path Protection, Path Restoration
and Path Segments. Is Path Restoration Just Span Restoration Without Loopbacks?
Concept of Mutual Capacity in Path Restoration. Experiments Simulating GMPLS
Auto Reprovisioning. Network Recovery From Node Loss. A Framework for Path
Restoration Routing and Capacity Design. Specifying Failure Scenarios.
Specifying Network Structure, Capacity and Eligible Routes. The Path Restoration
Rerouting Problem. Concepts of Stub Release and Stub Reuse in Path Restoration.
Lower Bounds on Redundancy. Master Formulation for Path Restoration Capacity
Design. Simplest Model for Path Restoration Capacity Design. Comparative Study
of Span and PathRestorable Designs. Demand Dispersion and Routing Effects.
Shared Backup Path Protection (SBPP). Infeasibility in Greedy Disjoint Path
Pairs. Discounting the Shared Backup Path: Asymmetric Path Pairs. Disjoint
Primary/Shared Backup Relationships: Venn Diagram. Optimal Design of
SharedBackup Path Protected Networks. Wavelength Assignment Under SBPP. SBPP
Design with Limits on the Sharing of Spare Capacity. Capacity Effects of Sharing
Limits in SBPP. ArcFlow Models for SBPP. Lagrangean Relaxation for
PathOriented Capacity Design Problems. Solution Method for the LR Problem for a
Given m Vector. Iterative Maximization of the LR Problem on m. Heuristics for
PathRestorable Network Design. Phase 1 Heuristics—Design Construction. Modeling
Existing Capacity. Minimum Incremental Cost Routing. IteratedDijkstra to Solve
MIC_NF. Alternate Phase 1 Algorithm. Putting Modularity Considerations in the
Iterative Heuristic. Concepts of Aggregating Prerouting and PseudoCost
Functions. Modular Minimum Incremental Cost Network Flow (mod_MIC_NF). Modular
Minimal Incremental Cost MultiCommodity Network Flow. Phase 2 ForcerOriented
Design Improvement Heuristic. A Tabu Search Heuristic for Design Tightening.
Simulated Allocation Type of Algorithm for Design Tightening. Efficiently
Updating the Spare Capacity Design. Classifying Spans by Forcer Status.
PathShift Strategies for Direct ForcerBased Improvements.
7. OversubscriptionBased Design of Shared
Backup Path Protection for MPLS or ATM.
Concept of Oversubscription. Historical
Background and Some Misconceptions. Overview of MPLS Shared Backup Path
Protection and ATM Backup VP Concepts. The Oversubscription Design Framework.
Defining the Oversubscription Factor Xj,i. KST Algorithm for Backup Path
Capacity Allocation. Oversubscription Effects with KSTAlg. Minimum Spare
Capacity with Limits on Oversubscription. Minimum Peak Oversubscription with
Given Spare Capacity. OS3: Minimum Total Capacity with Limited
Oversubscription. Related Bounds on Spare Capacity. Upper Bound Based on KST
Algorithm. Lower Bound Based on the LP Relaxation of OS1. Illustrative Results
and Discussion. The Design Tradeoff between Spare Capacity and Xtol. Statistics
of Individual Xj,i Values under OS1 Design. OS2 Minimization of
Oversubscription with Given Capacity. OS3 Benefit of Jointly Optimizing Primary
and Backup Paths. Determining the Maximum Tolerable Oversubscription. Simulation
Design for Equivalent Bandwidth. Illustrative Results. Other Comments on
Determining Xtol. Extension and Application to Multiple Classes of Service.
Adaptive LinkBased Implementation of Priority Schemes.
8. Dual Failures, Nodal Bypass and Common Duct
Effects on Design and Availability.
Are Dual Failures a Real Concern? Dual Failure
Restorability Analysis of SpanRestorable Networks. Canonical Dual Failure
Scenarios. Determining the Network Average Dual Failure Restorability, R2.
Computational Approach. Models for the Restoration Process. Experimental
Results. Relationship Between Dual Failure Restorability and Availability.
Axioms and Role of Availability Analysis of Networks. Average Case Availability
of Service Paths. Availability Calculation for a Specific Path. Implications for
an UltraHigh Availability Class of Service. Link to the 1FP2FR Concept. Dual
Failure Availability Analysis for SBPP Networks. Experimental Comparison of SBPP
and Span Restoration. Optimizing Spare Capacity Design for Dual Failures.
Minimum Capacity to Withstand All Dual Failures (DFMC). Dual Failure Maximum
Restorability (DFMR). Pure Redistribution of Spare Capacity to Enhance R2.
MultiService Restorability Capacity Placement Design (MRCP). Experimental
Results. Dual Failure Considerations Arising From Express Routes. Express Routes
and Nodal Bypass. Does a Nodal Bypass Require Increased Spare Capacity? When
Does Bypass Yield a Spare Capacity Reduction? Optimal Capacity Design with
Bypasses. Minimum Spare Capacity Given a Set of Express Routes. Allowing the
Model to Dimension the Express Routes. Maximum Port Elimination by Bypass at
Minimum Spare Capacity. Sample Results. Iterative Optimization of Express
Routes. Effects of Dual Failures Arising from Shared Risk Link Groups. Comparing
Span SRLG and Bypass DualFailure Situations. Capacity Design for a Known Set of
SRLGs. Effects of SRLGs on Spare Capacity. Randomly Occurring SRLGs.
Availability Benefit of Coincident SRLG Design Coverage. Predicting the Impact
of a Specific SRLG. Effects of Nodal Degree. Effects of Topological Location.
Effects of Working Capacity Disparity. Benefit of Removing the Most Troublesome
SRLGs. SRLG Effects on Other Protection Schemes.
9. Mesh Network Topology Design and Evolution.
Different Contexts and Benefits of Topology
Planning. Topology Design for Working Flow Only. Branch Exchange. Cut
Saturation. The MENTOR Algorithm. Yaged's Fixed Point Convergence Method. The
Fixed Charge and Routing (FCR) Problem. Interacting Effects in MeshSurvivable
Topology. Experimental Studies of Mesh Capacity versus Graph Connectivity. How
Economy of Scale Changes the Optimal Topology. The SingleSpan Addition Problem.
How “Partial Express” Flows Can Suggest New Spans. Frequency and Remoteness
Metrics for Prospective Span Additions. Overall Study Technique for SingleSpan
Additions. The Complete Mesh Topology, Routing, and Spare Capacity Problem.
Added Valid Knowledge Constraints. Relaxations. Complexity of MTRS. Sample
Results: Studies with MTRS. Effect of EdgetoCapacity Cost Ratio, W. Effect of
Demand Intensity and Demand Pattern. A ThreePart Heuristic for MTRS. Step W1:
Workingonly Fixed Charge Plus Routing. Step S2: Reserve Network Fixed Charge
and Sparing (RNFCS). Step J3: Restricted MTRS for Final Topology Selection.
Useful Bounds from Steps W1 and J3. Studies with the ThreePart Heuristic for
MTRS. Method. Results. Discussion. Insights from the ThreePart Heuristic.
Ezema's EdgeLimiting Criteria. Successive Inclusion Heuristic. Graph Sifting
and Graph Repair for Topology Search. Graph Generation. Graph Testing. Repair
Procedures. A Tabu Search Extension of the Graph Sifter Architecture. Range
Sweeping Topology Search. Sample Results with Sweep Search. Overall Strategy and
Applications for Topology Planning.
10. pCycles.
The Concept of pCycles. Why Straddling Spans
Are So Significant. Historical Origins: Preconfiguration and the “Clamshell”
Diagram. Other Important Properties of pCycles. Enhanced Rings. Cycle Covers
and “Protection Cycles” per Ellinas et al. Optimal Capacity Design of Networks
with pCycles. Concept of “Useful Paths” for pCycle Design. Maximum pCycle
Restorability with a Given Spare Capacity. Minimum Spare Capacity for 100%
pCycle Restorability. Adding a Span Capacity Constraint. Results with Basic
Capacity Formulations. Joint Optimization of Working Path Routing and pCycle
Placement. Application of pCycles to DWDM Networks. Wavelength Continuity—the
WP case. DarkFiber pCycles: Protection without any Wavelength Conversion.
pCycle Wavelength Path (WP) Design Problems. Summary and Discussion of pCycle
Design Models. Schupke et al — Case Study for DWDM pCycles. VWP Results.
Computation Times. Placing Wavelength Converters at the pCycle Access Points
Only. Results with Jointly Optimized (VWP) pCycles. Heuristic and Algorithmic
Approaches to pCycle Design. pCycle Efficiency Metrics. The “Perfect Score”
for a pCycle. A ScoreBased Design Assembly Algorithm. Preselection of
Candidate pCycles: a Heuristic for MIP Solutions. Results with Preselection to
Solve the Joint pCycle Design Problem. Zhang and Yang's Straddling Span
Algorithm. Add and Join Operations on Primary pCycles. Application of Add/Join
Operations to Design Improvement. General pCycle Merge Operation. Simulated
Allocation Approach for Joint Design Algorithms. Concept of a Straddling
Subnetwork and Domain Perimeter pCycles. Extra Straddling Relationships with
NonSimple pCycles. Hamiltonian pCycles and Homogeneous Networks. Concept of a
Homogeneous Network. The Role of Hamiltonian pCycles in Ordinary Capacitated
Designs. pCycle Design in Homogeneous Hamiltonian Networks. Lower Bounds for
pCycles on a Hamiltonian Network. SemiHomogeneous Networks Inspired by
pCycles. An ADMlike Nodal Device for pCycles. SelfOrganized pCycle
Formation. Virtual pCycles in the MPLS Layer for Link and Node Protection. IP
Link Restoration with MPLS pCycles. Network Design using MPLS pCycles for Link
Restoration. NodeEncircling pCycles for Protection Against Node Loss. Types of
NodeEncircling pCycles. Rerouting Mechanism with NodeEncircling pCycles.
Generating Node Encircling pCycles. On the Prospect of Using Only
NodeEncircling pCycles.
11. RingMesh Hybrids and RingtoMesh
Evolution.
Integrated ADM Functions on DCS/OXC: an Enabler
of Hybrids. Hybrids Based on the RingAccess MeshCore Principle. Core and
Access Network Partitioning. Access Ring Formation and Span Elimination.
MeshChain Hybrid Networks. Studies of RingMesh and MeshChain Hybrid Network
Designs. Design of the RingMesh Hybrids. Pure Mesh and MeshChain Designs. Pure
Ring Reference Designs. Results and Discussion. Optimal Design of RingMesh
Hybrids. Concept of a SingleLayer RingMesh Hybrid Transport Network. Cost
Modeling for RingMesh Hybrids. RingMesh Hybrid Design Model. Forcer Clipping
RingMesh Hybrids. The Forcer Clipping Hypothesis. Forcer Clipping Heuristics.
Methodology for Tests of the Forcer Clipping Heuristics. Results and Discussion.
Ring to Mesh Evolution via “Ring Mining”. Optimization Model for Pure Ring
Mining. Ring Network Designs for Tests of Ring Mining. Test Results for Pure
Ring Mining. Ring Mining with Minimum Cost Capacity Additions. Minimum Cost
Evolutionary Strategy with Conversion Costs. Implementation of Ring Mining
Strategies. Ring Mining to pCycles as the Target Architecture. Converting Rings
into Modular pCycles: Nodal View. Network Level View of Evolution from Rings to
pCycles.
Bibliography.
Index.