Mesh based survivable networks options and strategies for optical, MPLS, SONET, and ATM networking

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 ] This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks networks," Proceedings of NFOEC 2003, Orlando, FL, USA, September 2003 [Coan91] B.A Coan, et al., "Using distributed topology updates and preplanned configurations to achieve trunk network survivability," IEEE Transactions on Reliability, vol 40, no.4, 1991, pp 404-416 [Colb87] C.J Colbourn, The Combinatorics of Network Reliability, Oxford University Press, Oxford and New York, 1987 [CoMa02] IEEE Communications Magazine, Special Issue on Generic Framing Procedure and Data over SONET/SDH and OTN, vol 40, no.5, May 2002, pp.60-112 [Corte99] B Cortez, "Integrated Rings in New Digital Cross Connect Systems," Presentation at IEEE DCS Workshop, June 23, 1999 [CrMa98] F.R.B Cruz, J MacGregor Smith, G.R Mateus,"Solving to optimality the uncapacitated fixed-charge network flow problem", Computers and Operation Research, vol 25, issue 1,1998, pp 67-81 [CPL94] CPLEX Optimization, Inc., CPLEX 3.0 User Documentation, Suite 279, 930 Tahoe Blvd., Bldg 802, Inline Village, NV USA, 1994 [Craw93] D Crawford, "Fiber Optic Cable Dig-ups" Causes and Cures," in Network Reliability: A Report to the Nation - Compendium of Technical Papers, National Engineering Consortium, Chicago, June 1993 [CRLDP] Jamoussi, et al., "Constraint-Based LSP Setup using LDP," RFC 3212, IETF, January 2002 [DaRe00] B Davie, Y Rekhter, MPLS Technology and Applications, Morgan Kaufmann Publishers, San Francisco, 2000 [Dem99] P Demeester et al., "Resilence in Multilayer Networks," IEEE Communications Magazine, Vol 37, No 8, 1999, pp 70-75 [Deo84] N Deo, C-Y Pang, "Shortest-Path Algorithms: Taxonomy and Annotation," Networks, vol.14, 1984, pp 275-323 [Dijk59] E.W Dijkstra, "A note on two problems in connection with graphs," Number Math., Vol 1, 1959, pp 269-271 [Dixi03] S S Dixit (editor),IP over WDM: Building the Next Generation Optical Internet, John Wiley and Sons, 2003 [DoHa98] B Doshi, P Harshavardhana,"Broadband network infrastructure of the future: roles of network design tools in technology deployment strategies," IEEE Communications Magazine, vol 36, no.5, May 1998, pp.61-71 [DoWi94] R.D Doverspike, B Wilson,"Comparison of capacity efficiency of DCS network restoration routing techniques", Journal of Networks and System Management, Vol 2, No 2, pp 95-123, 1994 [DoYa01] R Doverspike, J Yates, "Challenges for MPLS in Optical Network Restoration," IEEE Communications Magazine, Feb 2001, pp 89-96 [DoGr00] J Doucette, W D Grover, "Influence of Modularity and Economy of scale Effects on Design of Mesh-Restorable DWDM Networks," IEEE JSAC, vol.18, no.10, Oct 2000, pp 1912-1923 [DoGr01] J Doucette, W D Grover, "Comparison of Mesh Protection and Restoration Schemes and the Dependency on Graph Connectivity", Proc 3rd International Workshop on the Design of Reliable Communication Networks (DRCN 2001), Budapest, Hungary, October 2001 [DoGr01a] J Doucette, W D Grover, T Bach,"Bi-criteria studies of mesh network restoration path-length versus capacity trade-offs," Proc OSA Optical Fiber Communications Conference (OFC 2001), Anaheim, Calif., March 17-22 2001, pp TuG2-1 - TuG2-3 [DoGr02] J.E Doucette, W D Grover, "Maintenance-Immune Optical Mesh Network Design," Proc 18th National Fiber Optic Engineers Conference (NFOEC 2002), Dallas, Sept 15-19, 2002, pp 2049-2061 [DoGr02b] J.E Doucette, W D Grover, "Capacity Design Studies of Span-Restorable Mesh Networks with Shared-Risk Link Group (SRLG) Effects," in Proc OptiComm 2002, Boston, July 29-Aug 2, 2002, pp.25-38 [DoCl03] J Doucette, M Clouqueur, W.D Grover, "On the Service Availability and Respective Capacity Requirements of Shared Backup Path-Protected Mesh Networks," to appear in Optical Networks Magazine Special Issue on Engineering the Next Generation Optical Internet, vol 4, no 6, Nov/Dec 2003 [DPW99] R.D Doverspike, S Phillips, J.R Westbrook,"Future Transport Network Architectures," IEEE Communications Magazine, Vol 37, No 8, 1999, pp 96-101 [Dubh96] D P Dubhashi, "What can't you with LP?," Basic Research in Computer Science (BRICS) Lecture Series, BRICS LS-96-5, This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks University of Aaarhus, Denmark, December, 1996 Internet: www.brics.dk [DuGr94] D.A Dunn, W.D Grover, M.H MacGregor,"A comparison of k-shortest paths and maximum flow methods for network facility restoration", IEEE JSAC, Jan 1994, vol 12, no 1, pp 88-99 [DWY99] P Demeester, T.-H Wu, N Yoshikai,"Survivable Communication Networks," IEEE Communications Magazine, August 1999, pp 40-42 [ElBo03] G Ellinas, E Bouillet, R Ramamurthy, J Labourdette, S Chaudhuri, K Bala,"Routing and restoration architectures in mesh optical networks," Optical Networks Magazine, vol.4, no.1, Jan/Feb 2003, pp 91-106 [ElBu00] S.N Elahmadi, P.A Bullockj, K Nagaraj, T Flanagan,"Telecommunications network having shared protect capacity architecture," United States Patent No 6,154,296, Nov 28, 2000 [ElHa00] G Ellinas, A G Hailemariam, T.E Stern,"Protection Cycles in Mesh WDM Networks," IEEE JSAC, Oct.2000, pp 1924-37 [Ezem03] Chioma Ezema, Topology Design of Mesh-Restorable Networks, M.Sc Thesis, University of Alberta, Spring 2003 [Falc90] W.E Falconer, "Service assurance in modern telecommunications networks," IEEE Communications Magazine, June 1990, pp 32-39 [Fee99] J.A Fee, "Method and system for optical restoration tributary switching in a fiber network," United States Patent No 5,884,017, March 16, 1999 [Fish81] M.L Fisher,"The Lagrangean relaxation method for solving integer programming problems," Management Science, 27(1):1–18, January 1981 [Flan90] T Flanagan, "Fiber Network Survivability," IEEE Communications Magazine, June 1990 [FoFu62] L.R Ford Jr., D.R Fulkerson, Flows in Networks, Princeton University Press (1962) [Fons98] P.F Fonseca, "Pan-European multi-wavelength transport networks: network design, architecture, survivability and SDH networking", Design of Reliable Comm Networks (DRCN'98), IMEC, U.Ghent, Brugge, Belgium, May 17-20, 1998, paper P3 [FoGa93] R Fourer, D Gay, B Kernighan, AMPL: A Modeling Language for Mathematical Programming, Boyd & Fraser, 1993, pp 2-10 [Fran97] A Frangioni, Dual-Ascent Methods and Multicommodity Flow Problems, Ph.D Thesis - TD 5/97, Dipartimento di Informatica, Università di Pisa-Genova-Udine, March 1997 [Free96] R L Freeman, Telecommunication System Engineering, 3rd Ed New York: Wiley, 1996, pp 444-447 [Free96b] R.L Freeman, Reference Manual for Telecommunications Engineering, Updated 2/e, John Wiley & Sons, 1996, p 2047 [Free02] R L Freeman, Fiber-Optic Systems for Telecommunications, Wiley-Interscience, 2002 [FrSo01] J Frodsham, A Solheim, "Next-generation Backbone Network Metrics," National Fiber Optic Engineers Conference (NFOEC) 2001 (see also www.innovance.com) [GaJo79] M.R Garey, D.S Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H Freeman, New York, 1979 [Galv93] R D Galvao, "The use of Lagrangean relaxation in the solution of uncapacitated facility location problems," Location Science, vol.1, no.1, 1993, pp.57-79 [GaTa92] R Garnier, J Taylor,Discrete Mathematics for New Technology, Adam Hilger Press, 1992, p 468 [Gavi91] B Gavish, Topological design of telecommunication networks - Local access design methods,Annals of Operations Research, 33: (1991) 17-71 [Gavi90] B Gavish "Backbone network design tools with economic tradeoffs", ORSA J Computing, 2: 236-252, 1990 [GeAn01] N Geary, A Antonopoulous, E Drakopoulos, J O'Reilly, J.Mitchell,"A Framework for Optical Network Planning under Traffic Uncertainty,"Design of Reliable Communication Networks (DRCN 2001), Budapest, Hungary, October 2001 [GeCr99] B Gendron, T.G Crainic, A Frangioni,"Multicommodity capacitated network design," in Telecommunications Network Planning, eds B Sanso, P Soriano, Kluwer Academic, 1999, pp 1-19 This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [GeK97] O Gerstel, S Kutten, Dynamic Wavelength Allocation in All-Optical Ring Networks,Proc of ICC '97, 1997, pp 432-436 [Gers00] O Gerstel, "Optical Layer Signaling: How Much is Really Needed?," IEEE Communications Magazine, Oct 2000, pp 154-160 [GhDe01] N Ghani, D Saha (editors)IEEE Network Magazine: Special Issue on IP-Optical Integration, July/August 2001 [GHS94] L.M Gardner, M Heydari, J Shah, I.H Sudborough, I.G Tollis, C Xia,"Techniques for Finding Ring Covers in Survivable Networks," Proc of IEEE Globecom '94, 1994, pp 1862-1866 [GlLa97] F Glover, M Laguna, Tabu Search, Kluwer Academic Press, 1997 [GlLa99] F Glover, M Laguna, Tabu search inThe Handbook of Applied Optimization, (P M Pardalos, M G.C Resende, editors), Oxford Academic Press, http://bus.colorado.edu/Faculty/Laguna/Papers/ts2.pdf, 1999 [GMP01] Berger, L., Ashwood-Smith, Peter, editors,"Generalized MPLS - Signaling Functional Description," Internet Draft, draft-ietf-mpls-generalized-signaling- 02.txt, (work in progress), March 2001 [Gora01] W Goralski, Optical Networking & WDM, Osborne/McGraw-Hill, Berkeley, 2001 [GrBi91] W.D Grover, T.D Bilodeau, B.D Venables,"Near Optimal Synthesis of a Mesh Restorable Network", Proceedings of IEEE GLOBECOM'91, Dec 1991, pp 2007-2012 [GrCl01] W.D Grover, M.Clouqueur, T Bach, "Quantifying and Managing the Influence of Maintenance Actions on the Survivability of Mesh-Restorable Networks," Proc 17th Annual National Fiber Optic Engineers Conference (NFOEC 2001), July 8-12, Baltimore, 2001, pp 1514-1525 [GrCl02] W.D.Grover, M.Clouqueur, "Span-Restorable Mesh Network Design to Support Multiple Quality of Protection (QoP) Service-Classes," 1st Int'l Conf Optical Commun.& Networks (ICOCN'02), Singapore, Nov.11-14, 2002, pp 321-323 [GrDo01] W.D Grover, J Doucette, "Topological design of survivable mesh-based transport networks," Annals of Operations Research: Topological Network Design in Telecommunication Systems, P Kubat, J MacGregor Smith (Editors), P.L Hammer (Editor-in-Chief), Kluwer Academic, v.106, September 2001, pp.79-125 [GrDo02] W D Grover, J Doucette, "Design of a Meta-Mesh of Chain Sub-Networks: Enhancing the Attractiveness of Mesh-Restorable WDM Networking on Low Connectivity Graphs," IEEE JSAC, vol 20, no 1, pp 47-61, January 2002 [GrDo02b] W D Grover, J E Doucette, "Advances in optical network design with p-cycles: Joint optimization and pre-selection of candidate p-cycles," Proceedings of the IEEE-LEOS Summer Topical Meeting on All Optical Networking, Mont Tremblant, Quebec, July 15-17, 2002 [GrIr99] W.D Grover, R.R Iraschko, Y Zheng,"Comparative Methods and Issues in Design of Mesh-Restorable STM and ATM Networks," in Telecommunication Network Planning, B.Sanso, P Soriano (editors), Kluwer Academic Publishers, 1999, pp 169-200 [GrLi99] W.D Grover, D.Y Li,"The Forcer Concept and Express Route Planning in Mesh Survivable Networks," Journal of Network and Systems Management, vol.7, No.2, Feb-Mar'99, pp 199-223 [GrMa94] W D Grover, M H MacGregor, "Potential for spare capacity preconnections to reduce crossconnection workloads in mesh-restorable networks," Electronics Letters, Vol 30, No 3, February 3, 1994, pp 194-195 [Grov89] W D Grover, Selfhealing Networks - A Distributed Algorithm for k-shortest link-disjoint paths in a multigraph with applications in realtime network restoration, Ph.D Dissertation, Univ of Alberta, Fall, 1989 [Grov92] W.D Grover, "Case Studies of Survivable Ring, Mesh and Mesh-Arc Hybrid Networks," in Proc IEEE Globecom '92, Vol 1, pp 633-638 [Grov97] W D Grover, "Self-organizing Broad-band Transport Networks," Proceedings of the IEEE: Special Issue on Communications in the 21st Century, vol 85, no.10, pp 1582-1611, October 1997 [GrRa97] W.D Grover, V Rawat, M MacGregor,"A Fast Heuristic Principle for Spare Capacity Placement in Mesh-Restorable SONET/SDH Transport Networks", Electronics Letters, vol.33, no.3, Jan 30, 1997, pp.195-196 [GrVe91] W D Grover, B D Venables, M H MacGregor, J H Sandham,"Development and performance verification of a distributed asynchronous protocol for real-time network restoration," IEEE J Select Areas Comm., vol 9, no 1, pp 112-125, January 1991 This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [GrKe91] G Grover, A Kershenbaum, P Kermani,"MENTOR: an algorithm for mesh network topological optimization and routing," IEEE Trans Comm, 39: 503-513, 1991 [GrMa00] W D Grover, R G Martens, "Optimized design of ring-mesh hybrid networks," in Proc IEEE / VDE Design of Reliable Communication Networks (DRCN 2000), Munich, Germany, April 2000, pp 291-297 [Grov87] W D Grover, "The selfhealing network: A fast distributed restoration technique for networks using digital cross-connect machines," Proc IEEE Globecom'87, Tokyo, 1987, pp 1090-1095 [Grov99] W D Grover, "High availability path design in ring-based optical networks," IEEE/ACM Trans on Networking, vol.7, no.4, pp 558-574, Aug 1999 [Grov99b] W D Grover, "Resource management for fault tolerant paths in SONET ring networks," Journal of Networks and Systems Management (Plenum Publishing), vol.7, no.4, pp 373-394, Dec 1999 [Grov94] W.D Grover, "Distributed Restoration of the Transport Network," Chapter 11 in Network Management into the 21st Century, (T Plevyak, S Aidarous, editors), IEEE / IEE Press co-publication, 1994, pp 337-417 [GrSt98] W.D Grover, D Stamatelakis, "Cycle-oriented distributed pre-configuration: ring-like speed with mesh-like capacity for self-planning network restoration," Proc IEEE International Conf Commun (ICC '98), Atlanta, June 8-11 pp 537-543 [GrSt98b] W D Grover, D Stamatelakis, "Self-organizing closed-path configuration of spare capacity in broadband mesh transport networks," Proc Canadian Conference on Broadband Research (CCBR'98), Ottawa, June 12-24, 1998, pp.145-156 [GrSt00] W D Grover, D Stamatelakis, "Bridging the ring-mesh dichotomy with p-cycles," Proc Design of Reliable Networks Conference (DRCN 2000), Munich, April 2000, pp 92-104 [Grub01] Claus G Gruber,"Deployment of p-Cycles in WDM Networks," Diploma Thesis, Institute of Communication Networks, Technical University of Munich, August 20, 2001 [GrZh98] W D Grover, Y Zheng, "VP-based ATM network design with controlled over-subscription of restoration capacity," Proc.1st Int'l Workshop on Design of Reliable Communication Networks (DRCN'98), Brugge, Belgium, May 17-20, 1998, paper O.33 [GSM95] W.D Grover, J.B Slevinsky, M.H MacGregor, "Optimized design of ring-based survivable networks," Canadian J Elect & Comp Eng., Vol 20, No 3, 1995 [GuAh91] R Guerin, H Ahmadi, M Naghshineh, "Equivalent Capacity and its Application to Bandwidth Allocation in High-Speed Networks", IEEE JSAC, November, 1991, pp 968-81 [GuPr03] K.P Gummadi, M.J Pradeep, M.J C.S.R Murthy,"An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks," IEEE/ACM Transactions on Networking, Vol 11 no 1, Feb 2003, pp 81 -94 [HaKr95] D.D.Harms, M Kraetl, C.J Colbourn, J.S Devitt, Network Reliability: Experiments with a Symbolic Algebra Environment, CRC Press, 1995 [HeBy94] M Herzberg, S Bye, "An optimal spare-capacity assignment model for survivable networks with hop limits," Proc IEEE GLOBECOM '94, pp 1601-1607, 1994 [HeBy95] M Herzberg, S Bye, A Utano,"The hop-limit approach for spare-capacity assignment in survivable networks," IEEE/ACM Trans Networking, vol.3, Dec 1995, pp 775-784 [Heit93] J Heitkoetter, The Hitch-Hiker's Guide to Evolutionary Computation (1993), FAQ document in Intenet newsgroup: comp.ai.genetic [HoKr56] A.J Hoffman, J B Kruskal, Integral boundary points of convex polyhedra, in:Linear Inequalities and Related Systems (H W Kuhn, A W Tucker, eds.), Princeton University Press, Princeton, New Jersey, 1956, pp.223-246 [Holl75] J.H Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI 1975 [HoMo02] P Ho, H T Mouftah,"A novel distributed control protocol in dynamic wavelength-routed optical networks,"IEEE Communications Magazine, vol 40, no.11, Nov 2002, pp.38-45 [HoMo02b] P Ho, H T Mouftah,"A framework for service guaranteed shared protection in WDM mesh networks," IEEE Communications Magazine, vol 40, no.2, Feb 2002, pp.97-103 This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [Hu69] T.C Hu, Integer Programming and Network Flows, Addison-Wesley, Reading, Mass., 1969, pp 131-142 [HuCo02] H Huang, J.A Copeland, "A series of Hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience," IEEE Communications Magazine, vol 40, no.11, Nov 2000, pp.47-51 [Huit95] C Huitema, Routing in the Internet, Prentice-Hall PTR, 1995 [IEEE95] IEEE Communications Magazine, Special Issue on "Dynamic Routing in Telecommunications Networks," vol.33, no.7, July 1995 [Ingb03] L Ingber, Adaptive Simulated Annealing (web pages and software), Internet:http://ideas.repec.org/p/lei/ingber/96as.html, May 2003 [Iras96] R R Iraschko, Path-Restorable Networks, Ph.D Dissertation, University of Alberta, Fall, 1996 [IrGr00] R.R Iraschko, W.D Grover, "A highly efficient path-restoration protocol for management of optical network transport integrity," IEEE JSAC, vol.18, no.5, May 2000, pp 779- 793 [IrMa96] R R Iraschko, M H MacGregor, W D Grover,"Optimal Capacity Placement for Path Restoration in Mesh Survivable Networks", Proc IEEE ICC`96, pp 568 - 574, 1996 [IrMa98] R R Iraschko, M H MacGregor, W D Grover,"Optimal Capacity Placement for Path Restoration in STM or ATM Mesh-Survivable Networks," IEEE/ACM Transactions on Networking, Vol 6, No 3, pp 325-336, June 1998 [ITU96] ITU-T, Network Node interfaces for the Synchronous Digital Hierarchy (SDH), ITU-T Recommendation G.707, 1993, 1996 [Isel00] A Iselt, "Terminal pair availability calculation algorithms for communication networks," Proc Design of Reliable Comm Networks, DRCN 2000, April 2000, Munich, Germany, pp 233-247 [John75] D.B Johnson, "Finding All the Elementary Circuits of a Directed Graph," SIAM J on Computing, Vol 4, 1975, pp 77-84 [JoSa98] Y.T Joens, B Sales, H De Neve, P Van Mieghem,"Fault tolerance in a hierarchically structured dynamic routing environment," Proc Design of Reliable Commun Networks (DRCN'98), IMEC, U.Ghent, Brugge, Belgium, May 1998, paper O17 [KaO99] R Kawamura, H Ohta,"Archtectures for ATM network survivability and their field deployment," IEEE Communications Magazine, Vol 37, No 8, 1999, pp 88-94 [KaSa94] R Kawamura, K Sato, I Tokizawa,"Self-healing ATM Networks Based on Virtual Path Concept", IEEE Journal on Selected Areas in Communications Vol 12, No 1, January 1994, pp 120-127 [KaTo95] R Kawamura, Ikuo Tokizawa,"Self-healing virtual path architechture in ATM networks," IEEE Communications Magazine, 1995 [Kar86] R.M Karp, "Combinatorics, Complexity, and Randomness," Communications of the ACM, Vol 29, No 2, February 1986, pp 98-117 [Kart00] S.V Kartalopoulos, Introduction to DWDM Technology: Data in a Rainbow, SPIE and IEEE Press Publishers, 2000 [KeOl03] J Kennington, E Olinick, K Lewis, A Ortynski, G Spiride,"Robust Solutions for the DWDM Routing and Provisioning Problem: Models and Algorithms," Optical Networks Magazine, vol 4, no 2, March/April 2003 [KeLe98] J L Kennington, M.W Lewis, The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis, Technical Report 98-CSE-13, Dept Computer Science And Engineering, Southern Methodist University, Dallas, December 1998 [KeNa97] J.L Kennington, V.S.S Nair, M.H Rahman, Optimization Based Algorithms for Finding Minimal Cost Ring Covers in Survivable Networks," Technical Report 97-CSE -12, Southern Methodist University, Dallas, Texas, August 1997, pp 1-26 [Kers93] A Kershenbaum, Telecommunications Network Design Algorithms, McGraw-Hill, New York, NY, (1993) [KiKo01] S Kini, M Kodialam, T V Laksham, S Sengupta, C Villamizar,"Shared backup Label Switched Path restoration," IETF Internet Draft, draft-kini-restoration-shared-backup-01.txt, May 2001 [KiGe83] S Kirkpatrick, C.D Gelatt Jr, M.P Vecchi,"Optimization by simulated annealing," Science, vol 220, No 4598, May 13 1983, pp 671-680 This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [KKG91] A Kershenbaum, P Kermani, G Grover,"MENTOR: An Algorithm for Mesh Network Topological Optimization and Routing," IEEE Trans on Comm., No 4, 1991, pp 503 - 513 [Know89] T.W Knowles, Management Science: Building and Using Models, Irwin, 1989 [KoCh90] Komine, H., Chujo, T., Ogura, T., Miyazaki, K., Soejima, T.,"A distributed restoration algorithm for multiple-link and node failures of transport networks," Proc IEEE Globecom '90, Dec 1990, pp 459 - 463 [KoGr03] A Kodian, W.D Grover, J Slevinsky, D Moore,"Ring-Mining to p-Cycles as a Target Architecture: Riding Demand Growth into Network Efficiency," to appear in Proc National Fiber Optic Engineers Conference (NFOEC 2003), Orlando, Florida, Sept 7-11, 2003 [KoRe00] Kompella, K., Rekhter, Y., Banerjee, A., et al,"OSPF Extensions in Support of Generalized MPLS," Internet Draft, draft-kompella-ospf-extensions-00.txt, (work in progress), July 2000 [KoCh90] H Komine, T Chujo, T Ogura, K Miyazaki, T Soejima,"A distributed restoration algorithm for multiple-link and node failures of transport networks," Proc IEEE GLOBECOM'90, 1990, pp 459-463 [KrPr00] G.P Krishna, M.J Pradeep, C.S.R Murthy,"A segmented backup scheme for dependable real-time communication in multihop networks." 8th Int'l Workshop on Parallel and Distributed Real-Time Systems (WPRDRTS), Springer-Verlag vol 1800, May 2000, pp 768-684 [Kuhn97] D.R Kuhn, "Sources of failure in the public switched telephone network," IEEE Computer Magazine, vol.30, no.4, pp 31-36 [LaAg98] A Lardies, A Aguilar,"Planning Methodology for SDH + Optical Networks", Proc Design of Reliable Commun Networks (DRCN'98), IMEC, U.Ghent, Brugge, Belgium, May 1998 [LaMi01] Lang, J., Mitra, K., Drake, J., Kompella, K., Rekhter, Y., Berger, L., Saha, D., Basak, D., Sandick, H., Zinin, A., "Link Management Protocol (LMP)", Internet Draft, draft-ietf-ccamp-lmp-02.txt, (work in progress), July 2001 [LaTa01] P Laborczi, J Tapolcai, P-H Ho, T Cinkler, A Recski, H.T Mouftah, "Algorithms for Asymmetrically Weighted Pair of Disjoint Paths in Survivable Networks," Proc Design of Reliable Communication Networks (DRCN 2001), Budapest, Hungary, October 2001 pp 220-227 [Level3] Level3 Communications, Network Maps, www.level3.com/userimages/dotcom/en_US/images/dotcom_us.gif, May 2003 [LiTi01] Y Liu, D Tipper, P Siripongwutikorn,"Approximating optimal spare capacity allocation by successive survivable routing," Proceeding of IEEE INFOCOM, pages 699–708, Anchorage, AL, April 24–28 2001 [LiTi01b] Y Liu, D Tipper, "Spare Capacity Allocation for Non-Linear Cost and Failure-Dependent Path Restoration," Proceedings Design of Reliable Communication Networks (DRCN 2001), Budapest, Hungary, October 2001, pp243-250 [Lee99] C.Y Lee, Heuristic Methods for Sub-Graph Topology Enhancement in Ring-Based Transport Network Design, M.Sc Dissertation, University of Alberta, Canada, Fall 1999 [LeGr99] C.Y Lee, W.D Grover, G.D Morley,"Heuristic Methods for the 'Span Elimination' Problem in Ring-Based Transport Network Design," Proc IEEE Canadian Conf on Elec and Comp Eng '99, Edmonton, May 1999, pp 232-237 [LeGr02] D Leung, W D Grover, "Comparative ability of span-restorable and path-protected network designs to withstand uncertainty in the demand forecast," Proc 18th National Fiber Optic Engineers Conference (NFOEC 2002), Dallas, Sept 15-19, 2002., pp.1450-1461 [LeSo98] H Lee, H-G Song, "Integrated VP/VC rerouting model for multi-layer restoration in ATM networks," Proc Design of Reliable Commun Networks (DRCN'98), IMEC, U.Ghent, Brugge, Belgium, May 1998, paper O36 [Lin98] L Y Lin, E L Goldstein, R W Tkach,"Free-space micromachined optical switches with sub-millisecond switching time for large-scale optical cross-connects," IEEE Photonics Technology Letters, April 1998, pp 525-528 [Liu01] Yu Liu, Spare Capacity Allocation Model, Analysis and Algorithm, Ph.D Dissertation, School of Information Sciences, University of Pittsburgh, 2001 [LiYa02] G Li, J Yates, D Wang, C Kalmanek,"Control Plane Design for Reliable Optical Networks," IEEE Communications Magazine, vol 40, no 2, Feb 2002, pp.90-96 [LuMe00] S Lumetta, M Médard, Y.-C Tseng,"Capacity versus robustness: a trade-off for link restoration in mesh networks," Journal of This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks Lightwave Technology, vol 18, no 12, Dec 2000, pp.1765-1775 [MacG91] M MacGregor, The Self Traffic-Engineering Network, Ph.D Thesis, University of Alberta, 1991 [MaCo03] S DeMaesschalek, D Colle, I Lievens, M Pickavet, P Demeester, C Mauz, M Jaeger, R Inkret, B Mikac, J Derkacz, "Pan-European Optical Transport Networks: An Availability-based Comparison," Photonic Network Communications, vol.3, no.5, May 2003, pp 203-225 [MaDe76] P Matei, N Deo, "On algorithms for enumerating all circuits of a graph," SIAM J Comput., vol 5, no 1, Mar 1976, pp 90-99 [MaGr94] M.H MacGregor, W.D Grover, "Optimized k-shortest paths algorithm for facility restoration,"Software - Practise & Experience, Vol 24(9), Wiley & Sons, Sept 1994, pp.823-834 [MaGr95] M.H MacGregor, W.D Grover, "Investigation of a cut-tree approach to network restoration from node loss," Proceedings IEEE ICC '95, June 18-22, Seattle, 1995, vol.3, pp.1530-1535 [MaGr97]M H MacGregor, W D Grover, K Ryhorchuk,"Optimal Spare Capacity Preconfiguration for Faster Restoration of Mesh Networks," Journ of Network and Systems Management, Vol 5, No 2, 1997, pp 159-171 [MaGr97b] M.H MacGregor, W.D Grover, "Distributed Partial-Express Routing of Broadband Transport Network Demands," IEEE / ACM Transactions on Networking, vol.5, no.6, Dec 1997, pp 981-988 [MaSh00] Makam, V., Sharma, V., Huang, C., Owens, K., Mack-Crane, B., et al,"A Framework for MPLS-based Recovery", Work in Progress, Internet Draft , September 2000 [McBo98] A McGuire, P Bonenfant,"Standards: The Blueprint for Optical Networking," IEEE Communications Magazine, Vol 32, No 2, 1998, pp 68-78 [McDo94] J.C McDonald, "Public Network Integrity - Avoiding a crisis in trust", IEEE Journal on Selected Areas in Communications, vol.12, no.1, January 1994, pp 5-12 [MeBa02] M Medard, R.A Barry, S.G Finn, W He, S.S.Lumetta,"Generalized loop-back recovery in optical mesh networks," IEEE Trans Networking, vol.10, no 1, Feb.2002, pp 153-164 [Mino81] M Minoux, "Optimum synthesis of a network with non-simultaneous multicommodity flow requirements," Annals of Discrete Mathematics, vol 11, pp 269-277 [MiSa98] Y Miyao, H Saito,"Optimal Design and Evaluation of Survivable WDM Transport Networks", IEEE Journal on Selected Areas in Communications, Vol 16, No 7, pp 1190-1198, September 1998 [MoGr01] D Morley, W.D Grover, "Tabu Search Optimization of Optical Ring Transport Networks," Proceedings IEEE Globecom 2001, San Antonio, Texas, USA, Nov 25-29, 2001, pages [MoGr99] D Morley, W.D Grover, "Mathematical Programming Approaches to Optical Ring Network Design," Proc 3rd Can Conf On Broadband Research (CCBR'99) Nov 7, 9, Ottawa, 1999 [MoLi01] E Modiano, P.J.Lin, "Traffic Grooming in WDM Networks," IEEE Communications Magazine, July 2001, pp 124-129 [Moy98] J.T Moy, OSPF: Anatomy of an Internet Protocol, Addison-Wesley, 1998 [Morl01] D Morley, Analysis and Design of Ring-based Transport Networks, Ph.D Dissertation, University of Alberta, Canada, Spring 2001 [MoSh89] C.L Monma, D.F Shallcross, "Methods for Designing Communication Networks with Certain Two-Connected Survivability Constraints," Operations Research, vol 37, No 4, July - August 1989, pg 531 - 541 [Mukh00] B Mukherjee, "WDM optical communication networks: progress and challenges," IEEE Journal Selected Areas in Communications, vol.18, no.10, Oct 2000, pp 1810-1824 [OCon91] P O'Connor, Practical Reliability Engineering, 3rd Edition, John Wiley & Sons, 1991 [OePu98] M Oellrich, J von Puttkamer, "Reliable links in transmission networks," Proc Design of Reliable Commun Networks (DRCN'98), IMEC, U.Ghent, Brugge, Belgium, May 1998, paper O22 [OkNo00] E Oki, N Matsuura, K Shiomoto, N Yamanaka,"A disjoint path selection scheme with shared risk link groups in GMPLS This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks networks," IEEE Communications Letters, Volume 6, Issue 9, Sept 2002, pp 406-408 [Onvu94] R.O Onvural, Asynchronous Transfer Mode Networks Performance Issues, Artech House, 1994 [OPN02] OPNET, "Flow Analysis Module," http://www.opnet.com/products/modules/flow_analysis.html, 27 September 2002 [PeEl96] H.G Perros, K.M.Elsayed, "Call Admission Control Schemes: A Review", IEEE Communication Magazine, November, 1996, pp 82-91 [Perl92] R Perlman, Interconnections Bridges and Routers, Addison-Wesley Professional Computing series, 1992 [Petr85] H Petrosky, To Engineer is Human, St Martins Press, New York, 1985 [PiDe00] M Pickavet, P Demeester,"A Zoom-In approach to design SDH mesh-restorable networks," Journal of Heuristics Special Edition on Heuristic Approaches for Telecommunications Network Management, Planning and Expansion, vol.6, no.1, April 2000, pp 103- 126 [PiGa97] M Pióro, P Gajowniczek,"Solving Multicommodity Integral Flow Problems by Simulated Allocation," Telecommunication Systems, Baltzer Science Publishers, Vol.7, Nos.1-3, pp.17-28,1997 [Pioro97] Michal Pióro, "Robust design problems in telecommunication networks," Proceedings Fifteenth International Teletraffic Conference (ITC 15), Washington DC, June 1997 [RaAg90] S Rai, D Agrawal,Distributed Computing Network Reliability, IEEE Computer Society Press, 1990 [RaDa99] B Ramamurthy, D Datta, H Feng, J P Heritage, B Mukherjee, "Transparent vs opaque vs translucent wavelength-routed optical networks," Proceedings of OFC'99, vol 1, pp 59-61 [RaLa03] R Ramamurthy, J-F Labourdette, A Akyamac, S Chaudhuri,"Limiting sharing on protection channels in mesh optical networks," Proc OSA Optical Fiber Communications Conference (OFC 2003), Atlanta, March 2003, vol.1, paper TuI3, pp.204-205 [Rama01] B Ramamurthy, Design of Optical WDM Networks: LAN, MAN and WAN Architectures, Kluwer Academic, 2001 [RaSa97] R Ramaswami, G H Sasaki."Multi-wavelength optical networks with limited wavelength conversion," in Proc of IEEE Infocom '97, 1997, Vol 2, pp 489-498 [RaSi95] R Ramaswami, K.N Sivarajan,"Routing and Wavelength Assignment in All-Optical Networks," IEEE/ACM Trans on Networking, Vol 3, 1995, pp 489-500 [RaSi98] R Ramaswami, K.N Sivarajan,Optical Networks: A Practical Perspective, Academic Press, 1998 [Rawl91] G J E Rawlins (editor),Introduction to Foundations of Genetic Algorithms, San Mateo, CA, Morgan Kaufmann Publishers, 1991, pp 1-10 [RiHa01] C C Ribeiro, P Hansen (Editors),Essays and Surveys in Metaheuristics, Kluwer Academic Publishers; 1st edition, October 2001 [Robe99] T.G Robertazzi,Planning Telecommunication Networks, IEEE Press, 1999, pp 66-72 [SaAl98] J.M Santos, T Almeida, P Fonseca,"The use of distributed restoration on WDM networks," Proc Design of Reliable Commun Networks (DRCN'98), IMEC, U.Ghent, Brugge, Belgium, May 1998, paper O10 [SaGr03] A Sack, W D Grover, "Hamiltonian p-Cycles for Fiber-Level Protection in Homogeneous and Semi-Homogeneous Optical Networks," to appear in IEEE Network, Special Issue on Protection, Restoration, and Disaster Recovery, (scheduled for Nov/Dec 2003) [SaOk92] H Sakauchi, Y Okanoue, S Hasegawa,"Spare-channel design schemes for self-healing networks," IEICE Trans Comm., vol E75-B, no.7, pp 624-633, July 1992 [SaNi90] H Sakauchi, Y Nishimura, S Hasegawa,"A self-healing network with an economical spare channel assignment," Proc IEEE GLOBECOM'90, 1990, pp 438-443 [SaMu02] C.V Saradhi, C.S.R Murthy, "Dynamic establishment of segmented protection paths in single and multi-fiver WDM mesh networks," Proc of Opticomm 2002, Boston, July 2002, SPIE vol 4874, pp 211-222 [Sato96] Ken-ichi Sato, Advances in Transport Network Technologies: Photonic networks, ATM, and SDH, Artech House, Norwood MA, 1996 This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [ScSc03] D.A Schupke, M.C Scheffel, W.D Grover, "Configuration of p-Cycles in WDM Networks with Partial Wavelength Conversion," to appear in Photonic Network Communications, (accepted June 2003) [Schal01] J Schallenburg, "Is 50 ms Restoration Necessary?" Presentation to the IEEE Bandwidth Management workshop IX, Montebello, Quebec, June 2001 [ScGr02] D.A Schupke, C Gruber, A Autenrieth,"Optimal Configuration of p-Cycles in WDM Networks," Proc of IEEE ICC, 2002 [SeRe92] M Sexton, A Reid, Transmission Networking: SONET and the Synchronous Digital Hierarchy, Artech House, Norwood MA, 1992 [SeYa01] P Sebos, J Yates, G Hjálmt sson, A Greenberg, "Auto-discovery of Shared Risk Link Groups," Optical Fiber Commun Conf., March 2001 [ShBo00] G Shen, S K Bose, T H Cheng, C Lu, T K Chai,"Efficient wavelength assignments for lightpaths in WDM optical networks with/without wavelength conversion," Photonic Network Communications, vol 2, no 4, pp 349-360, November 2000 [ShGr03] G Shen, W.D Grover, "Capacity Requirements for Node Failure Recovery with Dynamic Path Restoration," Proc OSA OFC 2003, Atlanta, March 28, 2003, vol.2, paper FQ3, pp.775-777 [ShGr03b] G Shen, W.D Grover, "Extending the p-Cycle Concept to Path-Segment Protection," Proc IEEE International Conference on Communications (ICC 2003), Anchorage, AK, USA, May 11-15, 2003, Session ON3 [ShGr03c] G Shen, W.D Grover, "Exploiting Forcer Structure to Serve Uncertain Demands and Minimize Redundancy of p-Cycle Networks," to appear in Proc OptiComm 2003, Dallas, Texas, October 13-17, 2003 [Shei91] D.R Shier, Network Reliability and Algebraic Structures, Claredon Press, Oxford, 1991 [Shei76] D.R Sheir, "Iterative methods for determining the k-shortest paths in a network," Networks, vol.6, 1976, pp 205-229 [Sill96] C.A Siller, M Shafi (editors),SONET/SDH: A Sourcebook of Synchronous Networking, IEEE Press, 1996, pp 211-217 [SiSu00] K.M Sivalingam, S Subramaniam (editors),Optical WDM Networks: Principles and Practice, Kluwer Academic, (2nd Printing) 2001 [Sosn94] Sosnosky, J., "Service applications for SONET DCS distributed restoration," IEEE Journal on Selected Areas in Communications, Vol 12, No 1, pp 59-68, January 1994 [SrSo02] M Sridharan, A.K Somani, "Design for upgradability in mesh-restorable optical networks," Optical Networks Magazine, vol 3, no 3, May/June 2002, pp 77-87 [StGr00b] D Stamatelakis, W.D Grover, "Theoretical Underpinnings for the Efficiency of Restorable Networks Using Preconfigured Cycles ("p-cycles")," IEEE Transactions on Communications, Vol 48, No 8, pp 1262-1265 [Stam97] D Stamatelakis, Theory and Algorithms for Pre-configuration of Spare Capacity in Mesh Restorable Networks, M Sc Thesis, University of Alberta, Spring 1997 [Stav01] A.A Stavdas (editor), New Trends in Optical Network Design and Modeling, Kluwer Academic, 2001 [StBa99] T.E Stern, K Bala, Multiwavelength Optical Networks: A Layered Approach, Addison-Wesley, 1999 [StCh01] J Strand, A Chiu, R Tkach, "Issues for routing in the optical layer," IEEE Communications Magazine, February 2001, pp 81-87 [Stev94] W R Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Addison-Wesley Professional Computing Series, 1994 [StDo00] J Strand, R Doverspike, G Li,"Importance Of Wavelength Conversion In An Optical Network," Optical Networks Magazine, May/June 2000, Vol (3), pp 33-44 [StGr98] D Stamatelakis, W.D Grover, "OPNET Simulation of Self-organizing Restorable SONET Mesh Transport Networks," Proc OPNETWORKS '98 (CD-ROM), Wash D.C., April 1998, paper 04 [StGr99] D Stamatelakis, W.D Grover, Network Restorability Design Using Pre-configured Trees, Cycles, and Mixtures of Pattern Types, TRLabs Technical Report TR-1999-05, Issue 1.0, October 30 2000 This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [StGr99b] D Stamatelakis, W.D Grover, "Rapid Restoration of Internet Protocol Networks using Pre-configured Protection Cycles," Proc 3rd Can Conf Broadband Research (CCBR'99), Nov 7-9, Ottawa, 1999, pp.33-44 [StGr00] D Stamatelakis, W D Grover, "IP Layer Restoration and Network Planning Based on Virtual Protection Cycles," IEEE JSAC Special Issue on Protocols and Architectures for Next Generation Optical WDM Networks, vol.18, no.10, October, 2000, pp 1938 - 1949 [SuAz96] S Subramaniam, M Azizoglu, A K Somani,"All-optical networks with sparse wavelength conversion," IEEE Transaction on Networking, vol 4, no 4, pp 544-557, August 1996 [SuAz98] S Subramaniam, M Azizoglu, A K Somani,"On the optimal placement of wavelength converters in wavelength routed networks," Proceedings of IEEE INFOCOM'98, pp 902-909 [Surb74] J.W Surballe, "Disjoint Paths in a Network," Networks, vol.4, 1974, pp 125-145 [SuTa84] J.W Surballe, R.E Tarjan,"A Quick Method for Finding Shortest Pairs of Disjoint Paths," Networks, vol.14, 1984, pp 325-336 [T1A193] T1A1.2 Working Group on Network Survivability Performance, Report No 24.A Technical Report on Network Survivability Performance, November 1993 [Taha87] H.A Taha,Operations Research: An Introduction, Fourth Ed., MacMillian Publishing, New York, 1987 [Telc00] GR-253-CORE, "Synchronous Optical Network (SONET) Transport Systems: Common Generic Criteria," Telcordia Technologies, Issue 3, September 2000 [ThSw92] K Thulasiraman, M.N.S Swamy,Graphs: Theory and Algorithms, John Wiley & Sons, 1992 [ToNe94] M To, P Neusy, "Unavailability analysis of long-haul networks," IEEE J on Sel Areas in Comm., vol 12, no 1, January 1994, pp100-109 [Topk88] D M Topkis, "A k-shortest path algorithm for adaptive routing in communications networks,"IEEE Trans Comm., vol 36, no.7, July 1988, pp 855-859 [Vau96] D Vaughan, The Challenger Launch Decision, University of Chicago Press, 1996 [VeGr93] B D Venables, W Grover, M H MacGregor,"Two strategies for spare capacity placement (SCP) in mesh restorable networks," Proc IEEE ICC'93, Geneva, May 1993, pp 267–271 [Vena92] B.D Venables, Algorithms for the Spare Capacity Design of Mesh Restorable Networks, M.Sc Thesis, University of Alberta, Edmonton (1992) [VePo02] Presentation by A J Vernon, J D Portier,"Protection of Optical Channels in All-Optical Networks," 18th Annual National Fiber Optic Engineers Conference (NFOEC 2002), pp 1695-1706, Dallas, TX, Sept 2002 [Wang98] Y Wang, Modeling and Solving Single and Multiple Facility Restoration Problems, Ph.D dissertation, Sloan School of Management, MIT, June 1998., pp.32-33 [WoCh99] E.W.M Wong, A.K.M Chan, T.-S.P Yum,"A Taxonomy of Rerouting in Circuit-Switched Networks," IEEE Communications Magazine, Vol 37, No 11, 1999, pp 116-122 [Wins94] W L Winston, Operations Research: Applications and Algorithms, 3rd ed (Duxbury, 1994) pp 809-815 [WiSh97] M.Willebeek-LeMair, P Shahabuddin,"Approximating dependability measures of computer networks: An FDDI case study," IEEE/ACM Transactions on Networking, vol.5, no.2., April 1997, pp 311-327 [Wols98] L.A Wolsey, Integer Programming, John Wiley & Sons, 1998 [Wyna01] C Wynants, Network Synthesis Problems (Combinatorial Optimization Series), Kluwer Academic Publishers 2001 [Wu92] T.-H Wu, Fiber Network Service Survivability, Artech House, 1992 [Wu99] T.-H Wu, "Emerging Technologies for Fiber Network Survivability," IEEE Communications Magazine, Vol 33, No 2, 1999, pp 70-75 [WuNo97] T.-H Wu, N Yoshika, ATM Transport and Network Integrity, Academic Press, 1997 This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [WuKo93] T.-H Wu, H Kobrinski, D Ghosal, T.V Lakshman,"A service restoration time study for distributed control SONET digital cross-connect system self-healing networks," Proc ICC'93, pp 893-899, IEEE, 1993 [XiMa99] Y Xiong; L.G Mason,"Restoration strategies and spare capacity requirements in self-healing ATM networks" IEEE/ACM Transactions on Networking, Volume: Issue: 1, Feb 1999, pp 98 -110 [Yage71] B Yaged, Minimum cost routing for static network models,Networks, vol.1, 1971, pp 139-172 [YaHa88] C Han Yang, S Hasegawa, "FITNESS: A failure immunization technology for network service survivability," Proc IEEE GLOBECOM'88, 1988, pp 1549-1544 [YaKa98] T Yahara, R Kawamura, S.Ohta, "Multi-reliability self-healing scheme that guarantees minimum cell rate," Design of Reliable Comm Networks (DRCN'98), IMEC, U.Ghent, Brugge, Belgium, May 17-20, 1998, paper O14 [YaLa96] J Yates, J Lacey, D Everitt, M Summerfield,"Limited-range wavelength translation in all-optical networks," Proceedings of IEEE INFOCOM'96, pp 954-961 [ZaJu00] H Zang, J.P Jue, B Mukherjee,"A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks," Optical Networks Magazine, vol.1, Jan 2000, pp 47-60 [ZeCa96] E W Zegura, K.L Calvert, S Bhattacharjee,"How to model an Internetwork," IEEE INFOCOM, 1996, vol 2, pg 594 - 602 [ZeCa97] E.W Zegura, K.L Calvert, M.J Donahoo,"A Quantitative Comparison of Graph-Based models for Internet Topology," IEEE/ACM Transactions on Networking, 1997, vol 5, no 6, pg 770 - 783 [ZhBi03] K Zhu, B Mukherjee,"A Review of Traffic Grooming in WDM Optical Networks: Architectures and Challenges," Optical Networks Magazine, vol 4, no 2, March/April 2003 [Zhen97] Y Zheng, Spare Capacity Design of ATM VP-based Restorable Networks, M.Sc Thesis, University of Alberta, Fall 1997 [ZhGr97] Y Zheng, W.D Grover, M MacGregor,"Broadband Network Design with Controlled Exploitation of Flow Convergence Overloads in ATM VP-based Restoration", Proceedings of the Canadian Conference on Broadband Research (CCBR '97), April 16-17, 1997, Ottawa, Canada [ZhGr97b] Y Zheng, W.D Grover, M.H MacGregor, "Dependence of Network Capacity Requirements on the allowable flow convergence overloads in ATM Backup VP Restoration," Electronics Letters, vol 33, no.5, Feb 27, 1997, pp 362-363 [ZhMu02] K Zhu, B Mukherjee,"Traffic grooming in an optical WDM mesh network,"IEEE JSAC, vol 20, no.1, Jan 2002, pp 122-133 [Zorp89] G Zorpette, "Keeping the phone lines open," IEEE Spectrum, June 1989, pp.32-36 [ Team LiB ] This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [ Team LiB ] [SYMBOL] [ Team LiB ] This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks [ Team LiB ] [SYMBOL] _Ref517594407 11427 RF 24 S Subramaniam, M Azizoglu, and A K Somani, All-opticalnetworkswithsparsewavelengthconversion 19227 Reference [7] Robert S Cahn, Wide Area Network Design - Concepts and Tools for Optimization, Morgan Kaufman P 20834 RF 13 W D Grover, J Doucette, DesignofaMeta-MeshofChainSub-Networks:EnhancingtheAttractivenessof 23308 RF 16 Ryutaro Kawamura and Ikuo Tokizawa Self-healing virtual path architechture in ATM net-works.IEE 26509 RF B Gavish, Topological design of telecommunication networks - Local access design methods, Annals 28317 Reference [13] B Gendron, T.G Crainic, A Frangioni, Multicommodity capacitated network design, in: Telecomm 56550 Reference [12] B Yaged, Minimum cost routing for static network models, Networks, vol.1, 1971, pp 139-172 57953 RF 37 D Morley, AnalysisandDesignofRing-basedTransportNetworks, Ph.D Dissertation, University of Alb 61036 RF 21 [28] D.A Dunn, W.D Grover, M.H MacGregor, Acomparisonofk-shortestpathsandmaxi-mumflowmethods 65174 Reference [37] R.K Ahuja, T.L Magnanti, J.B Orlin, Network Flows : Theory, Algorithms and Applications, Pre 65492 RF 19 B Ramamurthy, D Datta, H Feng, J P Heritage and B Mukherjee, Transparentvs.opaquevs.transl 73462 Reference [38] Y Wang, Modelling and solving single and multiple facility restoration problems, Ph.D dissert 78855 RF 35 J L Kennington, M.W Lewis, The Path Restoration Version of the Spare Capacity Allocation Prob 86434 This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks RF 34 Y Liu, D Tipper, and P Siripongwutikorn Approximating optimal spare capacity allocation by s 89761 Reference [17] Venables, B.D Algorithms for the Spare Capacity Design of Mesh Restorable Networks M.Sc Thes 90193 RF T.G Robertazzi, Planning Telecommunication Networks, IEEE Press, 1999, pp 66-72 92597 RF Makam, V., Sharma, V., Huang, C., Owens, K., Mack-Crane, B., et al, AFrameworkforMPLS-basedRecov 95415 RF 11 J Doucette, W D Grover, ComparisonofMeshProtectionandRestorationSchemesandtheDependencyon 96996 RF 28 Christelle Wynants, Network Synthesis Problems (Combinatorial Optimization Series), Kluwer Acade [ Team LiB ] This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it Thanks Brought to You by Like the book? Buy it! ... 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