Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2018436.2018473acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free access

Seamless network-wide IGP migrations

Published: 15 August 2011 Publication History

Abstract

Network-wide migrations of a running network, such as the replacement of a routing protocol or the modification of its configuration, can improve the performance, scalability, manageability, and security of the entire network. However, such migrations are an important source of concerns for network operators as the reconfiguration campaign can lead to long and service-affecting outages.
In this paper, we propose a methodology which addresses the problem of seamlessly modifying the configuration of commonly used link-state Interior Gateway Protocols (IGP). We illustrate the benefits of our methodology by considering several migration scenarios, including the addition or the removal of routing hierarchy in an existing IGP and the replacement of one IGP with another. We prove that a strict operational ordering can guarantee that the migration will not create IP transit service outages. Although finding a safe ordering is NP complete, we describe techniques which efficiently find such an ordering and evaluate them using both real-world and inferred ISP topologies. Finally, we describe the implementation of a provisioning system which automatically performs the migration by pushing the configurations on the routers in the appropriate order, while monitoring the entire migration process.

Supplementary Material

MP4 File (sigcomm_10_1.mp4)

References

[1]
G. G. Herrero and J. A. B. van der Ven, Network Mergers and Migrations: Junos Design and Implementation. Wiley Publishing, 2010.
[2]
V. Gill and M. Jon, "AOL Backbone OSPF-ISIS Migration," NANOG29 Presentation, 2003.
[3]
NANOG thread, "IPv6: IS-IS or OSPFv3," http://mailman.nanog.org/pipermail/nanog/2008-December/006194.html, 2008.
[4]
"Results of the GEANT OSPF to ISIS Migration," GEANT IPv6 Task Force Meeting, 2003.
[5]
NANOG thread, "OSPF-vs-ISIS," http://www.merit.edu/mail.archives/nanog/2005-06/msg00406.html, 2005.
[6]
B. Decraene, J. L. Roux, and I. Minei, "LDP Extension for Inter-Area Label Switched Paths (LSPs)," RFC 5283 (Proposed Standard), Jul. 2008.
[7]
T. M. Thomas, OSPF Network Design Solutions, Second Edition. Cisco Press, 2003.
[8]
J.-L. L. Roux, J.-P. Vasseur, and J. Boyle, "Requirements for Inter-Area MPLS Traffic Engineering," RFC 4105, Jun. 2005.
[9]
N. Leymann, B. Decraene, C. Filsfils, M. Konstantynowicz, and D. Steinberg, "Seamless MPLS Architecture," Internet draft, 2011.
[10]
P. Templin, "Small Network Operator - Lessons Learned," NANOG45 Presentation, 2009.
[11]
"Virtual Network Operator (VNO) hosting opportunities with orbit research." {Online}. Available: http://www.orbitresearch.co.uk/services/virtual-network-operator
[12]
Y. Wang, E. Keller, B. Biskeborn, J. van der Merwe, and J. Rexford, "Virtual routers on the move: live router migration as a network-management primitive," in Proc. SIGCOMM, 2008.
[13]
Moy, J., "OSPF Version 2,"; RFC 2328, 1998.
[14]
Oran D., "OSI IS-IS Intra-domain Routing Protocol," RFC 1142, 1990.
[15]
L. Vanbever, S. Vissicchio, C. Pelsser, P. Francois, and O. Bonaventure, "Seamless Network-Wide IGP Migrations," Université catholique de Louvain, Tech. Rep., June 2011, http://hdl.handle.net/2078.1/75312.
[16]
S. Iasi, P. François, and S. Uhlig, "Forwarding deflection in multi-area OSPF," in CoNEXT, 2005.
[17]
J. Rexford, J. Wang, Z. Xiao, and Y. Zhang, "BGP Routing Stability of Popular Destinations," in Proc. IMW, 2002.
[18]
S. Raza, Y. Zhu, and C.-N. Chuah, "Graceful Network Operations," in Proc. INFOCOM, 2009.
[19]
P. Francois and O. Bonaventure, "Avoiding transient loops during the convergence of link-state routing protocols," Trans. on Netw., vol. 15, pp. 1280--1292, December 2007.
[20]
P. Francois, M. Shand, and O. Bonaventure, "Disruption-free topology reconfiguration in OSPF Networks," in Proc. INFOCOM, 2007.
[21]
J. Fu, P. Sjodin, and G. Karlsson, "Loop-free updates of forwarding tables," Trans. on Netw. and Serv. Man., vol. 5, no. 1, pp. 22--35, 2008.
[22]
L. Shi, J. Fu, and X. Fu, "Loop-free forwarding table updates with minimal link overflow," in Proc. ICC, 2009.
[23]
H. Ballani, P. Francis, T. Cao, and J. Wang, "Making routers last longer with ViAggre," in Proc. NSDI, 2009.
[24]
P. Francois, C. Filsfils, J. Evans, and O. Bonaventure, "Achieving sub-second IGP convergence in large IP networks," Comput. Commun. Rev., vol. 35, no. 3, pp. 33--44, 2005.
[25]
C. Filsfils, P. Mohapatra, J. Bettink, P. Dharwadkar, P. D. Vriendt, Y. Tsier, V. V. D. Schrieck, O. Bonaventure, and P. Francois, "BGP Prefix Independent Convergence (PIC) Technical Report," Cisco, Tech. Rep., 2011.
[26]
M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, 1990.
[27]
C. Filsfils, P. Francois, M. Shand, B. Decraene, J. Uttaro, N. Leymann, and M. Horneffer, "LFA applicability in SP networks," Internet Draft, May 2011.
[28]
S. Vissicchio, L. Cittadini, M. Pizzonia, L. Vergantini, V. Mezzapesa, and M. L. Papagni, "Beyond the Best: Real-Time Non-Invasive Collection of BGP Messages," in Proc. INM/WREN 2010, 2010.
[29]
L. Vanbever, G. Pardoen, and O. Bonaventure, "Towards validated network configurations with NCGuard," in Proc. of Internet Network Management Workshop 2008, Orlando, USA, October 2008, pp. 1--6.
[30]
N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with rocketfuel," in Proc. SIGCOMM, 2002.
[31]
J. Yu, "Scalable Routing Design Principles," RFC 2791, 2000.
[32]
"GEANT Backbone Topology," 2010, http://www.geant.net/network/networktopology/pages/home.aspx.
[33]
"Seamless Network-Wide IGP Migrations," 2011, http://inl.info.ucl.ac.be/softwares/seamless-network-migration.
[34]
A. Shaikh, R. Dube, and A. Varma, "Avoiding instability during graceful shutdown of multiple OSPF routers," Trans. on Netw., vol. 14, pp. 532--542, June 2006.
[35]
J. Moy, P. Pillay-Esnault, and A. Lindem, "Graceful OSPF Restart," RFC 3623, 2003.
[36]
M. Shand and L. Ginsberg, "Restart Signaling for IS-IS," RFC 5306, 2008.
[37]
R. Keralapura, C.-N. Chuah, and Y. Fan, "Optimal Strategy for Graceful Network Upgrade," in Proc. INM, 2006.
[38]
X. Chen, Z. M. Mao, and J. Van der Merwe, "PACMAN: a platform for automated and controlled network operations and configuration management," in Proc. CONEXT, 2009.
[39]
R. Alimi, Y. Wang, and Y. R. Yang, "Shadow configuration as a network management primitive," in Proc. SIGCOMM, 2008.
[40]
E. Keller, J. Rexford, and J. Van Der Merwe, "Seamless BGP migration with router grafting," in Proc. NSDI, 2010.
[41]
P. Francois and O. Bonaventure, "Avoiding transient loops during IGP Convergence in IP Networks," in Proc. INFOCOM, 2005.
[42]
F. Le, G. G. Xie, and H. Zhang, "Theory and new primitives for safely connecting routing protocol instances," in Proc. SIGCOMM, 2010.
[43]
Y. Rekhter, T. Li, and S. Hares, "A Border Gateway Protocol 4 (BGP-4)," RFC 4271, 2006.
[44]
T. Griffin and G. Wilfong, "On the Correctness of IBGP Configuration," SIGCOMM Comput. Commun. Rev., vol. 32, no. 4, pp. 17--29, 2002.

Cited By

View all
  • (2023)Keeping up to Date with P4Runtime: An Analysis of Data Plane Updates on P4 Switches2023 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking57963.2023.10186439(1-9)Online publication date: 12-Jun-2023
  • (2023)Taming the transient while reconfiguring BGPProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3604855(77-93)Online publication date: 10-Sep-2023
  • (2021)On the Complexity of Weight-Dynamic Network Algorithms2021 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking52078.2021.9472803(1-9)Online publication date: 21-Jun-2021
  • Show More Cited By

Index Terms

  1. Seamless network-wide IGP migrations

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGCOMM '11: Proceedings of the ACM SIGCOMM 2011 conference
    August 2011
    502 pages
    ISBN:9781450307970
    DOI:10.1145/2018436
    • cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 41, Issue 4
      SIGCOMM '11
      August 2011
      480 pages
      ISSN:0146-4833
      DOI:10.1145/2043164
      Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 15 August 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. configuration
    2. design guidelines
    3. interior gateway protocol (igp)
    4. migration
    5. summarization

    Qualifiers

    • Research-article

    Conference

    SIGCOMM '11
    Sponsor:
    SIGCOMM '11: ACM SIGCOMM 2011 Conference
    August 15 - 19, 2011
    Ontario, Toronto, Canada

    Acceptance Rates

    SIGCOMM '11 Paper Acceptance Rate 32 of 223 submissions, 14%;
    Overall Acceptance Rate 462 of 3,389 submissions, 14%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)57
    • Downloads (Last 6 weeks)8
    Reflects downloads up to 03 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Keeping up to Date with P4Runtime: An Analysis of Data Plane Updates on P4 Switches2023 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking57963.2023.10186439(1-9)Online publication date: 12-Jun-2023
    • (2023)Taming the transient while reconfiguring BGPProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3604855(77-93)Online publication date: 10-Sep-2023
    • (2021)On the Complexity of Weight-Dynamic Network Algorithms2021 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking52078.2021.9472803(1-9)Online publication date: 21-Jun-2021
    • (2019)Enabling Efficient and Consistent Network Update in Wireless Data CentersIEEE Transactions on Network and Service Management10.1109/TNSM.2019.289976316:2(505-520)Online publication date: Jun-2019
    • (2019)Consistency, Feasibility, and Optimality of Network Update in SDNsIEEE Transactions on Network Science and Engineering10.1109/TNSE.2018.28750556:4(824-835)Online publication date: 1-Oct-2019
    • (2019)Survey of Consistent Software-Defined Network UpdatesIEEE Communications Surveys & Tutorials10.1109/COMST.2018.287674921:2(1435-1461)Online publication date: Oct-2020
    • (2018)B4 and afterProceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication10.1145/3230543.3230545(74-87)Online publication date: 7-Aug-2018
    • (2017)Swing StateProceedings of the Symposium on SDN Research10.1145/3050220.3050233(115-121)Online publication date: 3-Apr-2017
    • (2017)Safe, Efficient, and Robust SDN Updates by Combining Rule Replacements and AdditionsIEEE/ACM Transactions on Networking10.1109/TNET.2017.272346125:5(3102-3115)Online publication date: 1-Oct-2017
    • (2017)Safe Update of Hybrid SDN NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2016.264258625:3(1649-1662)Online publication date: 1-Jun-2017
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media