draft-ietf-idr-flow-spec-v6-07.txt   draft-ietf-idr-flow-spec-v6-08.txt 
IDR Working Group D. McPherson IDR Working Group D. McPherson
Internet-Draft Verisign, Inc. Internet-Draft Verisign, Inc.
Intended status: Standards Track R. Raszuk, Ed. Intended status: Standards Track R. Raszuk, Ed.
Expires: September 20, 2016 Bloomberg LP Expires: September 14, 2017 Bloomberg LP
B. Pithawala B. Pithawala
Individual Individual
A. Karch A. Karch
Cisco Systems Cisco Systems
S. Hares, Ed. S. Hares, Ed.
Huawei Huawei
March 19, 2016 March 13, 2017
Dissemination of Flow Specification Rules for IPv6 Dissemination of Flow Specification Rules for IPv6
draft-ietf-idr-flow-spec-v6-07.txt draft-ietf-idr-flow-spec-v6-08.txt
Abstract Abstract
Dissemination of Flow Specification Rules [RFC5575] provides a Dissemination of Flow Specification Rules [RFC5575] provides a
protocol extension for propagation of traffic flow information for protocol extension for propagation of traffic flow information for
the purpose of rate limiting or filtering. The [RFC5575] specifies the purpose of rate limiting or filtering. The [RFC5575] specifies
those extensions for IPv4 protocol data packets. those extensions for IPv4 protocol data packets.
This specification extends the current [RFC5575] and defines changes This specification extends the current [RFC5575] and defines changes
to the original document in order to make it also usable and to the original document in order to make it also usable and
skipping to change at page 1, line 44 skipping to change at page 1, line 44
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 September 20, 2016. This Internet-Draft will expire on September 14, 2017.
Copyright Notice Copyright Notice
Copyright (c) 2016 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
skipping to change at page 5, line 39 skipping to change at page 5, line 39
operator byte is encoded as specified in the component type 3 operator byte is encoded as specified in the component type 3
of [RFC5575]. Values are encoded as 1-, 2-, or 4- byte of [RFC5575]. Values are encoded as 1-, 2-, or 4- byte
quantities. quantities.
The following example demonstrates the new prefix encoding for: "all The following example demonstrates the new prefix encoding for: "all
packets to ::1234:5678:9A00:0/64-104 from 192::/8 and port {range packets to ::1234:5678:9A00:0/64-104 from 192::/8 and port {range
[137, 139] or 8080}". In the destination prefix, "80-" represents [137, 139] or 8080}". In the destination prefix, "80-" represents
the prefix offset of 80 bits. In this exmaple, the 0 offset is the prefix offset of 80 bits. In this exmaple, the 0 offset is
omitted from the printed source prefix. omitted from the printed source prefix.
+---------------------------+-------------+-------------------------+ +-------------------------+------------+-----------------------+
| destination | source | port | | destination | source | port |
+---------------------------+-------------+-------------------------+ +-------------------------+----------- +-----------------------+
| 0x01 68 50 12 34 56 78 9A | 02 00 08 c0 | 04 03 89 45 8b 91 1f 90 | |0x01 68 50 12 34 56 78 9A| 02 00 08 c0|04 03 89 45 8b 91 1f 90|
+---------------------------+-------------+-------------------------+ +-------------------------+------------+-----------------------+
3.1. Order of Traffic Filtering Rules 3.1. Order of Traffic Filtering Rules
The orignal definition for the order of traffic filtering rules can The orignal definition for the order of traffic filtering rules can
be reused with new consideration for the IPv6 prefix offset. As long be reused with new consideration for the IPv6 prefix offset. As long
as the offsets are equal, the comparison is the same, retaining as the offsets are equal, the comparison is the same, retaining
longest-prefix-match semantics. If the offsets are not equal, the longest-prefix-match semantics. If the offsets are not equal, the
lowest offset has precedence, as this flow matches the most lowest offset has precedence, as this flow matches the most
significant bit. significant bit.
Pseudocode: Pseudocode
flow_rule_v6_cmp (a, b)
flow_rule_v6_cmp (a, b) {
{ comp1 = next_component(a);
comp1 = next_component(a); comp2 = next_component(b);
comp2 = next_component(b); while (comp1 || comp2) {
while (comp1 || comp2) { // component_type returns infinity on end-of-list
// component_type returns infinity on end-of-list if (component_type(comp1) < component_type(comp2)) {
if (component_type(comp1) < component_type(comp2)) { return A_HAS_PRECEDENCE;
return A_HAS_PRECEDENCE; }
} if (component_type(comp1) > component_type(comp2)) {
if (component_type(comp1) > component_type(comp2)) { return B_HAS_PRECEDENCE;
return B_HAS_PRECEDENCE; }
}
if (component_type(comp1) == IPV6_DESTINATION || IPV6_SOURCE) { if (component_type(comp1) == IPV6_DESTINATION || IPV6_SOURCE) {
// offset not equal, lowest offset has precedence // offset not equal, lowest offset has precedence
// offset equal ... // offset equal ...
common_len = MIN(prefix_length(comp1), prefix_length(comp2)); common_len = MIN(prefix_length(comp1), prefix_length(comp2));
cmp = prefix_compare(comp1, comp2, offset, common_len); cmp = prefix_compare(comp1, comp2, offset, common_len);
// not equal, lowest value has precedence // not equal, lowest value has precedence
// equal, longest match has precedence // equal, longest match has precedence
} else { } else {
common = common =
MIN(component_length(comp1), component_length(comp2)); MIN(component_length(comp1), component_length(comp2));
cmp = memcmp(data(comp1), data(comp2), common); cmp = memcmp(data(comp1), data(comp2), common);
// not equal, lowest value has precedence // not equal, lowest value has precedence
// equal, longest string has precedence // equal, longest string has precedence
} }
} }
return EQUAL; return EQUAL;
} }
4. IPv6 Flow Specification Traffic Filtering Action changes 4. IPv6 Flow Specification Traffic Filtering Action changes
One of the traffic filtering actions which can be expressed by BGP One of the traffic filtering actions which can be expressed by BGP
extended community is defined in [RFC5575] as traffic-marking. extended community is defined in [RFC5575] as traffic-marking.
Another traffic filtering action defined in [RFC5575] as a BGP Another traffic filtering action defined in [RFC5575] as a BGP
extended community is redirect. To allow an IPv6 address specific extended community is redirect. To allow an IPv6 address specific
route-target, a new traffic action IPv6 address specific extended route-target, a new traffic action IPv6 address specific extended
community is provided. community is provided.
 End of changes. 9 change blocks. 
40 lines changed or deleted 39 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/