Network routing with path vector protocols

Sobrinho, J.L.

doi:10.1145/863961.863963

Cited by 72 publications

(108 citation statements)

References 0 publications

Supporting

Mentioning

100

Contrasting

Unclassified

Order By: Relevance

“…A concise model for this setting is that of routing algebras [4,5,14,15]. In this paper, a routing algebra A is defined as a totally ordered monoid with a compatible infinity element.…”

Section: An Algebraic Model For Policy Routingmentioning

confidence: 99%

“…Originally in shortest path routing the rule was simply to pick the least cost path with respect to some additive link weights, but network operators have increasingly turned towards more sophisticated policies like path reliability and resilience [17], bandwidth and perceived congestion [8,16], business relations and service level agreements [2], etc. These routing policies, and the computational complexity of the path selection problem thereof, are well-understood today, thanks to the theory of routing algebras [4,5,14,15].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Computational Complexity of Policy Routing

Zubor

Kő̈rösi

Gulyás

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. With the advent of new network architectures, like Software Defined Networks, the rules governing the way traffic is routed through the network are becoming increasingly complex. In this paper, we revisit the theoretic underpinnings of policy routing in the light of the new requirements. We show that certain simple but plausible algebraic properties already induce intractable path selection instances, and we extend the algebraic description of policies for which the related path selection problem is guaranteed to be tractable with a new class, called polynomial finite algebras, which captures many real-life application domains.

show abstract

“…A concise model for this setting is that of routing algebras [4,5,14,15]. In this paper, a routing algebra A is defined as a totally ordered monoid with a compatible infinity element.…”

Section: An Algebraic Model For Policy Routingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the Computational Complexity of Policy Routing

Zubor

Kő̈rösi

Gulyás

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…João Luís Sobrinho provides an algebraic framework for the examination of path vector protocols [11]. In doing so, he allows us to more easily prove whether a given protocol will converge by examining the protocol's monotonic and isotonic properties, where monotonicity means that the weight, or cost, of a path does not decrease when the path is extended and isotonicity means that the relationship between the weights of two paths with the same origin is preserved when both paths are extended to the same node.…”

Section: Convergence Of Ipvpmentioning

confidence: 99%

An Interior Path Vector Routing Protocol

Creagh

Sreenan

2006

Proceedings. 2006 31st IEEE Conference on Local Computer Networks

View full text Add to dashboard Cite

show abstract

“…Advances in the theory of policy-based routing (for example, [5]- [7]) have yielded sufficient conditions that ensure BGP safety -that is, guarantees of convergence to a unique stable state. Yet flexibility is typically seen as the more important concern in the operation of real-world networks.…”

Section: Introductionmentioning

confidence: 99%

Detecting unsafe BGP policies in a flexible world

Perouli¹,

Griffin

Maennel

et al. 2012

2012 20th IEEE International Conference on Network Protocols (ICNP)

View full text Add to dashboard Cite

Abstract-Internet Service Providers (ISPs) need to balance multiple opposing objectives. On one hand, they strive to offer innovative services to obtain competitive advantages; on the other, they have to interconnect with potentially competing ISPs to achieve reachability, and coordinate with them for certain services. The complexity of balancing these objectives is reflected in the diversity of policies of the Border Gateway Protocol (BGP), the standard inter-domain routing protocol.Unforeseen interactions among the BGP policies of different ISPs can cause routing anomalies. In this work, we propose a methodology to allow ISPs to check their BGP policy configurations for guaranteed convergence to a single stable state. This requires that a set of ISPs share their configurations with each other, or with a trusted third party. Compared to previous approaches to BGP safety, we (1) allow ISPs to use a richer set of policies, (2) do not modify the BGP protocol itself, and (3) detect not only instability, but also multiple stable states. Our methodology is based on the extension of current theoretical frameworks to relax their constraints and use incomplete data. We believe that this provides a rigorous foundation for the design and implementation of safety checking tools.

show abstract

Network routing with path vector protocols

Cited by 72 publications

References 0 publications

On the Computational Complexity of Policy Routing

On the Computational Complexity of Policy Routing

An Interior Path Vector Routing Protocol

Detecting unsafe BGP policies in a flexible world

Contact Info

Product

Resources

About