Rethinking iBGP Routing

@poster{Oprescu2010a,
	title        = {Rethinking iBGP Routing},
	author       = {Iuniana Oprescu and Mickael Meulle and Steve Uhlig and Cristel Pelsser and Olaf Maennel and Philippe Owezarski},
	year         = 2010,
	month        = aug,
	booktitle    = {SIGCOMM 2010 Poster/Demo},
	address      = {New Delhi, India},
	doi          = {10.1145/1851182.1851236},
	url          = {https://www.sigcomm.org/conference-planning/sigcomm-planning/posters-and-demos},
	abstract     = {The Internet is organized as a collection of administrative domains, known as Autonomous Systems (ASes). These ASes interact through the Border Gateway Protocol (BGP) that allows them to share reachability information. Adjacent routers in distinct ASes use external BGP (eBGP), whereas in a given AS routes are propagated over internal BGP (iBGP) sessions between any pair of routers. In large ASes where a logical full-mesh is not possible, confederations or route reflectors (RRs) are used. However, these somewhat scalable alternatives have introduced their own set of unpredictable effects (persistent routing oscillations and forwarding loops causing an increase of the convergence time) extensively addressed in the literature. The solution we propose to these issues consists of a structured routing overlay holding a comprehensive view of the routes. We describe the design of a distributed entity that performs BGP route pre-computation for its clients inside a large backbone network and propagates the paths to the routers. Compared to the current iBGP routing, the advantage of the overlay approach is the separation between the responsibility of the control plane (route storage and best path computation) and the forwarding of the packets. One of the major improvements we bring is the divided routing table tackling the scalability concerns and allowing for parallel computation of paths.},
	groups       = {Posters},
	keywords     = {Internet, BGP, route computation, routing overlay}
}