draft-ietf-dime-doic-rate-control-05.txt   draft-ietf-dime-doic-rate-control-06.txt 
Diameter Maintenance and Extensions (DIME) S. Donovan, Ed. Diameter Maintenance and Extensions (DIME) S. Donovan, Ed.
Internet-Draft Oracle Internet-Draft Oracle
Intended status: Standards Track E. Noel Intended status: Standards Track E. Noel
Expires: August 20, 2017 AT&T Labs Expires: September 28, 2017 AT&T Labs
February 16, 2017 March 27, 2017
Diameter Overload Rate Control Diameter Overload Rate Control
draft-ietf-dime-doic-rate-control-05.txt draft-ietf-dime-doic-rate-control-06.txt
Abstract Abstract
This specification documents an extension to the Diameter Overload This specification documents an extension to the Diameter Overload
Indication Conveyance (DOIC) [RFC7683] base solution. This extension Indication Conveyance (DOIC) [RFC7683] base solution. This extension
adds a new overload control abatement algorithm. This abatement adds a new overload control abatement algorithm. This abatement
algorithm allows for a DOIC reporting node to specify a maximum rate algorithm allows for a DOIC reporting node to specify a maximum rate
at which a DOIC reacting node sends Diameter requests to the DOIC at which a DOIC reacting node sends Diameter requests to the DOIC
reporting node. reporting node.
skipping to change at page 1, line 42 skipping to change at page 1, line 42
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on August 20, 2017. This Internet-Draft will expire on September 28, 2017.
Copyright Notice Copyright Notice
Copyright (c) 2017 IETF Trust and the persons identified as the Copyright (c) 2017 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License. described in the Simplified BSD License.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Terminology and Abbreviations . . . . . . . . . . . . . . . . 4 2. Terminology and Abbreviations . . . . . . . . . . . . . . . . 4
3. Interaction with DOIC report types . . . . . . . . . . . . . 5 3. Interaction with DOIC Report Rypes . . . . . . . . . . . . . 5
4. Capability Announcement . . . . . . . . . . . . . . . . . . . 5 4. Capability Announcement . . . . . . . . . . . . . . . . . . . 5
5. Overload Report Handling . . . . . . . . . . . . . . . . . . 6 5. Overload Report Handling . . . . . . . . . . . . . . . . . . 6
5.1. Reporting Node Overload Control State . . . . . . . . . . 6 5.1. Reporting Node Overload Control State . . . . . . . . . . 6
5.2. Reacting Node Overload Control State . . . . . . . . . . 6 5.2. Reacting Node Overload Control State . . . . . . . . . . 6
5.3. Reporting Node Maintenance of Overload Control State . . 7 5.3. Reporting Node Maintenance of Overload Control State . . 7
5.4. Reacting Node Maintenance of Overload Control State . . . 7 5.4. Reacting Node Maintenance of Overload Control State . . . 7
5.5. Reporting Node Behavior for Rate Abatement Algorithm . . 7 5.5. Reporting Node Behavior for Rate Abatement Algorithm . . 7
5.6. Reacting Node Behavior for Rate Abatement Algorithm . . . 8 5.6. Reacting Node Behavior for Rate Abatement Algorithm . . . 8
6. Rate Abatement Algorithm AVPs . . . . . . . . . . . . . . . . 8 6. Rate Abatement Algorithm AVPs . . . . . . . . . . . . . . . . 8
6.1. OC-Supported-Features AVP . . . . . . . . . . . . . . . . 8 6.1. OC-Supported-Features AVP . . . . . . . . . . . . . . . . 8
6.1.1. OC-Feature-Vector AVP . . . . . . . . . . . . . . . . 8 6.1.1. OC-Feature-Vector AVP . . . . . . . . . . . . . . . . 8
6.2. OC-OLR AVP . . . . . . . . . . . . . . . . . . . . . . . 9 6.2. OC-OLR AVP . . . . . . . . . . . . . . . . . . . . . . . 9
6.2.1. OC-Maximum-Rate AVP . . . . . . . . . . . . . . . . . 9 6.2.1. OC-Maximum-Rate AVP . . . . . . . . . . . . . . . . . 9
6.3. Attribute Value Pair flag rules . . . . . . . . . . . . . 9 6.3. Attribute Value Pair Flag Rules . . . . . . . . . . . . . 9
7. Rate Based Abatement Algorithm . . . . . . . . . . . . . . . 10 7. Rate Based Abatement Algorithm . . . . . . . . . . . . . . . 10
7.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . 10 7.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . 10
7.2. Reporting Node Behavior . . . . . . . . . . . . . . . . . 10 7.2. Reporting Node Behavior . . . . . . . . . . . . . . . . . 10
7.3. Reacting Node Behavior . . . . . . . . . . . . . . . . . 11 7.3. Reacting Node Behavior . . . . . . . . . . . . . . . . . 11
7.3.1. Default Algorithm . . . . . . . . . . . . . . . . . . 11 7.3.1. Default Algorithm . . . . . . . . . . . . . . . . . . 11
7.3.2. Priority Treatment . . . . . . . . . . . . . . . . . 14 7.3.2. Priority Treatment . . . . . . . . . . . . . . . . . 14
7.3.3. Optional Enhancement: Avoidance of Resonance . . . . 16 7.3.3. Optional Enhancement: Avoidance of Resonance . . . . 16
8. IANA Consideration . . . . . . . . . . . . . . . . . . . . . 17 8. IANA Consideration . . . . . . . . . . . . . . . . . . . . . 17
8.1. AVP codes . . . . . . . . . . . . . . . . . . . . . . . . 17 8.1. AVP Codes . . . . . . . . . . . . . . . . . . . . . . . . 17
8.2. New registries . . . . . . . . . . . . . . . . . . . . . 17 8.2. New Registries . . . . . . . . . . . . . . . . . . . . . 17
9. Security Considerations . . . . . . . . . . . . . . . . . . . 17 9. Security Considerations . . . . . . . . . . . . . . . . . . . 17
10. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 18 10. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 18
11. References . . . . . . . . . . . . . . . . . . . . . . . . . 18 11. References . . . . . . . . . . . . . . . . . . . . . . . . . 18
11.1. Normative References . . . . . . . . . . . . . . . . . . 18 11.1. Normative References . . . . . . . . . . . . . . . . . . 18
11.2. Informative References . . . . . . . . . . . . . . . . . 18 11.2. Informative References . . . . . . . . . . . . . . . . . 18
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 18 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 18
1. Introduction 1. Introduction
This document defines a new Diameter overload control abatement This document defines a new Diameter overload control abatement
skipping to change at page 5, line 5 skipping to change at page 5, line 5
[RFC7683]. [RFC7683].
Reporting Node Reporting Node
A DOIC Node that sends a DOIC overload report. A DOIC Node that sends a DOIC overload report.
Reacting Node Reacting Node
A DOIC Node that receives and acts on a DOIC overload report. A DOIC Node that receives and acts on a DOIC overload report.
3. Interaction with DOIC report types 3. Interaction with DOIC Report Rypes
As of the publication of this specification there are two DOIC report As of the publication of this specification there are two DOIC report
types defined with the specification of a third in progress: types defined with the specification of a third in progress:
1. Host - Overload of a specific Diameter Application at a specific 1. Host - Overload of a specific Diameter Application at a specific
Diameter Node as defined in [RFC7683]. Diameter Node as defined in [RFC7683].
2. Realm - Overload of a specific Diameter Application at a specific 2. Realm - Overload of a specific Diameter Application at a specific
Diameter Realm as defined in [RFC7683]. Diameter Realm as defined in [RFC7683].
skipping to change at page 9, line 36 skipping to change at page 9, line 36
algorithm. algorithm.
6.2.1. OC-Maximum-Rate AVP 6.2.1. OC-Maximum-Rate AVP
The OC-Maximum-Rate AVP (AVP code TBD1) is of type Unsigned32 and The OC-Maximum-Rate AVP (AVP code TBD1) is of type Unsigned32 and
describes the maximum rate that the sender is requested to send describes the maximum rate that the sender is requested to send
traffic. This is specified in terms of requests per second. traffic. This is specified in terms of requests per second.
A value of zero indicates that no traffic is to be sent. A value of zero indicates that no traffic is to be sent.
6.3. Attribute Value Pair flag rules 6.3. Attribute Value Pair Flag Rules
+---------+ +---------+
|AVP flag | |AVP flag |
|rules | |rules |
+----+----+ +----+----+
AVP Section | |MUST| AVP Section | |MUST|
Attribute Name Code Defined Value Type |MUST| NOT| Attribute Name Code Defined Value Type |MUST| NOT|
+---------------------------------------------------------+----+----+ +---------------------------------------------------------+----+----+
|OC-Maximum-Rate TBD1 6.2 Unsigned32 | | V | |OC-Maximum-Rate TBD1 6.2 Unsigned32 | | V |
+---------------------------------------------------------+----+----+ +---------------------------------------------------------+----+----+
skipping to change at page 10, line 16 skipping to change at page 10, line 16
This section is pulled from [RFC7415], with minor changes needed to This section is pulled from [RFC7415], with minor changes needed to
make it apply to the Diameter protocol. make it apply to the Diameter protocol.
7.1. Overview 7.1. Overview
The reporting node is the one protected by the overload control The reporting node is the one protected by the overload control
algorithm defined here. The reacting node is the one that abates algorithm defined here. The reacting node is the one that abates
traffic towards the server. traffic towards the server.
Following the procedures defined in [draft-ietf-dime-doic], the Following the procedures defined in [RFC7683], the reacting node and
reacting node and reporting node signal one another support for rate- reporting node signal one another support for rate-based overload
based overload control. control.
Then periodically, the reporting node relies on internal measurements Then periodically, the reporting node relies on internal measurements
(e.g. CPU utilization or queuing delay) to evaluate its overload (e.g. CPU utilization or queuing delay) to evaluate its overload
state and estimate a target maximum Diameter request rate in number state and estimate a target maximum Diameter request rate in number
of requests per second (as opposed to target percent reduction in the of requests per second (as opposed to target percent reduction in the
case of loss-based abatement). case of loss-based abatement).
When in an overloaded state, the reporting node uses the OC-OLR AVP When in an overloaded state, the reporting node uses the OC-OLR AVP
to inform reacting nodes of its overload state and of the target to inform reacting nodes of its overload state and of the target
Diameter request rate. Diameter request rate.
skipping to change at page 17, line 37 skipping to change at page 17, line 37
minimum time between admissions is uniformly distributed over minimum time between admissions is uniformly distributed over
[T/2, 3T/2], and the mean time between admissions is the same, [T/2, 3T/2], and the mean time between admissions is the same,
i.e. T+1/R where R is the request arrival rate. i.e. T+1/R where R is the request arrival rate.
o At high load randomization rarely occurs, so there is no loss of o At high load randomization rarely occurs, so there is no loss of
precision of the admitted rate, even though the randomized precision of the admitted rate, even though the randomized
'phasing' of the buckets remains. 'phasing' of the buckets remains.
8. IANA Consideration 8. IANA Consideration
8.1. AVP codes 8.1. AVP Codes
New AVPs defined by this specification are listed in Section 6. All New AVPs defined by this specification are listed in Section 6. All
AVP codes are allocated from the 'Authentication, Authorization, and AVP codes are allocated from the 'Authentication, Authorization, and
Accounting (AAA) Parameters' AVP Codes registry. Accounting (AAA) Parameters' AVP Codes registry.
8.2. New registries 8.2. New Registries
There are no new IANA registries introduced by this document. There are no new IANA registries introduced by this document.
9. Security Considerations 9. Security Considerations
The rate overload abatement mechanism is an extension to the base The rate overload abatement mechanism is an extension to the base
Diameter overload mechanism. As such, all of the security Diameter overload mechanism. As such, all of the security
considerations outlined in [RFC7683] apply to the rate overload considerations outlined in [RFC7683] apply to the rate overload
abatement mechanism. abatement mechanism.
 End of changes. 11 change blocks. 
15 lines changed or deleted 15 lines changed or added

This html diff was produced by rfcdiff 1.45. The latest version is available from http://tools.ietf.org/tools/rfcdiff/