Advertisement of the Group Best Paths in BGP
draft-chen-bgp-group-path-update-02
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Enke Chen | ||
| Last updated | 2004-09-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
In this document we first identify the (neighbor-AS based) Group Best Paths for an address prefix as the sufficient subset that can be advertised by a BGP route reflector or a BGP confederation ASBR to eliminate the MED-type route oscillations in a network. We then propose a BGP extension to support the advertisement of the Group Best Paths by a route reflector or a confederation ASBR. The extension also allows the advertisement of all the paths in a group that survive the MED comparison, thus achieving the same routing consistency as the full IBGP mesh. The proposed mechanisms are designed such that the vast majority of the BGP speakers in a network need only minor software changes in order to deploy the mechanisms.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)