Policy disputes in path-vector protocols

Griffin, Timothy G.; Shepherd, F. Bruce; Wilfong, Gordon

doi:10.1109/icnp.1999.801912

Cited by 102 publications

(125 citation statements)

References 11 publications

Supporting

Mentioning

124

Contrasting

Order By: Relevance

“…• Tractability in most common cases: Checking whether a network admits a CoyOTE under general routing policies is NP-complete, just like the weaker question of checking for the sufficient-only condition of No-Dispute-Wheel [9]. Luckily, we were able to find a polynomial time algorithm that verifies safety of BGP configurations for virtually any policy used by network operators in practice.…”

Section: B Dpvp Convergencementioning

confidence: 87%

“…In particular, we strengthen the SPVP-based results of [9] to show that even DPVP is safe in a network without a "dispute wheel" structure. Thus, spurious updates do not affect the large body of research on safety in dispute-wheel-free settings.…”

Section: B Dpvp Convergencementioning

confidence: 99%

“…Just as local routing policies can affect global convergence [9], the local engineering decisions that cause spurious updates can also trigger oscillations, and slow convergence exponentially. Eliminating all sources of spurious updates would require major changes to router design and the BGP protocol.…”

Section: A Spurious Selection Of Lower-ranked Routesmentioning

confidence: 99%

“…Over the past decade, researchers have developed a good understanding of which combinations of routing policies lead to oscillations [2]- [8]. Most of these results were based on an abstract model of the interdomain routing system -namely the Simple Path Vector Protocol (SPVP) [9] -that captures how each node selects the highestranked path consistent with its neighbors' decisions. This paper shows that local engineering decisions, such as BGP timers and internal router structures, can produce short-term artifacts that lead to protocol oscillations not well modeled by SPVP.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

BGP safety with spurious updates

Suchara

Fabrikant

Rexford

2011

2011 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-We explore BGP safety, the question of whether a BGP system converges to a stable routing, in light of several BGP implementation features that have not been fully included in the previous theoretical analyses. We show that Route Flap Damping, MRAI timers, and other intra-router features can cause a router to briefly send "spurious" announcements of less-preferred routes. We demonstrate that, even in simple configurations, this short-term spurious behavior may cause long-term divergence in global routing. We then present DPVP, a general model that unifies these sources of spurious announcements in order to examine their impact on BGP safety. In this new, more robust model of BGP behavior, we derive a necessary and sufficient condition for safety, which furthermore admits an efficient algorithm for checking BGP safety in most practical circumstances -two complementary results that have been elusive in the past decade's worth of classical studies of BGP convergence in more simple models. We also consider the implications of spurious updates for well-known results on dispute wheels and safety under filtering.

show abstract

Section: B Dpvp Convergencementioning

confidence: 87%

Section: B Dpvp Convergencementioning

confidence: 99%

Section: A Spurious Selection Of Lower-ranked Routesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

BGP safety with spurious updates

Suchara

Fabrikant

Rexford

2011

2011 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

show abstract

“…Another example of policy-consistent valuations are metric-based valuations (defined in [12]): Definition 7 Let δ : L → R >0 be a positive real-valued function that specifies the "length" of each link (a "metric" function). A valuation function v that is based on δ is one in…”

Section: Definition 6 Node I ∈ [N] Has a Next-hop Valuation Function mentioning

confidence: 99%

Incentive-compatible interdomain routing

2011

View full text Add to dashboard Cite

The routing of traffic between Internet domains, or Autonomous Systems (ASes), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP) [21]. Using BGP, ASes can apply semantically rich routing policies to choose interdomain routes in a distributed fashion. This expressiveness in routing-policy choice supports domains' autonomy in network operations and in business decisions, but it comes at a price: The interaction of locally defined routing policies can lead to un- J. Feigenbaum was supported in part by ONR grants N00014-01-1-0795, N00014-04-1-0725, and N00014-09-1-0757, by NSF grants 0208972, 0219018, and 0428422, and by HSARPA grant ARO-1756303.V. Ramachandran was supported in part by ONR grant N00014-01-1-0795 and by NSF grants 0524139 and 0751674; work done in part while at ICSI and at the Stevens Institute of Technology.M. Schapira was supported by NSF grant 0331548 and by grants from the Israel Science Foundation and the USA-Israel Bi-national Science Foundation; work done in part while visiting Yale University as a graduate student at the Hebrew University of Jerusalem. (see, e.g., [24]). Networking researchers have addressed this problem by devising constraints on policies that guarantee BGP convergence without unduly limiting expressiveness and autonomy (see, e.g., [9,11]). J. Feigenbaum (corresponding author)In addition to taking this engineering or "protocoldesign" approach, researchers have approached interdomain routing from an economic or "mechanism-design" point of view. It is known that lowest-cost-path (LCP) routing can be implemented in an incentive-compatible, BGP-compatible manner [4,22] but that several other natural classes of policies cannot [3,6]. In this paper, we present the first example of a class of interdomain-routing policies that is more general than LCP routing and for which BGP itself is both incentive-compatible and guaranteed to converge. We also present several steps toward a general theory of incentivecompatible, BGP-compatible interdomain routing.

show abstract

Comprehensive Solution for Anomaly-Free BGP

Musunuri

Cobb

2005

Operations and Management in IP-Based Networks

View full text Add to dashboard Cite

Abstract. The Internet consists of many self-administered and inter-connected Autonomous Systems (ASms). ASms exchange inter-AS routing information with each other via the Border Gateway Protocol (BGP). Neighboring BGP routers located in different ASms share their inter-AS routing information via external BGP (eBGP), whereas two routers in the same AS share their inter-AS routing information via internal BGP (iBGP). From the paths received from its peers, each BGP router chooses the best path based on routing policies chosen locally at its own AS. Conflicting policies between different ASms may cause divergence problems in eBGP, i.e., permanent oscillations in the chosen path to the destination. On the other hand, divergence problems may also occur in iBGP. This is caused by the interaction of routereflection clustering, which is a technique to improve the scalability of iBGP, and other factors, such as intra-AS link costs, among others. In this paper, we provide a comprehensive solution that avoids all the known anomalies with both eBGP and iBGP. In our solution, each AS can locally choose its routing policies, while still ensuring anomaly-free behavior.

show abstract

Policy disputes in path-vector protocols

Cited by 102 publications

References 11 publications

BGP safety with spurious updates

BGP safety with spurious updates

Incentive-compatible interdomain routing

Comprehensive Solution for Anomaly-Free BGP

Contact Info

Product

Resources

About