direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Es gibt keine deutsche Übersetzung dieser Webseite.

Aidan Walton's Publications

Rethinking iBGP Routing
Zitatschlüssel OMUPMO-RIR-10
Autor Oprescu, Iuniana M. and Meulle, Mickael and Uhlig, Steve and Pelsser, Cristel and Maennel, Olaf and Owezarski, Philippe
Buchtitel Proceedings of the ACM SIGCOMM Conference (poster session)
Seiten 411–412
Jahr 2010
ISBN 978-1-4503-0201-2
ISSN 0146-4833
DOI http://dx.doi.org/10.1145/1851182.1851236
Ort New Delhi, India
Adresse New York, NY, USA
Monat August / September
Notiz Poster
Verlag ACM
Zusammenfassung 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) addressed in the literature [1]. 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.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang:

Schnellnavigation zur Seite über Nummerneingabe