BGP Wedgies
draft-griffin-bgp-wedgies-00

Document Type Expired Internet-Draft (individual)
Last updated 2004-09-09
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-griffin-bgp-wedgies-00.txt

Abstract

It has commonly been assumed that the Border Gateway Protocol (BGP) is a tool for distributing reachability information in a manner that creates forwarding paths in a deterministic manner. In this memo we will describe a class of BGP configurations for which there is more than one potential outcome, and where forwarding states other than the intended state are equally stable, and that the stable state where BGP converges may be selected by BGP in a non- deterministic manner. These stable, but unintended, BGP states are termed here "BGP Wedgies".

Authors

Tim Griffin (tim.griffin@intel.com)
Geoff Huston (gih@telstra.net)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)