Learn More
Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the <i>shortest paths problem.</i> The border gateway protocol (BGP) is currently the only interdomain routing protocol deployed in the Internet. BGP does not solve a shortest paths problem since any interdomain protocol is required to allow policy-based(More)
—An IP routing protocol is safe if it is guaranteed to converge in the absence of network topology changes. BGP, currently the only interdo-main routing protocol employed on the Internet, is not safe in this sense. It may seem that the source of BGP's potential divergence is inherent in the requirements for any interdomain routing protocol — policy-based(More)
The Border Gateway Protocol, BGP, is currently the only interdomain routing protocol employed on the Inter-net. As required of any interdomain protocol, BGP allows policy-based metrics to override distance-based met-rics and enables each autonomous system to independently define its routing policies with little or no global coordination. Varadhan et al.(More)
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. We then propose a modification to I-BGP and show that route(More)
—The emergence of new capabilities such as virtual-ization and elastic (private or public) cloud computing infras-tructures has made it possible to deploy multiple applications, on demand, on the same cloud infrastructure. A major challenge to achieve this possibility, however, is that modern applications are typically distributed, structured systems that(More)