Scalable De-Aggregation for Overlays Using the Border Gateway Protocol (BGP)
draft-templin-rtgwg-scalable-bgp-01
| Document | Type | Expired Internet-Draft (individual) Expired & archived | |
|---|---|---|---|
| Authors | Fred Templin,Greg Saccone,Gaurav Dawra,Acee Lindem,Victor Moreno | ||
| Last updated | 2019-08-02(Latest revision 2019-01-29) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The Border Gateway Protocol (BGP) has well-known limitations in terms of the numbers of routes that can be carried and stability of the routing system. This is especially true when mobile nodes frequently change their network attachment points, which in the past has resulted in excessive announcements and withdrawals of de-aggregated prefixes. This document discusses a means of accommodating scalable de-aggregation of IPv6 prefixes for overlay networks using BGP.
Authors
Fred Templin
Greg Saccone
Gaurav Dawra
Acee Lindem
Victor Moreno
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)