Bibliography
[1] Automatic Protection Switching for SONET. Technical Report SR-NWT-001756, Bell Communications Research, Red Bank, NJ, October 1990.
[2] Generic Reliability Assurance Requirements for Fiber Optic Transport Systems. Technical Report TR-NWT-000418, Bell Communications Research, Red Bank, NJ, 1990.
[3] Reliability and Quality Switching Systems Generic Requirements. Technical Report TA-NWT-000284, Bell Communications Research, Red Bank, NJ, 1991.
[4] Synchronous Optical Network (SONET) Transport Systems: Common Generic Criteria. Technical Report TR-NWT-000253, Bell Communications Research, Red Bank, NJ, December 1991.
[5] Reliability Assurance Practices for Optoelectronic Devices in Interoffice Applications. Technical Report TR-NWT-000468 Issue 1, Bell Communications Research, Red Bank, NJ, 1992.
[6] An Introduction to the Reliability and Quality Generic Requirements. Technical Report TRNWT-000874 Issue 4, Bell Communications Research, Red Bank, NJ, 1993.
[7] Generic Requirements for Assuring the Reliability of Components Used in Telecommunications Equipment. Technical Report TR-NWT-000357 Issue 2, Bell Communications Research, Red Bank, NJ, 1993.
[8] Transport Systems: Generic Requirements. Technical Report TR-NWT-000499, Bell Communications Research, Red Bank, NJ, December 1993.
[9] SONET Dual-Fed Unidirectional Path Switched Ring (UPSR) Equipment Generic Criteria. Technical Report GR-1400-CORE, Bell Communications Research, Red Bank, NJ, March 1994.
[10] SONET Bidirectional Line-Switched Ring Equipment Generic Criteria. Technical Report GR-1230-CORE, Bell Communications Research, Red Bank, NJ, December 1996.
[11] Planning for Service Survivability in Broadband Multilayer Networks. Technical Report SR-4317, Bell Communications Research, Red Bank, NJ, 1997.
[12] User Network Interface (UNI) v1.0 Signaling Specification. Technical Report OIF Implementation Agreement OIF-UNI-01.0, October 2001.
[13] G. P. Agrawal. Fiber-Optic Communication Systems. John Wiley & Sons, New York, 1997.
[14] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Prentice-Hall, Englewood Cliffs, NJ, 1993.
[15] M. Aigner. Graph Theory – A Development from the 4-color Problem. BCS Associates, Moscow, Idaho, 1986.
[16] A. A. Akyamac et al. Optical mesh networks modeling: Simulation and analysis of restoration performance. In Proceedings of the 18th Annual National Fiber Optic Engineers Conference (NFOEC), Dallas, TX, September 2002.
[17] A. Akyamac¸ et al. Reliability of single domain versus multi domain optical mesh networks. In Proceedings of the 18th Annual National Fiber Optic Engineers Conference (NFOEC), Dallas, TX, September 2002.
[18] A. Akyamac¸ et al. Ring speed restoration and optical core mesh networks. In Proceedings of the 7th European Conference on Networks and Optical Communications (NOC), Darmstadt, Germany, June 2002.
[19] W. T. Anderson. The MONET project final report. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 148–149, Baltimore, MD, February 2000.
[20] D. W. Anding. Service offerings utilizing digital cross-connect systems – A Bell South perspective. In Proc. IEEE Int. Conf. Commun. (ICC), pages 336–339, Philadelphia, PA, June 1998.
[21] N. Antoniades, I. Roudas, G. Ellinas, and J. Amin. Transport metropolitan optical networking: Evolving trends in the architecture design and computer modeling. IEEE/OSA J. Lightwave Technology, 22(11): 2653–2670, November 2004.
[22] N. Antoniades, M. Yadlowsky, and V. L. daSilva. Computer simulation of a metro WDM ring network. IEEE Photonics Technology Letters, 12(11): 1576–1578, 2000.
[23] A. Antonopoulos et al. Design methodology for ETSI SDH subnetworks employing SNCPrings. In Proc. IEEE Int. Conf. Commun. (ICC), pages 878–882, Montreal, Canada, June 1997.
[24] G. R. Ash. Dynamic Routing in Telecommunications Networks. McGraw-Hill, New York, 1997.
[25] G. R. Ash, Kenneth Chan, and J-F. Labourdette. Analysis and design of fully shared networks. In 14th International Teletraffic Congress, Antibes Juan-Les-Pins, France, June 1994.
[26] L. Berger et al. Generalized MPLS – Signaling Functional Description. Internet Engineering Task Force (IETF), Technical Report RFC 3471, January 2003.
[27] L. Berger et al. Generalized MPLS RSVP-TE Extensions. Internet Engineering Task Force (IETF), Technical Report RFC 3473, January 2003.
[28] J. Augusto, S. Monteiro, and M. Gerla. Topological reconfiguration of ATM networks. In Proc. IEEE Infocom., San Francisco, CA, June 1990.
[29] G. Austin et al. Fast, scalable, and distributed restoration in general mesh optical networks. Bell Labs Technical Journal, 6(1): 67–81, 2001.
[30] K. Bala et al. The case for opaque multiwavelength lightwave networks. In IEEE/LEOS Summer Topical Meeting, Keystone, Colorado, August 1995.
[31] I. Baldine and G. N. Rouskas. Dynamic reconfiguration policies for WDM networks. In Proc. IEEE Infocom., New York, NY, March 1999.
[32] D. Banerjee and B. Mukherjee. Wavelength-routed optical networks: Linear formulation, resource budgeting tradeoffs, and a reconfiguration study. In Proc. IEEE Infocom., Kobe, Japan, April 1997.
[33] R. Batchellor. Coordinating Protection in Multiple Layers.Technical Report oif99.038.0, Optical Inter-networking Forum (OIF), April 1999.
[34] R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(1): 87–90, 1958.
[35] V. Benes. Optimal rearrangeable multistage connecting networks. The Bell System Technical Journal, 43(7): 1641–1656, 1964.
[36] D. Benjamin, R. Trudel, S. Shew, and E. Kus. Optical services over an intelligent optical network. IEEE Communications Mag., pages 73–78, September 2001.
[37] J. C. Bermond, B. Jackson, and F. Jaeger. Shortest coverings of graphs with cycles. J. Combinatorial Theory, Ser. B 35: 297–308, 1983.
[38] G. Bernstein, B. Rajagopalan, and D. Saha. Optical Network Control: Architecture, Protocols and Standards. Addison-Wesley, Reading, Mass., 2004.
[39] G. Bernstein, J. Yates, and D. Saha. IP-centric control and management of optical transport networks. IEEE Communications Mag., pages 161–167, October 2000.
[40] R. Bhandari. Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic Publishers, 1999.
[41] M. Bhardwaj, L. McCaughan, S. K. Korotky, and I. Saniee. Global expectation values of shared restoration capacity for general mesh networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Los Angeles, CA, March 2004.
[42] M. Bhardwaj, L. McCaughan, S. K. Korotky, and I. Saniee. Analytical description of shared restoration capacity for mesh networks. J. Optical Network, 4(3): 130–141, 2005.
[43] M. Bhardwaj, L. McCaughan, A. Olkhovets, and S. K. Korotky. Simulation and modeling of the mean time to restore for optical mesh networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2005.
[44] R. Bhatia, M. Kodialam, and T.V. Lakshman. Fast network reoptimization schemes for MPLS and optical networks. Computer Networks, 50(3): 317–331, 2006.
[45] J. Bicknell, C. E. Chow, and S. Syed. Performance analysis of fast distributed network restoration algorithms. In Proc. IEEE Globecom., pages 1596–1600, Houston, TX, November 1993.
[46] S. Biswas, S. Chaudhuri, S. Datta, K. Hua, and S. Sengupta. StarNet Modeler: A hybrid modeling system for path restoration in optical networks. In OPNETWORK, Washington, DC, August 2001.
[47] M. Boduch et al. Transmission of 40 Gbps signals through metropolitan networks engineered for 10 Gbps signals. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2006.
[48] Z. R. Bogdanowicz. Analysis of optimal sets of survivable paths in undirected simple graph applicable for optical networks. Electronic Notes on Discrete Mathematics (ENDM), 22: 1–5, 2005.
[49] Z. R. Bogdanowicz and S. Datta. Analysis of backup route reoptimization algorithms for optical shared mesh networks. Math. Comput. Modelling, 40(11–12): 1047–1055, 2004.
[50] P. A. Bonenfant and C. M. C. Davenport. SONET Optical Layer Protection Switching. Technical Report TM-24609, Bell Communications Research, Red Bank, NJ, December 1994.
[51] E. Bouillet et al. Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures. In Proc. IEEE Infocom., New York, NY, June 2002.
[52] E. Bouillet and J-F. Labourdette. Distributed computation of shared backup path in mesh optical networks using probabilistic methods. IEEE/ACM Trans. Networking, 12(5): 920–930, 2004.
[53] E. Bouillet, J-F. Labourdette, and S. Biswas. Impact of multi-port card diversity constraints in mesh optical networks. In Proceedings of the Annual National Fiber Optic Engineers Conference (NFOEC), Anaheim, CA, March 2006.
[54] E. Bouillet, J-F. Labourdette, R. Ramamurthy, and S. Chaudhury. Lightpath reoptimization in mesh optical networks. IEEE/ACM Transactions on Networking, 13(2): 437–447, April 2005.
[55] E. Bouillet, J-F. Labourdette, R. Ramamurthy, and S. Chaudhuri. Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2002.
[56] E. Bouillet, J-F. Labourdette, G. Ellinas, R. Ramamurthy, and S. Chaudhuri. Local optimization of shared backup channels in optical mesh networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Atlanta, GA, March 2003.
[57] E. Bouillet, P. Mishra, J-F. Labourdette, K. Perlove, and S. French. Lightpath reoptimization in mesh optical networks. In Proceedings of the 7th European Conference on Networks and Optical Communications (NOC), Darmstadt, Germany, June 2002.
[58] C. A. Brackett. Dense wavelength division multiplexing networks: Principles and applications. IEEE J. Select. Areas Commun., 8(6): 948–964, August 1990.
[59] D. Brelaz. New methods to color the vertices of a graph. Communications of the ACM, 22(4): 251–256, April 1979.
[60] J. Carlier and D. Nace. A new distributed restoration algorithm for telecommunication networks. In Proceedings of the Sixth International Network Planning Symposium, Budapest, Hungary, September 1994.
[61] P. A. Catlin. Double cycle covers and the Petersen graph. J. Graph Theory, 13(4): 465–483, 1989.
[62] U. Celmins. On conjectures relating to snarks. PhD thesis, University of Waterloo, 1987.
[63] G. K. Chang, G. Ellinas, J. K. Gamelin, M. Z. Iqbal, and C. A. Brackett. Multiwavelength reconfigurable WDM/ATM/SONET network testbed. IEEE/OSA J. Lightwave Technology, 14(6): 1320–1340, 1996.
[64] C-W. Chao, P. M. Dollard, J. E. Weythman, L. T. Nguyen, and H. Eslambolchi. FASTAR – A robust system for fast DS3 restoration. In Proc. IEEE Globecom., pages 1396–1400, Phoenix, AZ, December 1991.
[65] P. Charalambous, G. Ellinas, C. Dennis, E. Bouillet, J-F. Labourdette, S. Chaudhuri, M. Morokhovich, and D. Shales. Dynegy’s national long-haul optical mesh network utilizing intelligent optical switches. In Proc. LEOS Annual Meeting, Glasgow, Scotland, November 2002.
[66] P. Charalambous et al. A national mesh network using optical cross-connect switches. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Atlanta, GA, March 2003.
[67] G. Chartrand and L. Lesniak-Foster. Graphs and Digraphs. Chapman and Hall, New York, 1996.
[68] S. Chaudhuri, E. Bouillet, and G. Ellinas. Addressing transparency in DWDM mesh survivable networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2001.
[69] D.Z. Chen et al. World’s first 40 Gbps overlay on a field-deployed, 10 Gbps, mixed-fiber, 1200 km, ultra long-haul system. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Los Angeles, CA, March 2005.
[70] D.Z. Chen et al. New field trial distance record of 3040 km on wide reach WDM with 10 and 40 Gbps transmission including OC-768 traffic without regeneration. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2006.
[71] A. Chiu and J. Strand. Joint IP/Optical layer restoration after a router failure. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2001.
[72] A. Chiu and J. Strand. An agile optical layer restoration method for router failures. IEEE Network Mag., pages 38–42, March/April 2003.
[73] C-H. Chow, S. Syed, J. Bicknell, and S. McCaughey. System and method for restoring a telecommunications network based on a two-prong approach, US Patent 5,495,471 February 1996.
[74] C-H. E. Chow, S. McCaughey, and S. Syed. RREACT: A Distributed Protocol for Rapid Restoration of Active Communication Trunks. Technical Report EAS-CS-92-18, UCCS, November 1992.
[75] E. Chow, S. McCaughey, and S. Syed. RREACT: A distributed network restoration protocol for rapid restoration of active communication trunks. In Proc. Second IEEE Network Management and Control Workshop, pages 391–406, Tarrytown, NY, September 1993.
[76] C. Clos. A study of non-blocking switching networks. The Bell System Technical Journal, 32(2): 406–424, 1953.
[77] M. Clouqueur and W. D. Grover. Availability analysis of span-restorable mesh networks. IEEE J. Select. Areas Commun., 20(4): 810–821, 2002.
[78] M. Clouqueur and W. D. Grover. Mesh-restorable networks with complete dual failure restorability and with selectively enhanced dual-failure restorability properties. In Proceedings of SPIE OptiComm, pages 1–12, Boston, MA, July 2002.
[79] M. Clouqueur and W. D. Grover. Quantitative comparison of end-to-end availability of service paths in ring and mesh-restorable networks. In Proceedings of the 19th National Fiber Optic Engineers Conference, NFOEC, pages 317–326, Orlando, FL, September 2003.
[80] M. Clouqueur and W.D. Grover. Availability analysis and enhanced availability design in p-cycle-based networks. Photonic Network Communications, 10: 55–71, July 2005.
[81] M. Clouqueur and W.D. Grover. Mesh-restorable networks with enhanced dual-failure restorability properties. Photonic Network Communications, 9: 7–18, January 2005.
[82] B. Coan, W. E. Leland, M. P. Vecchi, A. Weinrib, and L. T. Wu. Using distributed topology update and preplanned configurations to achieve trunk network survivability. IEEE Trans. Reliability, 40(4): 404–416, 1991.
[83] D. Colle et al. Data-centric optical networks and their survivability. IEEE J. Select. Areas Commun., 20(1): 6–20, 2002.
[84] R. Coltun. The OSPF Opaque LSA Option. Technical Report RFC 3472, Internet Engineering Task Force (IETF), July 1998.
[85] J. K. Conlisk. Topology and survivability of future transport networks. In Proc. IEEE Globecom., pages 826–834, Dallas, TX, November 1989.
[86] T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, New York, 1990.
[87] B. Cortez. The emerging intelligent optical network: Now a reality. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 224–225, Anaheim, CA, March 2002.
[88] S. Datta, S. Biswas, S. Sengupta, and D. Saha. Routing and grooming in two-tier survivable optical mesh networks. In Proc. International Workshop on Quality of Service (IWQoS), Monterey, CA, June 2003.
[89] S. Datta, S. Sengupta, S. Biswas, and S. Datta. Efficient channel reservation for backup paths in optical mesh networks. In Proc. IEEE Globecom., San Antonio, TX, November 2001.
[90] R. P. Davidson and N. J. Muller. The Guide to SONET: Planning, Installing and Maintaining Broadband Networks. Telecom Library, New York, 1983.
[91] P. Demeester et al. Resilience in multilayer networks. IEEE Communications Mag., pages 70–76, August 1999.
[92] E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1: 269–271, 1959.
[93] B. Doshi et al. Optical network design and restoration. Bell Labs Technical Journal, 4(1): 58–84, 1999.
[94] B. Doshi, R. Nagarajan, and M. Qureshi. Fast distributed restoration in general mesh optical networks. In Proceedings of the 17th Annual National Fiber Optic Engineers Conference (NFOEC), Baltimore, MD, July 2001.
[95] B. T. Doshi, D. R. Jeske, N. Raman, and A. Sampath. Reliability and capacity efficiency of restoration strategies for telecommunication networks. In Proc. Design of Reliable Communication Networks (DRCN), Banff, Canada, October 2003.
[96] J. Doucette, M. Clouqueur, and W. D. Grover. On the availability and capacity requirements of shared backup path-protected mesh networks. Optical Networks Magazine, 4(6): 29–44, 2003.
[97] J. Doucette and W. D. Grover. Comparison of mesh protection and restoration schemes and the dependency on graph connectivity. In Proceedings 3rd International Workshop on the Design of Reliable Communication Networks (DRCN), Budapest, Hungary, October 2001.
[98] J. Doucette and W. D. Grover. Maintenance-immune optical mesh network design. In Proceedings of the 18th Annual National Fiber Optic Engineers Conference (NFOEC), pages 2049–2061, Dallas, TX, September 2002.
[99] J. Doucette, W. D. Grover, and R. Martens. Modularity and economy-of-scale effects in the optimal design of mesh-restorable networks. In Proceedings of 1999 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), pages 226–231, Edmonton, AB, Canada, May 1999.
[100] R. Doverspike et al. Fast restoration in a mesh network of optical cross-connects. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), San Diego, CA, February 1999.
[101] R. Doverspike, S. Phillips, and J. Westbrook. Transport network architectures in an IP world. In Proc. IEEE Infocom., pages 305–314, Tel Aviv, Israel, March 2000.
[102] R. Doverspike and J. Yates. Challenges for MPLS in optical network restoration. IEEE Communications Mag., 39(2): 89–96, 2001.
[103] S. E. Dreyfus. An appraisal of some shortest-path algorithms. Operations Research, 17(3): 395–412, 1969.
[104] Z. Dziong, S. Kasera, and R. Nagarajan. Efficient capacity sharing in path restoration schemes for meshed optical networks. In Proceedings of the 18th Annual National Fiber Optic Engineers Conference (NFOEC), Dallas, TX, September 2002.
[105] G. Ellinas. Fault restoration in optical networks: General methodology and implementation. PhD thesis, Columbia University, New York, NY, 1998.
[106] G. Ellinas et al. Restoration in layered architectures with a WDM mesh optical layer. Annual Review of Communications for the International Engineering Consortium (IEC), vol.55, 2002.
[107] G. Ellinas et al. Routing and restoration architectures in mesh optical networks. Optical Networks Magazine, 4(1): 91–106, 2003.
[108] G. Ellinas et al. Transparent optical switches: Technology issues and challenges. Annual Review of Communications for the International Engineering Consortium (IEC), vol.56, November 2003.
[109] G. Ellinas et al. Network control and management challenges in opaque networks utilizing transparent optical switches. IEEE Communications Mag., 42(2): S16–S24, 2004.
[110] G. Ellinas, A. Hailemariam, and T. Stern. Optical switch failure protection in mesh networks with arbitrary non-planar architectures. In Proc. IEEE Globecom., Rio de Janeiro, Brazil, December 1999.
[111] G. Ellinas, A. Hailemariam, and T. Stern. Protection of a priority connection from an optical switch failure in mesh networks with planar topologies. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), San Diego, CA, February 1999.
[112] G. Ellinas, S. Rong, A. Hailemariam, and T. Stern. Protection cycle covers in optical networks with arbitrary mesh topologies. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Baltimore, MD, March 2000.
[113] G. Ellinas, T. Stern, and A. Hailemariam. Protection cycles in WDM mesh networks. IEEE J. Select. Areas Commun., 18(10): 1924–1937, 2000.
[114] G. Ellinas and T. E. Stern. Automatic protection switching for link failures in optical networks with bi-directional links. In Proc. IEEE Globecom., pages 152–156, London, UK, November 1996. Also presented in the Workshop on WDM Network Management and Control, Dallas, TX, June 1996.
[115] A. F. Elrefaie. Self-healing WDM ring networks with an all-optical protection path. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), San Jose, CA, pages 255–256, February 1992.
[116] D. Eppstein. Finding the K shortest paths. SIAM J. Comput., 28(2): 652–673, 1998.
[117] S. G. Finn, M. Medard, and R. A. Barry. A new algorithm for bi-directional link self-healing for arbitrary redundant networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), San Jose, CA, February 1998.
[118] S. G. Finn, M. M. Medard, and R. A. Barry. A novel approach to automatic protection switching using trees. In Proc. IEEE Int. Conf. Commun. (ICC), pages 272–276, Montreal, Canada, June 1997.
[119] G.S. Fishman. Monte Carlo: Concepts, Algorithms, and Applications. Springer-Verlag, New York, NY, 1995.
[120] H. Fleischner. Eulerian Graphs and Related Topics Part I: Vol. 1, volume 45 of Annals of Discrete Mathematics. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1990.
[121] J. E. Ford and J. Walker. Dynamic spectral power equalization using micro-mechanics. IEEE Photonics Technology Letters, 10: 1440–1442, 1998.
[122] L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
[123] B. Forst and W. Grover. Testing the accuracy of analytical estimates of spare capacity in protected mesh networks. Journal of Optical Networks, 5(10): 715–738, 2006.
[124] S. French, J-F. Labourdette, K. Bala, and P. Miller-Pittman. Efficient network switching hierarchy. In Proceedings of the 18th Annual National Fiber Optic Engineers Conference (NFOEC), Dallas, TX, September 2002.
[125] A. Fumagalli et al. Survivable networks based on optimal routing and wdm self-healing rings. In Proc. IEEE Infocom., volume 2, New York, NY, March 1999.
[126] A. Fumagalli and L. Valacrenghi. IP restoration vs WDM protection: Is there an optimal choice? IEEE Network Mag., 14(6): 34–41, 2000.
[127] L. M. Gardner, M. Heydari, J. Shah, I. H. Sudborough, I. G. Tollis, and C. Xia. Techniques for finding ring covers in survivable networks. In Proc. IEEE Globecom., pages 1862–1866, San Francisco, CA, November 1994.
[128] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to NP-Completeness. W.H. Freeman, New York, 1979.
[129] A. Gencata and B. Mukherjee. Virtual-topology adaptation for WDM mesh networks under dynamic traffic. In Proc. IEEE Infocom., New York, NY, June 2002.
[130] K. C. Glossbrenner. Availability and reliability of switched services. IEEE Communications Mag., 31(6): 28–33, 1993.
[131] L. Goddyn. Cycles in Graphs, chapter: A girth requirement for the cycle double cover conjecture. Elsevier Science Publishers BV, 1985.
[132] C. C. Gotlieb and D. G. Corneil. Algorithms for finding a fundamental set of cycles for an undirected linear graph. Comm. ACM, 10(12): 780–783, 1967.
[133] W. Grover. The protected working capacity envelope concept: An alternate paradigm for automated service provisioning. IEEE Communications Mag., pages 62–69, January 2004.
[134] W. Grover and A. Kodian. Failure-independent path protection with p-cycles: Efficient, fast and simple protection for transparent optical networks. In Proceedings of the 7th International Conference on Transparent Optical Networks, pages 363–369, Barcelona, Spain, July 2005.
[135] W. D. Grover. The SelfHealing network: A fast distributed restoration technique for networks using digital crossconnect machines. In Proc. IEEE Globecom., pages 1090–1095, Tokyo, Japan, November 1987.
[136] W. D. Grover. SelfHealing networks: A distributed algorithm for K-shortest link-disjoint paths in a multi-graph with applications in real time network restoration. PhD thesis, The University of Alberta, 1989.
[137] W. D. Grover. Case studies of survivable ring, mesh and mesh-arc hybrid networks. In Proc. IEEE Globecom., pages 633–638, Orlando, FL, December 1992.
[138] W. D. Grover. Telecommunications Network Management into the 21st Century, chapter: Distributed restoration of the transport network. IEEE Press, New York, 1994.
[139] W. D. Grover. Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice-Hall, Englewood Cliffs, NJ, 2004.
[140] W. D. Grover, T. D. Bilodeau, and B. D. Venables. Near optimal spare capacity planning in a mesh restorable network. In Proc. IEEE Globecom., pages 2007–2012, Phoenix, AZ, December 1991.
[141] W. D. Grover and M. Clouqueur. Span-restorable mesh networks with multiple quality of protection (QoP) service-classes. In Proceedings of International Conference on Optical Communications and Networks (ICOCN), pages 321–323, Singapore, November 2002.
[142] W. D. Grover, B. D. Venables, J. H. Sandham, and A. F. Milne. Performance studies of a SelfHealing network protocol in Telecom Canada long haul networks. In Proc. IEEE Globecom., pages 452–458, San Diego, CA, December 1990.
[143] W.D. Grover, M.Clouqueur, and T. Bach. Quantifying and managing the influence of maintenance actions on the survivability of mesh-restorable networks. In Proceedings of the 17th Annual National Fiber Optic Engineers Conference (NFOEC), pages 1514–1525, Baltimore, MD, July 2001.
[144] W.D. Grover and D. Stamatelakis. Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network restoration. In Proc. IEEE Int. Conf. Commun. (ICC), pages 537–543, Atlanta, GA, June 1998.
[145] L. Guo et al. Dynamic shared-path protection based on SRLG constraints in WDM mesh networks. In Proceedings of the IEEE International Conference on Communications, Circuits and Systems, pages 643–646, Chengdu, China, June 2004.
[146] A. Hadjiantonis, A. Khalil, G. Ellinas, and M. Ali. A novel restoration scheme for next generation WDM-based IP backbone networks. In Proc. LEOS Annual Meeting, Tucson, Arizona, October 2003.
[147] A. Hailemariam. Island-based restoration in mesh optical networks. PhD thesis, Columbia University, New York, NY, 2003.
[148] A. Hailemariam, G. Ellinas, and T. Stern. Localized restoration in mesh optical networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Los Angeles, CA, February 2004.
[149] R. D. Hall and S. Whitt. Protection of SONET based networks. In Proc. IEEE Globecom., pages 821–825, Dallas, TX, November 1989.
[150] G. Held. On the road to OC-768. IT Professional, 3(2): 46–48, March–April 2001.
[151] A. Herschtal and M. Herzberg. Dynamic capacity allocation and optimal rearrangement for reconfigurable networks. In Proc. IEEE Globecom., pages 946–951, Singapore, 1990.
[152] M. Herzberg. A decomposition approach to assign spare channels in self-healing networks. In Proc. IEEE Globecom., Houston, TX, December 1993.
[153] M. Herzberg and S. Bye. An optimal spare-capacity assignment model for survivable networks with hop limits. In Proc. IEEE Globecom., pages 1601–1607, San Francisco, CA, 1994.
[154] H. S. Hinton. An Introduction to Photonic Switching Fabrics. Plenum Press, New York, 1993.
[155] G. Hjalmtysson, J. Yates, S. Chaudhuri, and A. Greenberg. Smart routers simple optics: An architecture for the optical internet. IEEE/OSA J. Lightwave Technology, 18(12): 161–167, 2000.
[156] P. Ho and H. T. Mouftah. SLP: A framework for service-guaranteed shared protection in WDM mesh networks. IEEE Communications Mag., pages 97–103, February 2002.
[157] P.-H. Ho and H. T. Mouftah. A framework of a survivable optical internet using short leap shared protection (SLSP). In Proc. IEEE Workshop on High Performance Switching and Routing (HPSR), Dallas, TX, May 2001.
[158] P. H. Ho and H. T. Mouftah. Allocation of protection domains in dynamic WDM mesh networks. In Proc. IEEE Int. Conf. Commun. (ICC), Seattle, WA, May 2003.
[159] P. H. Ho and H. T. Mouftah. Spare capacity allocation for WDM mesh networks with partial wavelength conversion capacity. In Proc. IEEE High Performance Switching and Routing, Turin, Italy, June 2003.
[160] P. Humblet. The direction of optical technology in the metro area. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2001.
[161] Ilog Inc. CPLEX. http://www.ilog.com/products/cplex/.
[162] R. R. Iraschko, W. D. Grover, and M. H. MacGregor. A distributed real time path restoration protocol with performance close to centralized multi-commodity max flow. In Proceedings of the First International Workshop on Design of Reliable Communication Networks (DRCN), Bruges, Belgium, May 1998.
[163] R. R. Iraschko, M. H. MacGregor, and W. D. Grover. Optimal capacity placement for path restoration in mesh survivable networks. In Proc. IEEE Int. Conf. Commun. (ICC), pages 1568–1574, Dallas, TX, June 1996.
[164] R.R. Iraschko, M.H MacGregor, and W.D. Grover. Optimal capacity placement for path restoration in stm or ATM mesh-survivable networks. IEEE/ACM Trans. Networking, 6(3): 325–336, 1998.
[165] F. Jaeger. Flows and generalized coloring theorems in graphs. J. Combinatorial Theory, 26(2): 205–216, 1979.
[166] F. Jaeger. Cycles in Graphs, chapter: A survey of the cycle double cover conjecture. Elsevier Science Publishers BV, 1985.
[167] F. Jaeger and T. Swart. Combinatorics 79, chapter: Conjecture 1. Elsevier Science Publishers BV, 1980.
[168] J. Jaffe. Algorithm for finding path with multiple constraints. Networks, 14: 95–116, 1984.
[169] C. Janczewski, D. Jeske, K. Mrti, R. Nagarajan, and A. Sampath. Cost, restoration, performance and reliability of optical networks with shared and dedicated protection schemes. In Proceedings of the 18th Annual National Fiber Optic Engineers Conference (NFOEC), Dallas, TX, September 2002.
[170] S. Johansson. A transport network involving a reconfigurable WDM network layer – A European demonstration. IEEE/OSA J. Lightwave Technology, 14(6): 1341–1348, 1996.
[171] D. Johnson, G. N. Brown, S. L. Beggs, C. P. Botham, I. Hawker, R. S. K. Chng, M. C. Sinclair, and M. J. OMahony. Distributed restoration strategies in telecommunications networks. In Proc. IEEE Int. Conf. Commun. (ICC), New Orleans, LA, May 1994.
[172] Admela Jukan. QoS-based Wavelength Routing in Multi-Service WDM Networks. Springer-Verlag, New York, 2001.
[173] Admela Jukan and Gerald Franzl. Path selection methods with multiple constraints in service guaranteed WDM networks. IEEE/ACM Trans. Networking, 12(1): 59–72, 2004.
[174] N. Katoh, T. Ibaraki, and H. Mine. An efficient algorithm for k shortest simple paths. Networks, 12(4): 411–427, 1982.
[175] D. Katz et al. Traffic Engineering Extensions to OSPF Version 2. Technical Report RFC 3630, Internet Engineering Task Force (IETF), September 2003.
[176] J. Kirkpatrick. Private communication, December 2006.
[177] H. Kobrinski and M. Azuma. Distributed control algorithms for dynamic restoration in DCS mesh networks: Performance evaluation. In Proc. IEEE Globecom., pages 1584–1588, Houston, TX, November 1993.
[178] M. Kodialam and T.V. Lakshman. Integrated dynamic IP and wavelength routing in IP over WDM networks. In Proc. IEEE Infocom., pages 358–366, Anchorage, Alaska, 2001.
[179] M. Kodialan and T.V. Lakshman. Dynamic routing of bandwidth guaranteed tunnels with restoration. In Proc. IEEE Infocom., Tel Aviv, Israel, March 2000.
[180] H. Komine, T. Chujo, T. Ogura, K. Miyazaki, and T. Soejima. A distributed restoration algorithm for multiple-link and node failures of transport networks. In Proc. IEEE Globecom., pages 459–463, San Diego, December 1990.
[181] K. Kompella et al. OSPF Extensions in Support of Generalized MPLS. Technical Report RFC 4203, Internet Engineering Task Force (IETF), October 2005.
[182] K. Kompella et al. Routing Extensions in Support of Generalized MPLS. Technical Report RFC 4202, Internet Engineering Task Force (IETF), October 2005.
[183] S. K. Korotky. Network global expectation model: A statistical formalism for quickly quantifying network needs and costs. IEEE/OSA J. Lightwave Technology, 22(3): 703–722, 2004.
[184] S. K. Korotky. An overview of the network global expectation model. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Los Angeles, CA, March 2004.
[185] S. K. Korotky. Analysis and optimization of two-tier networks with application to optical transport backbones. J. Optical Network, 4(1): 45–63, 2005.
[186] J-F. Labourdette, E. Bouillet, and S. Chaudhuri. Role of optical network and spare router design in resilient IP backbone architectures. In Proc. Design of Reliable Communication Networks (DRCN), Banff, Canada, October 2003.
[187] J-F. Labourdette, E. Bouillet, R. Ramamurthy, G. Ellinas, S. Chaudhuri, and K. Bala. Routing strategies for capacity-efficient and fast-restorable mesh optical networks. Photonic Network Communications, 4(3/4):219–235, 2002.
[188] J-F. Labourdette et al. Fast approximate dimensioning and performance analysis of mesh optical networks. In Proc. Design of Reliable Communication Networks (DRCN), Banff, Canada, October 2003.
[189] J-F. Labourdette et al. Layered architecture for scalability in core mesh optical networks. In Proceedings of the 19th Annual National Fiber Optic Engineers Conference (NFOEC), Orlando, FL, September 2003.
[190] J-F. Labourdette et al. Fast approximate dimensioning and performance analysis of mesh optical networks. IEEE/ACM Trans. Networking, 13(4): 906–917, 2005.
[191] J-F. Labourdette, G. W. Hart, and A. S. Acampora. Branch-exchange sequences for reconfiguration of lightwave networks. IEEE Trans. Commun., 42(10): 2822–2832, 1994.
[192] W. Lai et al. Network Hierarchy and Multilayer Survivability, Internet Engineering Task Force (IETF)RFC 3386, November 2002.
[193] J. Lang et al. Link Management Protocol (LMP). Technical Report RFC 4204, Internet Engineering Task Force (IETF), October 2005.
[194] A. Lardies, R. Gupta, and R. Patterson. Traffic grooming in a multi-layer network. Optical Networks Magazine, 2(3): 91–99, 2001.
[195] E. L. Lawler. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18(7): 401–405, 1972.
[196] D. Leung, S. Arakawa, M. Murata, and W. D. Grover. Reoptimization strategies to maximize traffic-carrying readiness in WDM survivable mesh networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2005.
[197] C. Li et al. Gain equalization in metropolitan and wide area optical networks using optical amplifiers. In Proc. IEEE Infocom., pages 130–137, Toronto, Canada, July 1994.
[198] G. Li et al. Efficient distributed path selection for shared restoration connections. In Proc. IEEE Infocom., New York, NY, July 2002.
[199] H. Liu. OSPF-TE Extensions in Support of Shared Mesh Restoration. Technical Report draft-liu-gmpls-ospf-restoration-00.txt, Internet Engineering Task Force (IETF), October 2002.
[200] H. Liu et al. Distributed route computation algorithms and dynamic provisioning in intelligent mesh optical networks. In Proc. IEEE Int. Conf. Commun. (ICC), Anchorage, Alaska, May 2003.
[201] Y. Liu, D. Tipper, and P. Siripongwutikorn. Approximating optimal spare capacity allocation by successive survivable routing. In Proc. IEEE Infocom., Anchorage, AL, April 2001.
[202] Y. Liu, D. Tipper, and P. Siripongwutikorn. Approximating optimal spare capacity allocation by successive survivable routing. IEEE/ACM Trans. Networking, 13(1): 198–211, 2005.
[203] J. Livas. Optical transmission evolution: From digital to analog to ? Network tradeoffs between optical transparency and reduced regeneration cost. IEEE/OSA J. Lightwave Technology, 23(1): 219–224, 2005.
[204] S. Lumetta and M. Medard. Towards a deeper understanding of link restoration algorithms for mesh networks. In Proc. IEEE Infocom., Anchorage, Alaska, April 2001.
[205] X. Luo and B. Wang. Diverse routing in WDM optical networks with shared risk link group (SRLG) failures. In Proceedings 5th International Workshop on Design of Reliable Communication Networks (DRCN), Ischia, Italy, October 2005.
[206] M. H. Macgregor and W. D. Grover. Optimized k-shortest-paths algorithm for facility restoration. Software–Practice and Experience, 24(9): 823–834, 1994.
[207] N. Madamopoulos et al. Design, transport performance study and engineering of a 11Tb/s US metro network. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 444–445, Anaheim, CA, March 2002.
[208] S. Makam et al. Framework for MPLS Based Recovery. Technical Report RFC 3469, Internet Engineering Task Force (IETF), February 2003.
[209] J. Manchester, P. Bonenfant, and C. Newton. The evolution of transport network survivability. IEEE Communications Mag., pages 44–51, August 1999.
[210] E. Mannie et al. Generalized Multi-Protocol Label Switching (GMPLS) Architecture. Technical Report RFC 3945, Internet Engineering Task Force (IETF), October 2004.
[211] P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM J. Comput., 5(1): 90–99, 1976.
[212] A. McGuire, S. Mirza, and D. Freeland. Application of control plane technology to dynamic configuration management. IEEE Communications Mag., pages 94–99, September 2001.
[213] M. Medard, R. A. Barry, S. G. Finn, W. He, and S. Lumetta. Generalized loopback recovery in optical mesh networks. IEEE/ACM Trans. Networking, 10(1): 153–164, 2002.
[214] M. Medard, S. G. Finn, R. A. Barry, and R. G. Gallager. Redundant trees for pre-planned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Trans. Networking, 7(5): 641–652, 1999.
[215] D. Medhi. Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks. IEEE/ACM Trans. Networking, 3(6): 809–818, 1995.
[216] E. Modiano and P. Lin. Traffic grooming in WDM networks. IEEE Communications Mag., 39(7): 124–129, 2001.
[217] A. Morea et al. Impact of the reach of WDM systems and traffic volume on the network resources and cost of translucent optical transport networks. In Proceedings of the International Conference on Transparent Optical Networks (ICTON), pages 65–68, Wroclaw, Poland, July 2004.
[218] A. Morea and J. Poirrier. A critical analysis of the possible cost savings of translucent networks. In Proceedings of the 5th International Workshop on Design of Reliable Communication Networks (DRCN), Ischia, Italy, October 2005.
[219] J. Moy et al. OSPF Version 2. Technical Report RFC 2328, Internet Engineering Task Force (IETF), April 1998.
[220] B. Mukherjee. WDM optical communication networks: Progress and challenges. IEEE J. Select. Areas Commun., 18(10): 1810–1824, 2000.
[221] B. Mukherjee. Optical WDM Networks. Springer-Verlag, New York, 2006.
[222] R. Nagarajan et al. Large scale photonic integrated circuits. IEEE Journal of Sel. Top. In Quant. Elec., 11(1): 50–65, 2005.
[223] T. Naito et al. 1 Terabits/s WDM transmission over 10,000 Km. In Proceedings European Conference on Optical Communications (ECOC), Nice, France, September 1999.
[224] G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 1988.
[225] T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms, volume 32 of Annals of Discrete Mathematics. Elsevier Science Publishers BV, Amsterdam, The Netherlands, 1988.
[226] K. Noguchi et al. The first field trial of a wavelength routing WDM full-mesh network system (AWG-STAR) in a metropolitan/local area. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 611–613, Atlanta, GA, February 2003.
[227] T. H. Noh, Dhadesugoor, R. Vaman, and Xuedao Gu. Reconfiguration for service and selfhealing in ATM networks based on virtual paths. Computer Networks, 29(16): 1857–1867, 1997.
[228] E. Oki et al. A disjoint path selection scheme with shared risk link groups in GMPLS networks. IEEE Communications Letters, 6(9): 406–408, 2002.
[229] C. Olzsewski et al. Two-tier network economics. In Proceedings of the 18th Annual National Fiber Optic Engineers Conference (NFOEC), Dallas, TX, September 2002.
[230] M.J. O’Mahoney et al. The design of a European optical network. IEEE/OSA J. Lightwave Technology, 13(5): 817–828, 1995.
[231] Optical Network Magazine. Special Issue on Telecommunications Grooming. 2(3), May/June 2001.
[232] C. Ou, H. Zang, and B. Mukherjee. Sub-path protection for scalability and fast recovery in WDM mesh networks. Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 19–22, 2001.
[233] J. C. Palais. Fiber-Optic Communications. Prentice-Hall, Englewood Cliffs, NJ, 2004.
[234] X. Pan and G. Xiao. Algorithms for the diverse routing problem in WDM networks with shared risk link groups. In Proceedings of the 9th IEEE International Conference on Communications Systems, pages 381–385, Singapore, September 2004.
[235] D. Papadimitriou. Analysis of Generalized MPLS-based Recovery Mechanisms (including Protection and Restoration). Technical Report RFC 4428, Internet Engineering Task Force (IETF), March 2006.
[236] K. Paton. An algorithm for finding a fundamental set of cycles for a graph. Comm. ACM, 12(9): 514–518, 1969.
[237] P. Peloso, D. Penninckx, M. Prunaire, and L. Noirie. Optical transparency of a heterogeneous pan-European network. IEEE/OSA J. Lightwave Technology, 22(11): 242–248, 2004.
[238] M. Pioro and D. Medhi. Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, San Mateo, California, 2005.
[239] A. Pratt et al. 40x10.7 Gb/s DWDM transmission over a meshed ULH network with dynamically reconfigurable optical crossconnects. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Atlanta, GA, March 2003.
[240] C. Qiao et al. Distributed partial information management (DPIM) schemes for survivable networks – Part I. In Proc. IEEE Infocom., New York, NY, July 2002.
[241] C. Qiao et al. Novel models for efficient shared-path protection. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2002.
[242] Y. Qin, L. Mason, and K. Jia. Study on a joint multiple layer restoration scheme for IP over WDM networks. IEEE Network Mag., pages 43–48, March/April 2003.
[243] B. Rajagopalan et al. IP over Optical Networks: A Framework. Technical Report RFC 3717, Internet Engineering Task Force (IETF), March 2004.
[244] B. Rajagopalan, D. Pendarakis, D. Saha, S. Ramamurthy, and K. Bala. IP over optical networks: Architectural aspects. IEEE Communications Mag., pages 94–102, September 2000.
[245] B. Ramamurthy et al. Optimizing amplifier placements in a multi-wavelength optical LAN/MAN: The equally-powered-wavelengths case. IEEE/OSA J. Lightwave Technology, 16(9): 1560–1569, 1998.
[246] B. Ramamurthy et al. Impact of transmission impairments on the teletraffic performance of wavelength-routed optical networks. IEEE/OSA J. Lightwave Technology, 17(10): 1713–1723, 1999.
[247] B. Ramamurthy et al. Transparent vs. opaque vs. translucent wavelength-routed optical networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 59–61, San Diego, CA, February 1999.
[248] B. Ramamurthy et al. Translucent optical WDM networks for the next-generation backbone networks. In Proc. IEEE Globecom., San Antonio, TX, November 2001.
[249] R. Ramamurthy, A. Akyamac¸, J-F. Labourdette, and S. Chaudhuri. Pre-emptive reprovisioning in mesh optical networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Atlanta, GA, March 2003.
[250] R. Ramamurthy, Z. Bogdanowicz, S. Samieian, D. Saha, B. Rajagopalan, S. Sengupta, S. Chaudhuri, and K. Bala. Capacity performance of dynamic provisioning in optical networks. IEEE/OSA J. Lightwave Technology, 19(1): 40–48, 2001.
[251] R. Ramamurthy et al. Comparison of centralized and distributed provisioning of lightpaths in optical networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2001.
[252] R. Ramamurthy et al. Routing lightpaths in optical mesh networks with express links. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2002.
[253] R. Ramamurthy et al. Limiting sharing on protection channels in mesh optical networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Atlanta, GA, March 2003.
[254] R. Ramamurthy, J-F. Labourdette, and E. Bouillet. Limitations of scaling switching capacity by interconnecting multiple switches. In Proceedings of the Annual National Fiber Optic Engineers Conference (NFOEC), Anaheim, CA, March 2006.
[255] S. Ramamurthy and B. Mukherjee. Survivable WDM mesh networks. Part I Protection. In Proc. IEEE Infocom., New York, NY, March 1999.
[256] S. Ramamurthy and B. Mukherjee. Survivable WDM mesh networks. Part II Restoration. In Proc. IEEE Int. Conf. Commun. (ICC), Vancouver, BC, Canada, June 1999.
[257] R. Ramaswami and K. Sivarajan. Optical Networks: A Practical Perspective, 2nd Edition. Morgan Kaufmann Publishers, San Mateo, California, 2002.
[258] R. Ramaswami and K. N. Sivarajan. Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Networking, 3(5): 489–500, 1995.
[259] R. Ranganathan, L. Blair, and J. Berthold. Architectural implications of core grooming in a 46-node USA optical network. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 498–499, Anaheim, CA, March 2002.
[260] R. C. Read. Theory of Graphs, chapter: Graph theory algorithms. Academic Press, 1969.
[261] G. N. Rouskas and M. Ammar. Dynamic reconfiguration in multihop WDM networks. Journal of High Speed Networks, 4(3): 221–238, 1995.
[262] L. Sahasrabuddh, S. Ramamurthy, and B. Mukherjee. Fault management in IP-over-WDM networks: WDM protection versus IP restoration. IEEE J. Select. Areas Commun., 20(1): 21–33, 2002.
[263] G. Sahin and Murat Azizoglu. Optical layer survivability: Single service-class case. Proceedings of SPIE, 4233: 267–278, 2000.
[264] G. Sahin and Murat Azizoglu. Optical layer survivability for single and multiple service classes. Journal of High Speed Networks, 10(2): 91–108, 2001.
[265] H. Sakauchi, Y. Nishimura, and S. Hasegawa. A Self-Healing network with an economical spare-channel assignment. In Proc. IEEE Globecom., pages 438–443, San Diego, CA, December 1990.
[266] A. A. M. Saleh. Transparent optical networking in backbone networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 62–64, Baltimore, MD, February 2000.
[267] A. A. M. Saleh. All-optical networking in metro, regional, and backbone networks. In Proc. IEEE/LEOS Summer Topical Meeting, Quebec, Canada, July 2002.
[268] A. A. M. Saleh. Defining all-optical networking and assessing its benefits in metro, regional and backbone networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 410–411, Atlanta, GA, February 2003.
[269] A.A.M. Saleh and J. M. Simmons. Architectural principles of optical regional and metropolitan access networks. IEEE/OSA J. Lightwave Technology, 17(12): 2431–2448, 1999.
[270] K. Sato and S. Okamoto. Photonic transport technologies to create robust backbone networks. IEEE Communications Mag., pages 78–87, August 1999.
[271] D. A. Schupke, W. D. Grover, and M. Clouqueur. Strategies for enhanced dual failure restorability with static or reconfigurable p-cycle networks. In Proc. IEEE Int. Conf. Commun. (ICC), Paris, France, June 2004.
[272] D. A. Schupke, C. Gruber, and A. Autenrieth. Optimal configuration of p-cycles in WDM networks. In Proc. IEEE Int. Conf. Commun. (ICC), pages 2761–2765, New York, NY, June 2002.
[273] P. Sebos, J. Yates, G. Hjalmtysson, and A. Greenberg. Auto-discovery of shared risk link groups. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages WDD3/1–WDD3/3, Anaheim, CA, March 2001.
[274] P. Sebos, J. Yates, D. Rubenstein, and A. Greenberg. Effectiveness of shared risk link group auto-discovery in optical networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2002.
[275] S. Sengupta, S. Chaudhuri, and D. Saha. Reliability of optical mesh and ring networks. In OptoElectronics and Communications Conference (OECC), Sydney, Australia, July 2001.
[276] S. Sengupta, V. Kumar, and D. Saha. Switched optical backbone for cost-effective scalable IP networks. IEEE Communications Mag., pages 60–70, June 2003.
[277] G. Shen et al. Sparse placement of electronic switching nodes for low blocking in translucent optical networks. OSA Journal of Optical Networking, 1(12): 424–441, 2002.
[278] G. Shen and W. D. Grover. Extending the p-cycle concept to path segment protection for span and node failure recovery. IEEE J. Select. Areas Commun., 21(8): 1306–1319, 2003.
[279] L. Shen, X. Yang, and B. Ramamurthy. A load-balancing shared-protection-path reconfiguration approach in WDM wavelength-routed networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, February 2004.
[280] D. Shier. Computational experience with an algorithm for finding the k shortest paths in a network. Journal of Research of the NBS, 78: 139–164, 1974.
[281] D. Shier. Interactive methods for determining the k shortest paths in a network. Networks, 6: 151–159, 1976.
[282] D. Shier. On algorithms for finding the k shortest paths in a network. Networks, 9: 195–214, 1979.
[283] J. M. Simmons. On determining the optimal optical reach for a long-haul network. IEEE/OSA J. Lightwave Technology, 23(3): 1039–1048, 2005.
[284] J. B. Slevinsky, W. D. Grover, and M. H. MacGregor. An algorithm for survivable network design employing multiple self-healing rings. In Proc. IEEE Globecom., pages 1568–1573, Houston, TX, November 1993.
[285] Murari Sridharan, Arun K. Somani, and Murti V. Salapaka. Approaches for capacity and revenue optimization in survivable WDM networks. Journal of High Speed Networks, 10(2): 109–125, 2001.
[286] D. Stamatelakis and W. D. Grover. IP layer restoration and network planning based on virtual protection cycles. IEEE J. Select. Areas Commun., 18(10): 1938–1949, 2000.
[287] D. Stamatelakis and W. D. Grover. Theoretical underpinning for the efficiency of restorable networks using preconfigured cycles (p-cycles). IEEE Trans. Commun., 48(8):1262–1265, 2000.
[288] American National Standards. ANSI T1.105 1988.
[289] T. E. Stern and K. Bala. Multiwavelength Optical Networks: A Layered Approach. Addison- Wesley, Reading, MA, 1999.
[290] J. Strand, A. Chiu, and R. Tkach. Issues for routing in the optical layer. IEEE Communications Mag., pages 81–87, February 2001.
[291] K. Struyve and P. Demeester. Design of distributed restoration algorithms for ATM meshed networks. In Proc. IEEE Third Symposium on Communications and Vehicular Technology in the Benelux, Eindhoven, The Netherlands, October 1995.
[292] J. W. Suurballe and R. E. Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14: 325–336, 1984.
[293] J. W. Suurballe. Disjoint paths in a network. Networks, 14: 125–145, 1974.
[294] J. Tapolcai and P.-H. Ho. Linear formulation for segment shared protection. In Proc. OptiComm, Dallas, TX, October 2003.
[295] R. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comput., 1(2): 146–160, 1972.
[296] R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
[297] M. Tarsi. Semi-duality and the cycle double cover conjecture. J. Combinatorial Theory, 41(3): 332–340, 1986.
[298] S. Thiagarajan and A. Somani. Capacity fairness of WDM networks with grooming capabilities. Optical Networks Magazine, 2(3): 24–31, 2001.
[299] R. W. Tkach, E. L. Goldstein, J. A. Nagel, and J. L. Strand. Fundamental limits of optical transparency. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), San Jose, CA, February 1998.
[300] M. To and P. Neusy. Unavailability analysis of long-haul networks. IEEE J. Select. Areas Commun., 12(1): 100–109, 1994.
[301] P. Toliver, R. Runser, J. Young, and J. Jackel. Experimental field trial of waveband switching and transmission in a transparent reconfigurable optical network. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 783–784, Atlanta, GA, February 2003.
[302] I. Tomkos et al. 80x10.7Gb/s ultra long-haul (+4200 Km) DWDM network with reconfigurable broadcast and select OADMs. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2002.
[303] M. Tsurusawa, J. Matsuda, T. Otani, M. Daikoku, S. Aruga, and H. Tanaka. Field trial of 10-Gb/s resilient packet ring for a next-generation multi-service metropolitan area network. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2005.
[304] E. Varma, S. Sankaranarayanan, G. Newsome, Z. Lin, and H. Epstein. Architecting the services optical network. IEEE Communications Mag., pages 80–87, September 2001.
[305] J-P. Vassuer, P. Demeester, and M. Pickavet. Network Recovery: Protection and Restoration of Optical, SONET SDH, IP and MPLS. Morgan Kaufmann Publishers, San Mateo, California, 2004.
[306] B. O. Venables, W. D. Grover, and M. H. MacGregor. Two strategies for spare capacity placement in mesh restorable networks. In Proc. IEEE Int. Conf. Commun. (ICC), pages 267–271, Helsinki, Finland, 2001.
[307] R. Vodhanel et al. National scale WDM networking demonstration by the MONET consortium. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Dallas, TX, February 1997.
[308] R. E. Wagner, R. C. Alferness, A. A. M. Saleh, and M. S. Goodman. MONET: Multiwavelength Optical Networking. IEEE/OSA J. Lightwave Technology, 14(6): 1349–1355, 1996.
[309] R. E. Wagner et al. The potential of optical layer networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2001.
[310] J. Walker. The future of MEMS in telecommunication networks. J. Micromech. Microeng., 10(3): R1–R7, 2000.
[311] A. F. Wallace. Ultra long-haul DWDM: Network economics. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2001.
[312] Z. Wang and J. Crowcroft. Quality of service routing for supporting multimedia applications. IEEE J. Select. Areas Commun., 14(7): 1228–1234, 1996.
[313] O. J. Wasem. An algorithm for designing rings for survivable fiber networks. IEEE Trans. Reliability, 40(4): 428–432, 1991.
[314] O. J. Wasem. Optimal topologies for survivable fiber optic networks using SONET self-healing rings. In Proc. IEEE Globecom., pages 2032–2038, Phoenix, AZ, December 1991.
[315] O. J.Wasem, R. H. Cardwell, and T-H.Wu. Software for designing survivable SONET networks using self-healing rings. In Proc. IEEE Int. Conf. Commun. (ICC), pages 425–431, Chicago, IL, June 1992.
[316] H. Wen et al. Dynamic RWA algorithms under shared-risk-link-group constraints. In Proceedings of the IEEE International Conference on Communications, Circuits and Systems and West Sino Expositions, pages 871–875, Chengdu, China, June 2002.
[317] P. Wong. Network architectures in the metro DWDM environment. In Proc. National Fiber Optics Engineers Conference (NFOEC), pages 588–596, Denver, CO, August 2000.
[318] L. A. Wrobel. Disaster Recovery Planning for Telecommunications. Artech House, Norwood, MA, 1990.
[319] T-H. Wu. Fiber Network Service Survivability. Artech House, Norwood, MA, 1992.
[320] T-H. Wu. Roles of optical components in survivable fiber networks. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), pages 252–253, San Jose,CA, February 1992.
[321] T-H. Wu and R. C. Lau. A class of self-healing ring architectures for SONET network applications. In Proc. IEEE Globecom., pages 444–451, San Diego, CA, December 1990.
[322] Y. Xiong and L. G. Mason. Restoration strategies and spare capacity requirements in selfhealing ATM networks. IEEE/ACM Trans. Networking, 7(1): 98–110, 1999.
[323] D. Xu, Y. Chen, Y. Xiong, C. Qiao, and X. He. On finding disjoint paths in single and dual link cost networks. In Proc. IEEE Infocom., Hong Kong, March 2004.
[324] D. Xu, Y. Xiong, and C. Qiao. Protection with multi-segments (PROMISE) in networks with shared risk link groups (SRLG). In 40th Annual Allerton Conference on Communication, Control, and Computing, Allerton, IL, October 2002.
[325] D. Xu, Y. Xiong, and C. Qiao. Novel algorithms for shared segment protection. IEEE J. Select. Areas Commun., 21(8): 1320–1331, 2003.
[326] C. H. Yang and S. Hasegawa. FITNESS: Failure immunization technology for network service survivability. In Proc. IEEE Globecom., pages 1549–1554, Hollywood, FL, November 1988.
[327] X. Yang and B. Ramamurthy. Dynamic routing in translucent WDM optical networks. In Proc. IEEE Int. Conf. Commun. (ICC), pages 2796–2802, New York City, NY, April 2002.
[328] Y. Ye, C. Assi, S. Dixit, and M. Ali. A simple dynamic integrated provisioning/protection scheme in IP over WDM networks. IEEE Communications Mag., pages 174–182, November 2001.
[329] Y. Ye, S. Dixit, and M. Ali. On joint protection/restoration in IP-centric DWDM-based optical transport networks. IEEE Communications Mag., pages 174–183, June 2000.
[330] J. Y. Yen. Finding the K shortest loopless paths in a network. Management Science, 17(11): 712–716, 1971.
[331] C. Yihong et al. Metro network with reconfigurable optical add-drop module. In IEEE/LEOS Summer Topical Meeting, pages TuF3–25–TuF3–26, Quebec, Canada, July 2002.
[332] H. Zang et al. Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints. IEEE/ACM Trans. Networking, 11(2): 248–258, 2003.
[333] H. Zeng, C. Huang, A. Vukovic, and J. M. Savoie. Transport performance of an all-optical metro WDM network based on dynamic all-optical switches. In Proc. IEEE/OSA Optical Fiber Commun. Conf. (OFC), Anaheim, CA, March 2005.
[334] H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. A novel, generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Trans. Networking, 11(2): 285–299, 2003.
[335] K. Zhu and B. Mukherjee. Traffic grooming in an optical WDM mesh network. IEEE J. Select. Areas Commun., 20(1): 122–133, 2002.
[336] K. Zhu and B. Mukherjee. A review of traffic grooming in WDM optical networks: Architectures and challenges. Optical Networks Magazine, 4(2): 55–64, 2003.