Circuit Breaker Assisted Congestion Control
draft-ietf-mboned-cbacc-02
Mboned J. Holland
Internet-Draft Akamai Technologies, Inc.
Intended status: Standards Track February 01, 2021
Expires: August 5, 2021
Circuit Breaker Assisted Congestion Control
draft-ietf-mboned-cbacc-02
Abstract
This document specifies Circuit Breaker Assisted Congestion Control
(CBACC). CBACC enables fast-trip Circuit Breakers by publishing rate
metadata about multicast channels from senders to intermediate
network nodes or receivers. The circuit breaker behavior is defined
as a supplement to receiver driven congestion control systems, to
preserve network health if misbehaving or malicious receiver
applications subscribe to a volume of traffic that exceeds capacity
policies or capability for a network or receiving device.
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 5, 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
Holland Expires August 5, 2021 [Page 1]
Internet-Draft CBACC February 2021
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 . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1. Background and Terminology . . . . . . . . . . . . . . . 4
1.2. Venues for Contribution and Discussion . . . . . . . . . 4
1.3. Non-obvious doc choices . . . . . . . . . . . . . . . . . 4
2. Circuit Breaker Behavior . . . . . . . . . . . . . . . . . . 5
2.1. Functional Components . . . . . . . . . . . . . . . . . . 5
2.1.1. Bitrate Advertisement . . . . . . . . . . . . . . . . 5
2.1.2. Circuit Breaker Node . . . . . . . . . . . . . . . . 5
2.1.3. Communication Method . . . . . . . . . . . . . . . . 6
2.1.4. Measurement Function . . . . . . . . . . . . . . . . 6
2.1.5. Trigger Function . . . . . . . . . . . . . . . . . . 7
2.1.6. Reaction . . . . . . . . . . . . . . . . . . . . . . 8
2.1.7. Feedback Control Mechanism . . . . . . . . . . . . . 9
2.2. States . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.2.1. Interface State . . . . . . . . . . . . . . . . . . . 10
2.2.2. Flow State . . . . . . . . . . . . . . . . . . . . . 10
2.3. Implementation Design Considerations . . . . . . . . . . 11
2.3.1. Oversubscription Thresholds . . . . . . . . . . . . . 11
2.3.2. Fairness Functions . . . . . . . . . . . . . . . . . 11
3. YANG Module . . . . . . . . . . . . . . . . . . . . . . . . . 11
3.1. Tree Diagram . . . . . . . . . . . . . . . . . . . . . . 11
3.2. Module . . . . . . . . . . . . . . . . . . . . . . . . . 11
4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 13
4.1. YANG Module Names Registry . . . . . . . . . . . . . . . 13
4.2. The XML Registry . . . . . . . . . . . . . . . . . . . . 14
5. Security Considerations . . . . . . . . . . . . . . . . . . . 14
5.1. Metadata Security . . . . . . . . . . . . . . . . . . . . 14
5.2. Denial of Service . . . . . . . . . . . . . . . . . . . . 14
5.2.1. State Overload . . . . . . . . . . . . . . . . . . . 14
6. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 14
7. References . . . . . . . . . . . . . . . . . . . . . . . . . 15
7.1. Normative References . . . . . . . . . . . . . . . . . . 15
7.2. Informative References . . . . . . . . . . . . . . . . . 15
Appendix A. Overjoining . . . . . . . . . . . . . . . . . . . . 17
Author's Address . . . . . . . . . . . . . . . . . . . . . . . . 18
Show full document text