BGP Color-Aware Routing Problem Statement
draft-dskc-bess-bgp-car-problem-statement-02
BESS WorkGroup D. Rao
Internet-Draft S. Agrawal
Intended status: Informational C. Filsfils
Expires: August 26, 2021 K. Talaulikar
Cisco Systems
B. Decraene
Orange
D. Steinberg
Steinberg Consulting
L. Jalil
Verizon
J. Guichard
Futurewei
W. Henderickx
Nokia
February 22, 2021
BGP Color-Aware Routing Problem Statement
draft-dskc-bess-bgp-car-problem-statement-02
Abstract
This document explores the scope, use-cases and requirements for a
BGP based routing solution to establish end-to-end intent-aware paths
across a multi-domain service provider network environment.
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 August 26, 2021.
Rao, et al. Expires August 26, 2021 [Page 1]
Internet-Draft BGP CAR Problem Statement February 2021
Copyright Notice
Copyright (c) 2021 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. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1. Objective . . . . . . . . . . . . . . . . . . . . . . . . 3
1.2. State-of-the-art . . . . . . . . . . . . . . . . . . . . 4
1.2.1. Color . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2.2. Colored vs Color-Aware . . . . . . . . . . . . . . . 5
1.2.3. Per-Destination and Per-Flow Steering . . . . . . . . 6
1.3. Why a BGP-based alternative is needed . . . . . . . . . . 6
1.4. Color Domains . . . . . . . . . . . . . . . . . . . . . . 6
1.5. BGP Color-Aware Routing . . . . . . . . . . . . . . . . . 7
2. Intent bound to a Color . . . . . . . . . . . . . . . . . . . 7
3. BGP CAR Use-cases . . . . . . . . . . . . . . . . . . . . . . 7
3.1. BGP Transport CAR . . . . . . . . . . . . . . . . . . . . 7
3.1.1. Use-case of minimization of a cost metric vs a
latency metric . . . . . . . . . . . . . . . . . . . 9
3.1.2. Use-case of exclusion/inclusion of link affinity . . 10
3.1.3. Use-case of exclusion/inclusion of domains . . . . . 10
3.1.4. Use-case of virtual network function chains in local
and core domains . . . . . . . . . . . . . . . . . . 11
3.2. BGP VPN CAR . . . . . . . . . . . . . . . . . . . . . . . 12
3.2.1. Use-case of minimization of a cost metric vs a
latency metric . . . . . . . . . . . . . . . . . . . 15
3.2.2. Use-case of exclusion/inclusion of link affinity . . 16
3.2.3. Use-case of virtual network function chains in local
and core domains . . . . . . . . . . . . . . . . . . 17
4. Deployment Requirements . . . . . . . . . . . . . . . . . . . 18
5. Scalability . . . . . . . . . . . . . . . . . . . . . . . . . 19
5.1. Scale Requirements . . . . . . . . . . . . . . . . . . . 19
Show full document text