Categories and Subject Descriptors

and forwarding loops due to MED attribute and IBGP path asymmetry. We consider the problem of constructing an IBGP configuration given the IGP connectivity such that there are no persistent oscillations and loops, and apply the conditions developed in the paper on this problem. We prove that solving the problem

We study the route oscillation problem in the Internal Border Gateway Protocol (I-BGP) [19]. We propose a formal model of I-BGP and use it to show that even deciding whether an I-BGP configuration can converge is an NP-Complete problem. Finally, we propose a modification to I-BGP and show

to distribute routes inside a single Autonomous System — has also been shown to oscillate. Despite the fact that iBGP is configured by a single provider according to apparently straight forward rules, more than eight years of research has not solved the problem of iBGP oscillation. Various solutions have been

We study the route oscillation problem [16, 19] in the Internal Border Gateway Protocol (I-BGP) [18] when route reflection is used. We pro-pose a formal model of I-BGP and use it to show that even deciding whether an I-BGP configuration with route reflection can converge is an NP-Complete problem

of this protocol. Distribution of this memo is unlimited. Copyright Notice Copyright (C) The Internet Society (2000). All Rights Reserved. The Border Gateway Protocol [1] is an inter-autonomous system routing protocol designed for TCP/IP internets. Currently in the Internet BGP deployments are configured

on the construction of an iBGP session configuration that guarantees two correctness properties—loop-free forwarding paths and complete visibility to all eBGP-learned best routes— while attempting to minimize the number of iBGP sessions (for scalability) and ensuring that the constructed configuration guarantees

Abstract — The Internet’s current interdomain routing

We study the route oscillation problem [16, 19] in the Internal Border Gateway Protocol (I-BGP) [18] when route reflection is used. We propose a formal model of I-BGP and use it to show that even deciding whether an I-BGP configuration with route reflection can converge is an NP-Complete problem

-free configurations and providing design guidelines for network operators. In this paper, we show several anomalies caused by defective dissemination of routes in iBGP. We define the dissemination correctness property, which models the ability of routers to learn at least one route to each destination