Theory and new primitives for safely connecting routing protocol instances

Le, Franck; Xie, Geoffrey G.; Zhang, Hui

doi:10.1145/1851182.1851210

Cited by 18 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multiple control planes. Several designs have been proposed for composing multiple control plane layers to improve network reliability [4,15,26,33,34,48,52]. For example, B4 [26] builds layered control architecture to run central TE on top of the baseline routing protocols, and FBOSS [4,15] agents run specific control planes (i.e., OpenR [6] and BGP) simultaneously to compose both protocols' features.…”

Section: Related Workmentioning

confidence: 99%

“…Secondly, the attempt of building a single, infallible control plane often results in overengineered, complex control plane. Third, existing work in multiple control plane composition supports only a limited number of properties (e.g., reachability, domain backup) and fail to provide generic routing correctness guarantees (e.g., waypoint routing, subnet isolation) [34].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Carbide: Highly Reliable Networks Through Real-Time Multiple Control Plane Composition

Chen

Gökarslan

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

Achieving highly reliable networks is essential for network operators to ensure proper packet delivery in the event of software errors or hardware failures. Networks must ensure reachability and routing correctness, such as subnet isolation and waypoint traversal. Existing work in network verification relies on centralized computation at the cost of fault tolerance, while other approaches either build an over-engineered, complex control plane, or compose multiple control planes without providing any guarantee on correctness. This paper presents Carbide, a novel system to achieve high reliability in networks through distributed verification and multiple control plane composition. The core of Carbide is a simple, generic, efficient distributed verification framework that transforms a generic network verification problem to a reachability verification problem on a directed acyclic graph (DAG), and solves the latter via an efficient distributed verification protocol (DVprotocol). Equipped with verification results, Carbide allows the systematic composition of multiple control planes and realization of operator-specified consistency. Carbide is fully implemented. Extensive experiments show that (1) Carbide reduces downtime by 43% over the most reliable individual underlying control plane, while enforcing correctness requirements on all traffic; and (2) by systematically decomposing computation to devices and pruning unnecessary messaging between devices during verification, Carbide scales to a production data center network.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Carbide: Highly Reliable Networks Through Real-Time Multiple Control Plane Composition

Chen

Gökarslan

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…First, the operator must decide which routers to include in each routing instance, subject to additional requirements such as resiliency. Second, the operator must select a small number of routers as border routers and configure connecting primitives [16,19] to "glue" the different routing protocol instances together. (The next section has a detailed description of the tradeoffs involved in this step.)…”

Section: Policy Groupsmentioning

confidence: 99%

Modeling complexity of enterprise routing design

Rao

Xie

2012

Proceedings of the 8th International Conference on Emerging Networking Experiments and Technologies

Self Cite

View full text Add to dashboard Cite

Enterprise networks often have complex routing designs given the need to meet a wide set of resiliency, security and routing policies. In this paper, we take the position that minimizing design complexity must be an explicit objective of routing design. We take a first step to this end by presenting a systematic approach for modeling and reasoning about complexity in enterprise routing design. We make three contributions. First, we present a framework for precisely defining objectives of routing design, and for reasoning about how a combination of routing design primitives (e.g. routing instances, static routes, and route filters etc.) will meet the objectives. Second, we show that it is feasible to quantitatively measure the complexity of a routing design by modeling individual routing design primitives, and leveraging configuration complexity metrics [5]. Our approach helps understand how individual design choices made by operators impact configuration complexity, and can enable quantifying design complexity in the absence of configuration files. Third, we validate our model and demonstrate its utility through a longitudinal analysis of the evolution of the routing design of a large campus network over the last three years. We show how our models can enable comparison of the complexity of multiple routing designs that meet the same objective, guide operators in making design choices that can lower complexity, and enable what-if analysis to assess the potential impact of a configuration change on routing design complexity.

show abstract

“…IGP migrations could also be performed by using route redistribution. Although new primitives have been recently proposed [42], we believe that relying on a ships-in-the-night approach (when possible) makes the entire migration process easier and more manageable.…”

Section: Related Workmentioning

confidence: 99%

Seamless network-wide IGP migrations

VanbeverLaurent¹,

VissicchioStefano²,

PelsserCristel³

et al. 2011

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

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.

show abstract

Theory and new primitives for safely connecting routing protocol instances

Cited by 18 publications

References 26 publications

Carbide: Highly Reliable Networks Through Real-Time Multiple Control Plane Composition

Carbide: Highly Reliable Networks Through Real-Time Multiple Control Plane Composition

Modeling complexity of enterprise routing design

Seamless network-wide IGP migrations

Contact Info

Product

Resources

About