BGP Auto Discovery
draft-raszuk-idr-bgp-auto-discovery-06
|
| Document |
Type |
|
Active Internet-Draft (individual)
|
|
Last updated |
|
2019-12-11
|
|
Stream |
|
(None)
|
|
Intended RFC status |
|
(None)
|
|
Formats |
|
plain text
pdf
htmlized
bibtex
|
| Stream |
Stream state |
|
(No stream defined) |
|
Consensus Boilerplate |
|
Unknown
|
|
RFC Editor Note |
|
(None)
|
| IESG |
IESG state |
|
I-D Exists
|
|
Telechat date |
|
|
|
Responsible AD |
|
(None)
|
|
Send notices to |
|
(None)
|
Network Working Group R. Raszuk, Ed.
Internet-Draft Bloomberg LP
Intended status: Standards Track J. Mitchell, Ed.
Expires: June 10, 2020 W. Kumari
Google
K. Patel
Arrcus
J. Scudder
Juniper Networks
December 8, 2019
BGP Auto Discovery
draft-raszuk-idr-bgp-auto-discovery-06
Abstract
This document describes a method for automating portions of a
router's BGP configuration via discovery of BGP peers with which to
establish further sessions from an initial "bootstrap" router. This
method can apply for establishment of either Internal or External BGP
peering sessions.
Requirements Language
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in RFC 2119 [RFC2119].
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on June 10, 2020.
Raszuk, et al. Expires June 10, 2020 [Page 1]
Internet-Draft draft-raszuk-idr-bgp-auto-discovery December 2019
Copyright Notice
Copyright (c) 2019 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. History . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
3. Auto discovery mechanism . . . . . . . . . . . . . . . . . . 5
4. Deployment Considerations . . . . . . . . . . . . . . . . . . 9
5. Capability Advertisement . . . . . . . . . . . . . . . . . . 9
6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 10
7. Security Considerations . . . . . . . . . . . . . . . . . . . 10
8. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 10
9. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 11
10. References . . . . . . . . . . . . . . . . . . . . . . . . . 11
10.1. Normative References . . . . . . . . . . . . . . . . . . 11
10.2. Informative References . . . . . . . . . . . . . . . . . 11
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 13
1. History
An idea for IBGP Auto Mesh [I-D.raszuk-idr-ibgp-auto-mesh] was
originally presented at IETF 57. The concept made use of an IGP
(either ISIS or OSPF) for flooding BGP auto discovery information.
In this proposal both auto-discovery/bootstrapping and propagation of
BGP configuration parameters occur within the BGP4 protocol itself.
The IGP based IBGP discovery mechanism presented was well fitted to
the native IP switching, in which all nodes in the IGP need to
participate in BGP mesh. However, it also came with a number of
drawbacks, some of which include the requirement for leaking between
area boundaries or possible race conditions between disjoint flooding
paths from which the information arrived.
The BGP peer auto discovery mechanism described in this document was
conceived initially in 2008 as a way to distribute peering session
Raszuk, et al. Expires June 10, 2020 [Page 2]
Show full document text