Abstract
An important problem in the design and deployment of communication networks is the issue of network restoration to address for various types of failures. In this chapter, we consider a variety of networks and networking technologies and argue that networks can be broadly classified as either traffic networks or transport networks. We then present optimization models for network protection for link failures and discuss how they fit into this classification. We then discuss the process of network restoration and interaction between the traffic and the transport network. Finally, we also discuss situations and failures for which restoration is difficult to model—an area that requires further exploration.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
G. R. Ash. Dynamic Routing in Telecommunication Networks. McGraw-Hill, 1997.
G. R. Ash, R. H. Cardwell, and R. P. Murray. Design and optimization of networks with dynamic routing. Bell System Technical Journal, 60:1787–1820, 1981.
G. R. Ash and P. Chemouil. 20 years of dynamic routing in telephone networks: Looking backward to the future. IEEE Global Communications Newsletter, pages 1–4, October 2004. (appears as insert in IEEE Communication Magazine, October 2004 issue).
S. Bhattacharyya and G. Iannaccone. Availability and survivability in IP networks. Tutorial presented at the 11th IEEE International Conference on Network Protocols (ICNP), November 2003.
L.S. Buriol, M.G.C. Resende, C.C. Ribeiro, and M. Thorup. A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks, 2005. In press.
R. Callon. Availability & security for IP data networks. Tutorial presented at the 4th International Workshop on Design of Reliable Communication Networks (DRCN), Banff, Canada, October 2003.
J. Cowie and A. Ogielski. Global routing instabilities during Code Red 2 and Nimda worm propagation. Presentation at NANOG23 Meeting, Oakland, CA, October 2001.
M. Ericsson, M. G. C. Resende, and P. M. Pardalos. A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization, 6(3):229–333, 2002.
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving traffic demands for operational IP networks: methodology and experience. IEEE/ACM Transactions on Networking, 9:265–279, 2001.
B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proc. 19th IEEE Conference on Computer Communications (INFOCOM’2000), pages 519–528, 2000.
B. Fortz and M. Thorup. Increasing Internet capacity using local search. Computational Optimization and Applications, 29(1):13–48, 2004. Preliminary short version of this paper published as “Internet Traffic Engineering by Optimizing OSPF weights,” in Proc. 19th IEEE Conf. on Computer Communications (INFOCOM 2000).
A. Fumagalli and L. Valcarenghi. IP restoration vs. WDM protection: Is there an optimal choice? IEEE Network, 14(6):34–41, November 2000.
A. Girard. Routing and Dimensioning in Circuit-Switched Networks. Addison-Wesley, Reading, MA, 1990.
W. Grover and D. Stametaelakis. Bridging the ring-mesh dichotomy with p-cycles. In Proc. Design of Reliable Communication Networks (DRCN’2000), Munich, pages 92–104, 2000.
W. D. Grover. Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall, 2004.
G. Iannaccone, C.-N. Chuah, S. Bhattacharyya, and C. Diot. Feasibility of IP restoration in a tier-1 backbone. IEEE Network, 18(2):13–19, March-April 2004.
R. R. Iraschko, M. MacGregor, and W. D. Grover. Optimal capacity placement for path restoration in STM or ATM mesh survivable networks. IEEE/ACM Trans. on Networking, 6:325–336, 1998.
H. Kaplan. Resilient IP network design. Tutorial presented at the 3th IEEE Workshop on IP Operations & Management (IPOM), Kansas City, Missouri, USA, October 2003.
D. R. Kuhn. Sources of failure in public switched telephone network. IEEE Computer, 30(4):31–36, April 1997.
C. Labovitz, A. Ahuja, and F. Jahanian. Experimental study of Internet stability and wide-area network failures. In Proceedings of Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (FTCS99), pages 278–285, Madison, Wisconsin, June 1999.
C. Labovitz, G. R. Malan, and F. Jahanian. Internet routing instability. IEEE/ACM Transactions on Networking, 6:515–528, 1998.
E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, 1976.
Y. Lee and B. Mukherjee. Traffic engineering in next-generation optical networks. IEEE Communications Surveys, 6(3): 16–33, 2004.
A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C.-N. Chuah, and C. Diot. Characterization of failures in an IP backbone. In Proc. of 23rd IEEE Conference on Computer Communication (INFOCOM’2004), pages 2307–2317, Hong Kong, March 2004.
D. Medhi. Diverse routing for survivability in a fiber-based sparse network. In Proc. IEEE International Conference on Communication (ICC’91), pages 672–676, Denver, Colorado, June 1991.
D. Medhi. A unified approach to network survivability for teletraffic networks: Models, algorithms and analysis. IEEE Trans. on Communications, 42:534–548, 1994.
D. Medhi and R. Khurana. Optimization and performance of network restoration schemes for wide-area teletraffic networks. Journal of Network and Systems Management, 3(3):265–294, 1995.
D. Medhi and D. Tipper. Multi-layered network survivability — models, analysis, architecture, framework and implementation: An overview. In Proc. DARPA Information Survivability Conference and Exposition (DISCEX’2000), volume I, pages 173–186, Hilton Head Island, South Carolina, USA, January 2000.
A. Nucci, B. Schroeder, S. Bhattacharyya, N. Taft, and C. Diot. IGP link weight assignment for transient link failures. In Proc. 18th International Teletraffic Congress (ITC18), pages 321-330, Berlin, Germany, September 2003.
M. Pióro and D. Medhi. Routing, Flow and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, 2004.
M. Pióro, A. Szentesi, J. Harmatos, A. Jüttner, P. Gajowniczek, and S. Kozdrowski. On OSPF related network optimization problems. Performance Evaluation, 48: 201–223, 2002.
R. F. Rey. (ed.) Engineering and Operations in the Bell System — 2nd Edition. AT&T Bell Laboratories, Murray Hill, New Jersey, 1983.
S. Srivastava, G. Agrawal, M. Pióro, and D. Medhi. Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach. IEEE eTransactions on Network and Service Management, 2005. In press.
J. Strand. Converging protection and restoration strategies of the IP and optical layers to support the survival of IP services. MPLS Summit, January 2001.
J. W. Suurballe. Disjoint paths in a network. Networks, 4:125–145, 1974.
J. W. Suurballe and R. E. Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14:325–336, 1984.
J.-P. Vasseur, M. Pickavet, and P. Demeester. Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS. Morgan Kaufmann Publishers, 2004.
Y. Wang, Z. Wang, and L. Zhang. Internet traffic engineering without full mesh overlaying. In Proc. 20th IEEE Conference on Computer Communications (INFOCOM’2001), pages 565–571, New York, USA, 2001.
D. Yuan. A bi-criteria optimization approach for robust OSPF routing. In Proc. IEEE Workshop on IP Operations and Management (IPOM’2003), pages 91–98, Kansas City, USA, October 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Medhi, D. (2006). Network Restoration. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_28
Download citation
DOI: https://doi.org/10.1007/978-0-387-30165-5_28
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30662-9
Online ISBN: 978-0-387-30165-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)