This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [ Team LiB ] • Table of Contents • Index Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking By Wayne D Grover Publisher: Prentice Hall PTR Pub Date: August 26, 2003 ISBN: 0-13-494576-X Pages: 880 "Always on" information networks must automatically reroute around virtually any problem-but conventional, redundant ring architectures are too inefficient and inflexible The solution: mesh-based networks that will be just as survivable-and far more flexible and cost-effective Drawing heavily on the latest research, Wayne D Grover introduces radical new concepts essential for deploying mesh-based networks Grover offers "how-to" guidance on everything from logical design to operational strategy and evolution planning-including unprecedented insight into migration from ring topologies and the important new concept of p-cycles Mesh survivability: realities and common misunderstandings Basic span- and path-restoration concepts and techniques Logical design: modularity, non-linear cost structures, express-route optimization, and dual-failure considerations Operational aspects of real-time restoration and self-organizing pre-planning against failures The "transport-stabilized Internet": self-organizing reactions to failure and unforeseen demand patterns Leveraging controlled oversubscription of capacity upon restoration in IP networks "Forcers": a new way to analyze the capacity structure of mesh-restorable networks New techniques for evolving facility-route structures in mesh-restorable networks p-Cycles: combining the simplicity and switching speed of ring networks with the efficiency of mesh networks This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks Novel Working Capacity Envelope concept for simplified dynamic demand provisioning Dual-failure restorability and the availability of mesh networks This is the definitive guide to mesh-based networking for every system engineer, network planner, product manager, researcher and graduate student in optical networking [ Team LiB ] This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [ Team LiB ] • Table of Contents • Index Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking By Wayne D Grover Publisher: Prentice Hall PTR Pub Date: August 26, 2003 ISBN: 0-13-494576-X Pages: 880 Copyright About the Book's Web Site www.ee.ualberta.ca/~grover/ Foreword Preface Acknowledgements Introduction and Outline Historical Backdrop The Case for Mesh-based Survivable Networks Outline Part Preparations Chapter Orientation to Transport Networks and Technology Section 1.0.1 Aggregation of Service Layer Traffic into Transport Demands Section 1.0.2 Concept of Logical versus Physical Networks: Virtual Topology Section 1.0.3 Multiplexing and Switching Section 1.0.4 Concept of Transparency Section 1.0.5 Layering and Partitioning Section 1.1 Plesiochronous Digital Hierarchy (PDH) Section 1.2 SONET / SDH Section 1.3 Broadband ISDN and Asynchronous Transfer Mode (ATM) Section 1.4 Concept of Label-Switching: The Basis of ATM and MPLS Section 1.5 Network Planning Aspects of Transport Networks Section 1.6 Short and Long-Term Transport Network Planning Contexts Chapter Internet Protocol and Optical Networking This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks Section 2.1 Increasing Network Efficiency Section 2.2 DWDM and Optical Networking Section 2.3 Optical Cross-Connects (OXC) Section 2.4 Data-Centric Payloads and Formats for the Transport Network Section 2.5 Enhancing SONET for Data Transport Section 2.6 Optical Service Channels and Digital Wrapper Section 2.7 IP-Centric Control of Optical Networks Section 2.8 Basic Internet Protocols Section 2.9 Extensions for IP-Centric Control of Optical Networks Section 2.10 Network Planning Issues Chapter Failure Impacts, Survivability Principles, and Measures of Survivability Section 3.1 Transport Network Failures and Their Impacts Section 3.2 Survivability Principles from the Ground Up Section 3.3 Physical Layer Survivability Measures Section 3.4 Survivability at the Transmission System Layer Section 3.5 Logical Layer Survivability Schemes Section 3.6 Service Layer Survivability Schemes Section 3.7 Comparative Advantages of Different Layers for Survivability Section 3.8 Measures of Outage and Survivability Performance Section 3.9 Measures of Network Survivability Section 3.10 Restorability Section 3.11 Reliability Section 3.12 Availability Section 3.13 Network Reliability Section 3.14 Expected Loss of Traffic and of Connectivity Chapter Graph Theory, Routing, and Optimization Section 4.1 Graph Theory Related to Transport Networking Section 4.2 Computational Complexity Section 4.3 Shortest Path Algorithms Section 4.4 Bhandari's Modified Dijkstra Algorithms Section 4.5 k-Shortest Path Algorithms Section 4.6 Maximum Flow: Concept and Algorithm Section 4.7 Shortest Disjoint Path Pair Section 4.8 Finding Biconnected Components of a Graph Section 4.9 The Cut-Tree Section 4.10 Finding All Cycles of a Graph Section 4.11 Optimization Methods for Network Design Section 4.12 Linear and Integer Programming Section 4.13 Duality Section 4.14 Unimodularity and Special Structures Section 4.15 Network Flow Problems Section 4.16 Techniques for Formulating LP/ILP Problems Section 4.17 Lagrangean Techniques Section 4.18 Other Combinatorial Optimization Methods: Meta-Heuristics Part Studies Chapter Span-Restorable and Span-Protected Mesh Networks Section 5.1 Updating the View of Span Restoration Section 5.2 Operational Concepts for Span Restoration Section 5.3 Spare Capacity Design of Span-Restorable Mesh Networks Section 5.4 Jointly Optimized Working and Spare Capacity Assignment This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks Section 5.5 The Forcer Concept Section 5.6 Modular Span-Restorable Mesh Capacity Design Section 5.7 A Generic Policy for Generating Eligible Route Sets Section 5.8 Chain Optimized Mesh Design for Low Connectivity Graphs Section 5.9 Span-Restorable Capacity Design with Multiple Service Classes Section 5.10 Incremental Capacity Planning for Span-Restorable Networks Section 5.11 Bicriteria Design Methods for Span-Restorable Mesh Networks Chapter Path Restoration and Shared Backup Path Protection Section 6.1 Understanding Path Protection, Path Restoration and Path Segments Section 6.2 A Framework for Path Restoration Routing and Capacity Design Section 6.3 The Path Restoration Rerouting Problem Section 6.4 Concepts of Stub Release and Stub Reuse in Path Restoration Section 6.5 Lower Bounds on Redundancy Section 6.6 Master Formulation for Path Restoration Capacity Design Section 6.7 Simplest Model for Path Restoration Capacity Design Section 6.8 Comparative Study of Span and Path-Restorable Designs Section 6.9 Shared BackupPath Protection (SBPP) Section 6.10 Lagrangean Relaxation for Path-Oriented Capacity Design Problems Section 6.11 Heuristics for Path-Restorable Network Design Section 6.12 Phase Heuristics?Design Construction Section 6.13 Putting Modularity Considerations in the Iterative Heuristic Section 6.14 Phase Forcer-Oriented Design Improvement Heuristic Section 6.15 A Tabu Search Heuristic for Design Tightening Section 6.16 Simulated Allocation Type of Algorithm for Design Tightening Chapter Oversubscription-Based Design of Shared Backup Path Protection for MPLS or ATM Section 7.1 Concept of Oversubscription Section 7.2 Overview of MPLS Shared Backup Path Protection and ATM Backup VP Concepts Section 7.3 The Oversubscription Design Framework Section 7.4 Defining the Oversubscription Factor Xj,i Section 7.5 KST Algorithm for Backup Path Capacity Allocation Section 7.6 Oversubscription Effects with KST-Alg Section 7.7 Minimum Spare Capacity with Limits on Oversubscription Section 7.8 Minimum Peak Oversubscription with Given Spare Capacity Section 7.9 OS-3: Minimum Total Capacity with Limited Oversubscription Section 7.10 Related Bounds on Spare Capacity Section 7.11 Illustrative Results and Discussion Section 7.12 Determining the Maximum Tolerable Oversubscription Section 7.13 Extension and Application to Multiple Classes of Service Chapter Dual Failures, Nodal Bypass and Common Duct Effects on Design and Availability Section 8.1 Are Dual Failures a Real Concern? Section 8.2 Dual Failure Restorability Analysis of Span-Restorable Networks Section 8.3 Determining the Network Average Dual Failure Restorability,R2 Section 8.4 Relationship Between Dual Failure Restorability and Availability Section 8.5 Dual Failure Availability Analysis for SBPP Networks Section 8.6 Optimizing Spare Capacity Design for Dual Failures Section 8.7 Dual Failure Considerations Arising From Express Routes Section 8.8 Optimal Capacity Design with Bypasses Section 8.9 Effects of Dual Failures Arising from Shared Risk Link Groups Section 8.10 Capacity Design for a Known Set of SRLGs Section 8.11 Effects of SRLGs on Spare Capacity This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks Chapter Mesh Network Topology Design and Evolution Section 9.1 Different Contexts and Benefits of Topology Planning Section 9.2 Topology Design for Working Flow Only Section 9.3 Interacting Effects in Mesh-Survivable Topology Section 9.4 Experimental Studies of Mesh Capacity versus Graph Connectivity Section 9.5 How Economy of Scale Changes the Optimal Topology Section 9.6 The Single-Span Addition Problem Section 9.7 The Complete Mesh Topology, Routing, and Spare Capacity Problem Section 9.8 Sample Results: Studies with MTRS Section 9.9 A Three-Part Heuristic for MTRS Section 9.10 Studies with the Three-Part Heuristic for MTRS Section 9.11 Ezema's Edge-Limiting Criteria Section 9.12 Successive Inclusion Heuristic Section 9.13 Graph Sifting and Graph Repair for Topology Search Section 9.14 A Tabu Search Extension of the Graph Sifter Architecture Section 9.15 Range Sweeping Topology Search Section 9.16 Overall Strategy and Applications for Topology Planning Chapter 10 p-Cycles Section 10.1 The Concept of p-Cycles Section 10.2 Cycle Covers and "Protection Cycles" per Ellinas et al Section 10.3 Optimal Capacity Design of Networks withp-Cycles Section 10.4 Application of p-Cycles to DWDM Networks Section 10.5 Schupke et al ? Case Study for DWDM p-Cycles Section 10.6 Results with Jointly Optimized (VWP) p-Cycles Section 10.7 Heuristic and Algorithmic Approaches to p-Cycle Design Section 10.8 Concept of a Straddling Subnetwork and Domain Perimeterp-Cycles Section 10.9 Extra Straddling Relationships with Non-Simple p-Cycles Section 10.10 Hamiltonian p-Cycles and Homogeneous Networks Section 10.11 An ADM-like Nodal Device forp-Cycles Section 10.12 Self-Organized p-Cycle Formation Section 10.13 Virtual p-Cycles in the MPLS Layer for Link and Node Protection Section 10.14 Node-Encircling p-Cycles for Protection Against Node Loss Chapter 11 Ring-Mesh Hybrids and Ring-to-Mesh Evolution Section 11.1 Integrated ADM Functions on DCS/OXC: an Enabler of Hybrids Section 11.2 Hybrids Based on the Ring-Access Mesh-Core Principle Section 11.3 Mesh-Chain Hybrid Networks Section 11.4 Studies of Ring-Mesh and Mesh-Chain Hybrid Network Designs Section 11.5 Optimal Design of Ring-Mesh Hybrids Section 11.6 Forcer Clipping Ring-Mesh Hybrids Section 11.7 Ring to Mesh Evolution via "Ring Mining" Section 11.8 Ring Mining to p-Cycles as the Target Architecture Bibliography Index [ Team LiB ] This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [ Team LiB ] This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks Copyright Library of Congress Cataloging-in-Publication Data Wireless communications: signal processing perspectives / [edited by] H Vincent Poor, Gregory W Wornell p cm. (Prentice Hall signal processing series) Includes bibliographical references and index ISBN 0-13-620345-0 Wireless communication systems Signal processing I Poor, H Vincent II Wornell, Gregory W III Series TK5103.2.W5718 1998 98-9676 621.382 dc21 CIP Editorial/production supervision Mary Sudul Cover design director Jerry Votta Cover design Talar Boorujy and Nina Scuderi Manufacturing manager Alexis Heydt-Long Manufacturing buyer Maura Zaldivar Publisher Bernard Goodwin Editorial assistant Michelle Vincenti Marketing manager Dan DePasquale © 2004 by Prentice Hall PTR Pearson Education, Inc Upper Saddle River, New Jersey 07458 Prentice Hall books are widely used by corporations and government agencies for training, marketing, and resale The publisher offers discounts on this book when ordered in bulk quantities For more information, contact Corporate Sales Department, Phone: 800-382-3419; FAX: 201- 236-7141; E-mail: corpsales@prenhall.com Or write: Prentice Hall PTR, Corporate Sales Dept., One Lake Street, Upper Saddle River, NJ 07458 Other company and product names mentioned herein are the trademarks or registered trademarks of their respective owners All rights reserved No part of this book may be reproduced, in any form or by any means, without permission in writing from the publisher Printed in the United States of America 1st Printing Pearson Education LTD Pearson Education Australia PTY, Limited Pearson Education Singapore, Pte Ltd This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks Pearson Education North Asia Ltd Pearson Education Canada, Ltd Pearson Educación de Mexico, S.A de C.V Pearson Education—Japan Pearson Education Malaysia, Pte Ltd Dedication To my wife, Jutta—to my son, Edward (Teddy) and to TRLabs—still the noble experiment [ Team LiB ] This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [ Team LiB ] About the Book's Web Site www.ee.ualberta.ca/~grover/ A number of appendices and supplements are web-based, so that they may be kept current and easily updated or extended as desired This includes: Glossary AMPL models to implement design formulations DATPrep programs: These are programs that can be used as is or adapted to new problems for the creation of network specific DAT files that required for execution of the AMPL models A library of test-case network and demand files A library of programs for basic functions such as routing or cycle enumeration Frequently Asked Questions and discussion on survivable networking issues Errata for the book Technical Reports produced by the authors research group (as available) Recommended Links Selected Lecture Notes on Survivable Networks MeshBuilder: prototype versions of a mesh-based planning and analysis tool Student Problems and Research Projects The web site is http://www.ee.ualberta.ca/~grover/ Follow the link to "Mesh-Based Survivable Networks." Access to the book's web resources requires the user to have a copy of the book on hand In future, the URL will change to http://www.ece.ualberta.ca/~grover/ [ Team LiB ] ... it Thanks [ Team LiB ] • Table of Contents • Index Mesh- Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking By Wayne D Grover Publisher: Prentice Hall... Envelope concept for simplified dynamic demand provisioning Dual-failure restorability and the availability of mesh networks This is the definitive guide to mesh- based networking for every system... ring networks with the capacity-efficiency of mesh- based networks We include p-cycles as a mesh- based survivable architecture because they exhibit extremely low mesh- like capacity redundancy and