draft-ietf-tsvwg-rfc4960-errata-08.txt   rfc8540.txt 
Network Working Group R. Stewart Internet Engineering Task Force (IETF) R. Stewart
Internet-Draft Netflix, Inc. Request for Comments: 8540 Netflix, Inc.
Intended status: Informational M. Tuexen Category: Informational M. Tuexen
Expires: April 25, 2019 Muenster Univ. of Appl. Sciences ISSN: 2070-1721 Muenster Univ. of Appl. Sciences
M. Proshin M. Proshin
Ericsson Ericsson
October 22, 2018 February 2019
RFC 4960 Errata and Issues Stream Control Transmission Protocol:
draft-ietf-tsvwg-rfc4960-errata-08.txt Errata and Issues in RFC 4960
Abstract Abstract
This document is a compilation of issues found since the publication This document is a compilation of issues found since the publication
of RFC4960 in September 2007 based on experience with implementing, of RFC 4960 in September 2007, based on experience with implementing,
testing, and using SCTP along with the suggested fixes. This testing, and using the Stream Control Transmission Protocol (SCTP)
document provides deltas to RFC4960 and is organized in a time along with the suggested fixes. This document provides deltas to RFC
ordered way. The issues are listed in the order they were brought 4960 and is organized in a time-ordered way. The issues are listed
up. Because some text is changed several times the last delta in the in the order in which they were brought up. Because some text is
text is the one which should be applied. In addition to the delta a changed several times, the last delta in the text is the one that
description of the problem and the details of the solution are also should be applied. In addition to the deltas, a description of each
provided. problem and the details of the solution for each are also provided.
Status of This Memo Status of This Memo
This Internet-Draft is submitted in full conformance with the This document is not an Internet Standards Track specification; it is
provisions of BCP 78 and BCP 79. published for informational purposes.
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 This document is a product of the Internet Engineering Task Force
and may be updated, replaced, or obsoleted by other documents at any (IETF). It represents the consensus of the IETF community. It has
time. It is inappropriate to use Internet-Drafts as reference received public review and has been approved for publication by the
material or to cite them other than as "work in progress." Internet Engineering Steering Group (IESG). Not all documents
approved by the IESG are candidates for any level of Internet
Standard; see Section 2 of RFC 7841.
This Internet-Draft will expire on April 25, 2019. Information about the current status of this document, any errata,
and how to provide feedback on it may be obtained at
https://www.rfc-editor.org/info/rfc8540.
Copyright Notice Copyright Notice
Copyright (c) 2018 IETF Trust and the persons identified as the Copyright (c) 2019 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
(https://trustee.ietf.org/license-info) in effect on the date of (https://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. Conventions . . . . . . . . . . . . . . . . . . . . . . . . . 4 2. Conventions . . . . . . . . . . . . . . . . . . . . . . . . . 4
3. Corrections to RFC 4960 . . . . . . . . . . . . . . . . . . . 4 3. Corrections to RFC 4960 . . . . . . . . . . . . . . . . . . . 4
3.1. Path Error Counter Threshold Handling . . . . . . . . . . 4 3.1. Path Error Counter Threshold Handling . . . . . . . . . . 4
3.2. Upper Layer Protocol Shutdown Request Handling . . . . . 5 3.2. Upper-Layer Protocol Shutdown Request Handling . . . . . 5
3.3. Registration of New Chunk Types . . . . . . . . . . . . . 6 3.3. Registration of New Chunk Types . . . . . . . . . . . . . 6
3.4. Variable Parameters for INIT Chunks . . . . . . . . . . . 7 3.4. Variable Parameters for INIT Chunks . . . . . . . . . . . 7
3.5. CRC32c Sample Code on 64-bit Platforms . . . . . . . . . 8 3.5. CRC32c Sample Code on 64-Bit Platforms . . . . . . . . . 8
3.6. Endpoint Failure Detection . . . . . . . . . . . . . . . 9 3.6. Endpoint Failure Detection . . . . . . . . . . . . . . . 9
3.7. Data Transmission Rules . . . . . . . . . . . . . . . . . 10 3.7. Data Transmission Rules . . . . . . . . . . . . . . . . . 10
3.8. T1-Cookie Timer . . . . . . . . . . . . . . . . . . . . . 11 3.8. T1-Cookie Timer . . . . . . . . . . . . . . . . . . . . . 11
3.9. Miscellaneous Typos . . . . . . . . . . . . . . . . . . . 12 3.9. Miscellaneous Typos . . . . . . . . . . . . . . . . . . . 12
3.10. CRC32c Sample Code . . . . . . . . . . . . . . . . . . . 19 3.10. CRC32c Sample Code . . . . . . . . . . . . . . . . . . . 19
3.11. partial_bytes_acked after T3-rtx Expiration . . . . . . . 20 3.11. partial_bytes_acked after T3-rtx Expiration . . . . . . . 19
3.12. Order of Adjustments of partial_bytes_acked and cwnd . . 21 3.12. Order of Adjustments of partial_bytes_acked and cwnd . . 20
3.13. HEARTBEAT ACK and the association error counter . . . . . 22 3.13. HEARTBEAT ACK and the Association Error Counter . . . . . 21
3.14. Path for Fast Retransmission . . . . . . . . . . . . . . 23 3.14. Path for Fast Retransmission . . . . . . . . . . . . . . 22
3.15. Transmittal in Fast Recovery . . . . . . . . . . . . . . 24 3.15. Transmittal in Fast Recovery . . . . . . . . . . . . . . 23
3.16. Initial Value of ssthresh . . . . . . . . . . . . . . . . 25 3.16. Initial Value of ssthresh . . . . . . . . . . . . . . . . 24
3.17. Automatically Confirmed Addresses . . . . . . . . . . . . 26 3.17. Automatically CONFIRMED Addresses . . . . . . . . . . . . 25
3.18. Only One Packet after Retransmission Timeout . . . . . . 27 3.18. Only One Packet after Retransmission Timeout . . . . . . 26
3.19. INIT ACK Path for INIT in COOKIE-WAIT State . . . . . . . 28 3.19. INIT ACK Path for INIT in COOKIE-WAIT State . . . . . . . 27
3.20. Zero Window Probing and Unreachable Primary Path . . . . 29 3.20. Zero Window Probing and Unreachable Primary Path . . . . 28
3.21. Normative Language in Section 10 . . . . . . . . . . . . 30 3.21. Normative Language in Section 10 of RFC 4960 . . . . . . 29
3.22. Increase of partial_bytes_acked in Congestion Avoidance . 33 3.22. Increase of partial_bytes_acked in Congestion Avoidance . 32
3.23. Inconsistency in Notifications Handling . . . . . . . . . 34 3.23. Inconsistent Handling of Notifications . . . . . . . . . 33
3.24. SACK.Delay Not Listed as a Protocol Parameter . . . . . . 40 3.24. SACK.Delay Not Listed as a Protocol Parameter . . . . . . 37
3.25. Processing of Chunks in an Incoming SCTP Packet . . . . . 42 3.25. Processing of Chunks in an Incoming SCTP Packet . . . . . 39
3.26. CWND Increase in Congestion Avoidance Phase . . . . . . . 43 3.26. Increasing the cwnd in the Congestion Avoidance Phase . . 41
3.27. Refresh of cwnd and ssthresh after Idle Period . . . . . 46 3.27. Refresh of cwnd and ssthresh after Idle Period . . . . . 43
3.28. Window Updates After Receiver Window Opens Up . . . . . . 47 3.28. Window Updates after Receiver Window Opens Up . . . . . . 45
3.29. Path of DATA and Reply Chunks . . . . . . . . . . . . . . 48 3.29. Path of DATA and Reply Chunks . . . . . . . . . . . . . . 46
3.30. Outstanding Data, Flightsize and Data In Flight Key Terms 50 3.30. "Outstanding Data", "Flightsize", and "Data in Flight"
3.31. CWND Degradation due to Max.Burst . . . . . . . . . . . . 52 Key Terms . . . . . . . . . . . . . . . . . . . . . . . . 47
3.32. Reduction of RTO.Initial . . . . . . . . . . . . . . . . 53 3.31. Degradation of cwnd due to Max.Burst . . . . . . . . . . 49
3.33. Ordering of Bundled SACK and ERROR Chunks . . . . . . . . 55 3.32. Reduction of RTO.Initial . . . . . . . . . . . . . . . . 50
3.34. Undefined Parameter Returned by RECEIVE Primitive . . . . 56 3.33. Ordering of Bundled SACK and ERROR Chunks . . . . . . . . 51
3.35. DSCP Changes . . . . . . . . . . . . . . . . . . . . . . 57 3.34. Undefined Parameter Returned by RECEIVE Primitive . . . . 52
3.36. Inconsistent Handling of ICMPv4 and ICMPv6 Messages . . . 58 3.35. DSCP Changes . . . . . . . . . . . . . . . . . . . . . . 53
3.37. Handling of Soft Errors . . . . . . . . . . . . . . . . . 60 3.36. Inconsistent Handling of ICMPv4 and ICMPv6 Messages . . . 55
3.38. Honoring CWND . . . . . . . . . . . . . . . . . . . . . . 60 3.37. Handling of Soft Errors . . . . . . . . . . . . . . . . . 56
3.39. Zero Window Probing . . . . . . . . . . . . . . . . . . . 62 3.38. Honoring cwnd . . . . . . . . . . . . . . . . . . . . . . 57
3.40. Updating References Regarding ECN . . . . . . . . . . . . 64 3.39. Zero Window Probing . . . . . . . . . . . . . . . . . . . 58
3.41. Host Name Address Parameter Deprecated . . . . . . . . . 66 3.40. Updating References regarding ECN . . . . . . . . . . . . 60
3.42. Conflicting Text Regarding the Supported Address Types 3.41. Host Name Address Parameter Deprecated . . . . . . . . . 62
Parameter . . . . . . . . . . . . . . . . . . . . . . . . 70 3.42. Conflicting Text regarding the 'Supported Address Types'
3.43. Integration of RFC 6096 . . . . . . . . . . . . . . . . . 71 Parameter . . . . . . . . . . . . . . . . . . . . . . . . 66
3.44. Integration of RFC 6335 . . . . . . . . . . . . . . . . . 73 3.43. Integration of RFC 6096 . . . . . . . . . . . . . . . . . 67
3.45. Integration of RFC 7053 . . . . . . . . . . . . . . . . . 75 3.44. Integration of RFC 6335 . . . . . . . . . . . . . . . . . 70
3.46. CRC32c Code Improvements . . . . . . . . . . . . . . . . 79 3.45. Integration of RFC 7053 . . . . . . . . . . . . . . . . . 72
3.47. Clarification of Gap Ack Blocks in SACK Chunks . . . . . 89 3.46. CRC32c Code Improvements . . . . . . . . . . . . . . . . 76
3.48. Handling of SSN Wrap Arounds . . . . . . . . . . . . . . 91 3.47. Clarification of Gap Ack Blocks in SACK Chunks . . . . . 87
3.49. Update RFC 2119 Boilerplate . . . . . . . . . . . . . . . 92 3.48. Handling of SSN Wraparounds . . . . . . . . . . . . . . . 89
3.50. Missed Text Removal . . . . . . . . . . . . . . . . . . . 93 3.49. Update to RFC 2119 Boilerplate Text . . . . . . . . . . . 90
4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 94 3.50. Removal of Text (Previously Missed in RFC 4960) . . . . . 91
5. Security Considerations . . . . . . . . . . . . . . . . . . . 94 4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 91
6. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 94 5. Security Considerations . . . . . . . . . . . . . . . . . . . 92
7. References . . . . . . . . . . . . . . . . . . . . . . . . . 95 6. References . . . . . . . . . . . . . . . . . . . . . . . . . 92
7.1. Normative References . . . . . . . . . . . . . . . . . . 95 6.1. Normative References . . . . . . . . . . . . . . . . . . 92
7.2. Informative References . . . . . . . . . . . . . . . . . 95 6.2. Informative References . . . . . . . . . . . . . . . . . 92
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 96 Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . 94
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 94
1. Introduction 1. Introduction
This document contains a compilation of all defects found up until This document contains a compilation of all defects for [RFC4960]
the publication of this document for [RFC4960] specifying the Stream ("Stream Control Transmission Protocol") that were found up until the
Control Transmission Protocol (SCTP). These defects may be of an publication of this document. These defects may be of an editorial
editorial or technical nature. This document may be thought of as a or technical nature. This document may be thought of as a companion
companion document to be used in the implementation of SCTP to document to be used in the implementation of the Stream Control
clarify errors in the original SCTP document. Transmission Protocol (SCTP) to clarify errors in the original SCTP
document.
This document provides a history of the changes that will be compiled This document provides a history of the changes that will be compiled
into a BIS document for [RFC4960]. It is structured similar to into a bis document for [RFC4960]. It is structured similarly to
[RFC4460]. [RFC4460].
Each error will be detailed within this document in the form of: Each error will be detailed within this document in the form of:
o The problem description, o The problem description,
o The text quoted from [RFC4960], o The text quoted from [RFC4960],
o The replacement text that should be placed into an upcoming BIS
document, o The replacement text that should be placed into an upcoming bis
document, and
o A description of the solution. o A description of the solution.
Note that when reading this document one must use care to assure that Note that when reading this document one must use care to ensure that
a field or item is not updated further on within the document. Since a field or item is not updated later on within the document. Since
this document is a historical record of the sequential changes that this document is a historical record of the sequential changes that
have been found necessary at various inter-op events and through have been found necessary at various interop events and through
discussion on the list, the last delta in the text is the one which discussion on the Transport Area Working Group mailing list, the last
should be applied. delta in the text is the one that should be applied.
2. Conventions 2. Conventions
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
"OPTIONAL" in this document are to be interpreted as described in "OPTIONAL" in this document are to be interpreted as described in
BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all
capitals, as shown here. capitals, as shown here.
3. Corrections to RFC 4960 3. Corrections to RFC 4960
[NOTE to RFC-Editor:
References to obsoleted RFCs are in OLD TEXT sections and have the
corresponding references to the obsoleting RFCs in the NEW TEXT
sections. In addition to this, there are some references to the
obsoleted [RFC2960], which are intended.
]
3.1. Path Error Counter Threshold Handling 3.1. Path Error Counter Threshold Handling
3.1.1. Description of the Problem 3.1.1. Description of the Problem
The handling of the 'Path.Max.Retrans' parameter is described in The handling of the 'Path.Max.Retrans' parameter is described in
Section 8.2 and Section 8.3 of [RFC4960] in an inconsistent way. Sections 8.2 and 8.3 of [RFC4960] in an inconsistent way. Whereas
Whereas Section 8.2 describes that a path is marked inactive when the Section 8.2 of [RFC4960] says that a path is marked inactive when the
path error counter exceeds the threshold, Section 8.3 says the path path error counter exceeds the threshold, Section 8.3 of [RFC4960]
is marked inactive when the path error counter reaches the threshold. says that the path is marked inactive when the path error counter
reaches the threshold.
This issue was reported as an Errata for [RFC4960] with Errata ID This issue was reported as an errata for [RFC4960] with
1440. Errata ID 1440.
3.1.2. Text Changes to the Document 3.1.2. Text Changes to the Document
--------- ---------
Old text: (Section 8.3) Old text: (Section 8.3)
--------- ---------
When the value of this counter reaches the protocol parameter When the value of this counter reaches the protocol parameter
'Path.Max.Retrans', the endpoint should mark the corresponding 'Path.Max.Retrans', the endpoint should mark the corresponding
destination address as inactive if it is not so marked, and may also destination address as inactive if it is not so marked, and may also
optionally report to the upper layer the change of reachability of optionally report to the upper layer the change of reachability of
this destination address. After this, the endpoint should continue this destination address. After this, the endpoint should continue
HEARTBEAT on this destination address but should stop increasing the HEARTBEAT on this destination address but should stop increasing the
skipping to change at page 5, line 22 skipping to change at page 5, line 25
this destination address. After this, the endpoint should continue this destination address. After this, the endpoint should continue
HEARTBEAT on this destination address but should stop increasing the HEARTBEAT on this destination address but should stop increasing the
counter. counter.
--------- ---------
New text: (Section 8.3) New text: (Section 8.3)
--------- ---------
When the value of this counter exceeds the protocol parameter When the value of this counter exceeds the protocol parameter
'Path.Max.Retrans', the endpoint SHOULD mark the corresponding 'Path.Max.Retrans', the endpoint SHOULD mark the corresponding
destination address as inactive if it is not so marked, and MAY also destination address as inactive if it is not so marked and MAY also
optionally report to the upper layer the change of reachability of optionally report to the upper layer the change in reachability of
this destination address. After this, the endpoint SHOULD continue this destination address. After this, the endpoint SHOULD continue
HEARTBEAT on this destination address but SHOULD stop increasing the HEARTBEAT on this destination address but SHOULD stop increasing the
counter. counter.
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.23. updated in Section 3.23.
3.1.3. Solution Description 3.1.3. Solution Description
The intended state change should happen when the threshold is The intended state change should happen when the threshold is
exceeded. exceeded.
3.2. Upper Layer Protocol Shutdown Request Handling 3.2. Upper-Layer Protocol Shutdown Request Handling
3.2.1. Description of the Problem 3.2.1. Description of the Problem
Section 9.2 of [RFC4960] describes the handling of received SHUTDOWN Section 9.2 of [RFC4960] describes the handling of received SHUTDOWN
chunks in the SHUTDOWN-RECEIVED state instead of the handling of chunks in the SHUTDOWN-RECEIVED state instead of the handling of
shutdown requests from its upper layer in this state. shutdown requests from its upper layer in this state.
This issue was reported as an Errata for [RFC4960] with Errata ID This issue was reported as an errata for [RFC4960] with
1574. Errata ID 1574.
3.2.2. Text Changes to the Document 3.2.2. Text Changes to the Document
--------- ---------
Old text: (Section 9.2) Old text: (Section 9.2)
--------- ---------
Once an endpoint has reached the SHUTDOWN-RECEIVED state, it MUST NOT Once an endpoint has reached the SHUTDOWN-RECEIVED state, it MUST NOT
send a SHUTDOWN in response to a ULP request, and should discard send a SHUTDOWN in response to a ULP request, and should discard
subsequent SHUTDOWN chunks. subsequent SHUTDOWN chunks.
--------- ---------
New text: (Section 9.2) New text: (Section 9.2)
skipping to change at page 6, line 17 skipping to change at page 6, line 20
Once an endpoint has reached the SHUTDOWN-RECEIVED state, it MUST NOT Once an endpoint has reached the SHUTDOWN-RECEIVED state, it MUST NOT
send a SHUTDOWN in response to a ULP request, and should discard send a SHUTDOWN in response to a ULP request, and should discard
subsequent SHUTDOWN chunks. subsequent SHUTDOWN chunks.
--------- ---------
New text: (Section 9.2) New text: (Section 9.2)
--------- ---------
Once an endpoint has reached the SHUTDOWN-RECEIVED state, it MUST Once an endpoint has reached the SHUTDOWN-RECEIVED state, it MUST
ignore ULP shutdown requests, but MUST continue responding ignore ULP shutdown requests but MUST continue responding to SHUTDOWN
to SHUTDOWN chunks from its peer. chunks from its peer.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.2.3. Solution Description 3.2.3. Solution Description
The text never intended the SCTP endpoint to ignore SHUTDOWN chunks The text never intended that the SCTP endpoint ignore SHUTDOWN chunks
from its peer. If it did, the endpoints could never gracefully from its peer. If it did, the endpoints could never gracefully
terminate associations in some cases. terminate associations in some cases.
3.3. Registration of New Chunk Types 3.3. Registration of New Chunk Types
3.3.1. Description of the Problem 3.3.1. Description of the Problem
Section 14.1 of [RFC4960] should deal with new chunk types, however, Section 14.1 of [RFC4960] should deal with new chunk types; however,
the text refers to parameter types. the text only refers to parameter types.
This issue was reported as an Errata for [RFC4960] with Errata ID This issue was reported as an errata for [RFC4960] with
2592. Errata ID 2592.
3.3.2. Text Changes to the Document 3.3.2. Text Changes to the Document
--------- ---------
Old text: (Section 14.1) Old text: (Section 14.1)
--------- ---------
The assignment of new chunk parameter type codes is done through an The assignment of new chunk parameter type codes is done through an
IETF Consensus action, as defined in [RFC2434]. Documentation of the IETF Consensus action, as defined in [RFC2434]. Documentation of the
chunk parameter MUST contain the following information: chunk parameter MUST contain the following information:
--------- ---------
New text: (Section 14.1) New text: (Section 14.1)
skipping to change at page 7, line 16 skipping to change at page 7, line 9
--------- ---------
The assignment of new chunk parameter type codes is done through an The assignment of new chunk parameter type codes is done through an
IETF Consensus action, as defined in [RFC2434]. Documentation of the IETF Consensus action, as defined in [RFC2434]. Documentation of the
chunk parameter MUST contain the following information: chunk parameter MUST contain the following information:
--------- ---------
New text: (Section 14.1) New text: (Section 14.1)
--------- ---------
The assignment of new chunk type codes is done through an The assignment of new chunk type codes is done through an IETF
IETF Consensus action, as defined in [RFC8126]. Documentation of the Consensus action, as defined in [RFC8126]. Documentation for the
chunk type MUST contain the following information: chunk type MUST contain the following information:
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.43. updated in Section 3.43.
3.3.3. Solution Description 3.3.3. Solution Description
Refer to chunk types as intended and change reference to [RFC8126]. The new text refers to chunk types as intended and changes the
reference to [RFC8126].
3.4. Variable Parameters for INIT Chunks 3.4. Variable Parameters for INIT Chunks
3.4.1. Description of the Problem 3.4.1. Description of the Problem
Newlines in wrong places break the layout of the table of variable In Section 3.3.2 of [RFC4960], newlines in wrong places break the
parameters for the INIT chunk in Section 3.3.2 of [RFC4960]. layout of the table of variable parameters for the INIT chunk.
This issue was reported as an Errata for [RFC4960] with Errata ID This issue was reported as an errata for [RFC4960] with
3291 and Errata ID 3804. Errata ID 3291 and Errata ID 3804.
3.4.2. Text Changes to the Document 3.4.2. Text Changes to the Document
--------- ---------
Old text: (Section 3.3.2) Old text: (Section 3.3.2)
--------- ---------
Variable Parameters Status Type Value Variable Parameters Status Type Value
------------------------------------------------------------- -------------------------------------------------------------
IPv4 Address (Note 1) Optional 5 IPv6 Address IPv4 Address (Note 1) Optional 5 IPv6 Address
(Note 1) Optional 6 Cookie Preservative (Note 1) Optional 6 Cookie Preservative
Optional 9 Reserved for ECN Capable (Note 2) Optional Optional 9 Reserved for ECN Capable (Note 2) Optional
32768 (0x8000) Host Name Address (Note 3) Optional 32768 (0x8000) Host Name Address (Note 3) Optional
skipping to change at page 8, line 29 skipping to change at page 8, line 17
Variable Parameters Status Type Value Variable Parameters Status Type Value
------------------------------------------------------------- -------------------------------------------------------------
IPv4 Address (Note 1) Optional 5 IPv4 Address (Note 1) Optional 5
IPv6 Address (Note 1) Optional 6 IPv6 Address (Note 1) Optional 6
Cookie Preservative Optional 9 Cookie Preservative Optional 9
Reserved for ECN Capable (Note 2) Optional 32768 (0x8000) Reserved for ECN Capable (Note 2) Optional 32768 (0x8000)
Host Name Address (Note 3) Optional 11 Host Name Address (Note 3) Optional 11
Supported Address Types (Note 4) Optional 12 Supported Address Types (Note 4) Optional 12
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.4.3. Solution Description 3.4.3. Solution Description
Fix the formatting of the table. The formatting of the table is corrected.
3.5. CRC32c Sample Code on 64-bit Platforms 3.5. CRC32c Sample Code on 64-Bit Platforms
3.5.1. Description of the Problem 3.5.1. Description of the Problem
The sample code for computing the CRC32c provided in [RFC4960] The sample code for CRC32c computation, as provided in [RFC4960],
assumes that a variable of type unsigned long uses 32 bits. This is assumes that a variable of type unsigned long uses 32 bits. This is
not true on some 64-bit platforms (for example the ones using LP64). not true on some 64-bit platforms (for example, platforms that
use LP64).
This issue was reported as an Errata for [RFC4960] with Errata ID This issue was reported as an errata for [RFC4960] with
3423. Errata ID 3423.
3.5.2. Text Changes to the Document 3.5.2. Text Changes to the Document
--------- ---------
Old text: (Appendix C) Old text: (Appendix C)
--------- ---------
unsigned long unsigned long
generate_crc32c(unsigned char *buffer, unsigned int length) generate_crc32c(unsigned char *buffer, unsigned int length)
{ {
unsigned int i; unsigned int i;
unsigned long crc32 = ~0L; unsigned long crc32 = ~0L;
skipping to change at page 9, line 25 skipping to change at page 9, line 16
New text: (Appendix C) New text: (Appendix C)
--------- ---------
unsigned long unsigned long
generate_crc32c(unsigned char *buffer, unsigned int length) generate_crc32c(unsigned char *buffer, unsigned int length)
{ {
unsigned int i; unsigned int i;
unsigned long crc32 = 0xffffffffL; unsigned long crc32 = 0xffffffffL;
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.10 and in Section 3.46. updated in Section 3.10 and again in Section 3.46.
3.5.3. Solution Description 3.5.3. Solution Description
Use 0xffffffffL instead of ~0L which gives the same value on The new text uses 0xffffffffL instead of ~0L; this gives the same
platforms using 32 bits or 64 bits for variables of type unsigned value on platforms using 32 bits or 64 bits for variables of type
long. unsigned long.
3.6. Endpoint Failure Detection 3.6. Endpoint Failure Detection
3.6.1. Description of the Problem 3.6.1. Description of the Problem
The handling of the association error counter defined in Section 8.1 The handling of the association error counter defined in Section 8.1
of [RFC4960] can result in an association failure even if the path of [RFC4960] can result in an association failure even if the path
used for data transmission is available, but idle. used for data transmission is available (but idle).
This issue was reported as an Errata for [RFC4960] with Errata ID This issue was reported as an errata for [RFC4960] with
3788. Errata ID 3788.
3.6.2. Text Changes to the Document 3.6.2. Text Changes to the Document
--------- ---------
Old text: (Section 8.1) Old text: (Section 8.1)
--------- ---------
An endpoint shall keep a counter on the total number of consecutive An endpoint shall keep a counter on the total number of consecutive
retransmissions to its peer (this includes retransmissions to all the retransmissions to its peer (this includes retransmissions to all the
destination transport addresses of the peer if it is multi-homed), destination transport addresses of the peer if it is multi-homed),
including unacknowledged HEARTBEAT chunks. including unacknowledged HEARTBEAT chunks.
--------- ---------
skipping to change at page 10, line 18 skipping to change at page 9, line 51
An endpoint shall keep a counter on the total number of consecutive An endpoint shall keep a counter on the total number of consecutive
retransmissions to its peer (this includes retransmissions to all the retransmissions to its peer (this includes retransmissions to all the
destination transport addresses of the peer if it is multi-homed), destination transport addresses of the peer if it is multi-homed),
including unacknowledged HEARTBEAT chunks. including unacknowledged HEARTBEAT chunks.
--------- ---------
New text: (Section 8.1) New text: (Section 8.1)
--------- ---------
An endpoint SHOULD keep a counter on the total number of consecutive An endpoint SHOULD keep a counter on the total number of consecutive
retransmissions to its peer (this includes data retransmissions retransmissions to its peer (this includes data retransmissions to
to all the destination transport addresses of the peer if it is all the destination transport addresses of the peer if it is
multi-homed), including the number of unacknowledged HEARTBEAT multi-homed), including the number of unacknowledged HEARTBEAT chunks
chunks observed on the path which is currently used for data observed on the path that is currently used for data transfer.
transfer. Unacknowledged HEARTBEAT chunks observed on paths Unacknowledged HEARTBEAT chunks observed on paths different from the
different from the path currently used for data transfer SHOULD path currently used for data transfer SHOULD NOT increment the
NOT increment the association error counter, as this could lead association error counter, as this could lead to association closure
to association closure even if the path which is currently used for even if the path that is currently used for data transfer is
data transfer is available (but idle). available (but idle).
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.23. updated in Section 3.23.
3.6.3. Solution Description 3.6.3. Solution Description
A more refined handling for the association error counter is defined. A more refined handling of the association error counter is defined.
3.7. Data Transmission Rules 3.7. Data Transmission Rules
3.7.1. Description of the Problem 3.7.1. Description of the Problem
When integrating the changes to Section 6.1 A) of [RFC2960] as When integrating the changes to Section 6.1 A) of [RFC2960] as
described in Section 2.15.2 of [RFC4460] some text was duplicated and described in Section 2.15.2 of [RFC4460], some text was duplicated
became the final paragraph of Section 6.1 A) of [RFC4960]. and became the final paragraph of Section 6.1 A) of [RFC4960].
This issue was reported as an Errata for [RFC4960] with Errata ID This issue was reported as an errata for [RFC4960] with
4071. Errata ID 4071.
3.7.2. Text Changes to the Document 3.7.2. Text Changes to the Document
--------- ---------
Old text: (Section 6.1 A)) Old text: (Section 6.1 A))
--------- ---------
The sender MUST also have an algorithm for sending new DATA chunks The sender MUST also have an algorithm for sending new DATA chunks to
to avoid silly window syndrome (SWS) as described in [RFC0813]. avoid silly window syndrome (SWS) as described in [RFC0813]. The
The algorithm can be similar to the one described in Section algorithm can be similar to the one described in Section 4.2.3.4 of
4.2.3.4 of [RFC1122]. [RFC1122].
However, regardless of the value of rwnd (including if it is 0), However, regardless of the value of rwnd (including if it is 0), the
the data sender can always have one DATA chunk in flight to the data sender can always have one DATA chunk in flight to the receiver
receiver if allowed by cwnd (see rule B below). This rule allows if allowed by cwnd (see rule B below). This rule allows the sender
the sender to probe for a change in rwnd that the sender missed to probe for a change in rwnd that the sender missed due to the SACK
due to the SACK having been lost in transit from the data receiver having been lost in transit from the data receiver to the data
to the data sender. sender.
--------- ---------
New text: (Section 6.1 A)) New text: (Section 6.1 A))
--------- ---------
The sender MUST also have an algorithm for sending new DATA chunks The sender MUST also have an algorithm for sending new DATA chunks to
to avoid silly window syndrome (SWS) as described in [RFC1122]. avoid silly window syndrome (SWS) as described in [RFC1122]. The
The algorithm can be similar to the one described in Section algorithm can be similar to the algorithm described in
4.2.3.4 of [RFC1122]. Section 4.2.3.4 of [RFC1122].
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.7.3. Solution Description 3.7.3. Solution Description
Last paragraph of Section 6.1 A) removed as intended in The last paragraph of Section 6.1 A) is removed, as had been intended
Section 2.15.2 of [RFC4460]. in Section 2.15.2 of [RFC4460].
3.8. T1-Cookie Timer 3.8. T1-Cookie Timer
3.8.1. Description of the Problem 3.8.1. Description of the Problem
Figure 4 of [RFC4960] illustrates the SCTP association setup. Figure 4 of [RFC4960] illustrates the SCTP association setup.
However, it incorrectly shows that the T1-init timer is used in the However, it incorrectly shows that the T1-init timer is used in the
COOKIE-ECHOED state whereas the T1-cookie timer should have been used COOKIE-ECHOED state, whereas the T1-cookie timer should have been
instead. used instead.
This issue was reported as an Errata for [RFC4960] with Errata ID This issue was reported as an errata for [RFC4960] with
4400. Errata ID 4400.
3.8.2. Text Changes to the Document 3.8.2. Text Changes to the Document
--------- ---------
Old text: (Section 5.1.6, Figure 4) Old text: (Section 5.1.6, Figure 4)
--------- ---------
COOKIE ECHO [Cookie_Z] ------\ COOKIE ECHO [Cookie_Z] ------\
(Start T1-init timer) \ (Start T1-init timer) \
(Enter COOKIE-ECHOED state) \---> (build TCB enter ESTABLISHED (Enter COOKIE-ECHOED state) \---> (build TCB enter ESTABLISHED
skipping to change at page 12, line 26 skipping to change at page 12, line 11
/ /
(Cancel T1-init timer, <-----/ (Cancel T1-init timer, <-----/
Enter ESTABLISHED state) Enter ESTABLISHED state)
--------- ---------
New text: (Section 5.1.6, Figure 4) New text: (Section 5.1.6, Figure 4)
--------- ---------
COOKIE ECHO [Cookie_Z] ------\ COOKIE ECHO [Cookie_Z] ------\
(Start T1-cookie timer) \ (Start T1-cookie timer) \
(Enter COOKIE-ECHOED state) \---> (build TCB enter ESTABLISHED (Enter COOKIE-ECHOED state) \---> (build TCB, enter ESTABLISHED
state) state)
/---- COOKIE-ACK /---- COOKIE-ACK
/ /
(Cancel T1-cookie timer, <---/ (Cancel T1-cookie timer, <---/
Enter ESTABLISHED state) enter ESTABLISHED state)
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.9. updated in Section 3.9.
3.8.3. Solution Description 3.8.3. Solution Description
Change the figure such that the T1-cookie timer is used instead of The figure is changed such that the T1-cookie timer is used instead
the T1-init timer. of the T1-init timer.
3.9. Miscellaneous Typos 3.9. Miscellaneous Typos
3.9.1. Description of the Problem 3.9.1. Description of the Problem
While processing [RFC4960] some typos were not caught. While processing [RFC4960], some typos were not caught.
One typo was reported as an Errata for [RFC4960] with Errata ID 5003. One typo was reported as an errata for [RFC4960] with Errata ID 5003.
3.9.2. Text Changes to the Document 3.9.2. Text Changes to the Document
--------- ---------
Old text: (Section 1.6) Old text: (Section 1.6)
--------- ---------
Transmission Sequence Numbers wrap around when they reach 2**32 - 1. Transmission Sequence Numbers wrap around when they reach 2**32 - 1.
That is, the next TSN a DATA chunk MUST use after transmitting TSN = That is, the next TSN a DATA chunk MUST use after transmitting TSN =
2*32 - 1 is TSN = 0. 2*32 - 1 is TSN = 0.
--------- ---------
New text: (Section 1.6) New text: (Section 1.6)
--------- ---------
Transmission Sequence Numbers wrap around when they reach 2**32 - 1. Transmission Sequence Numbers wrap around when they reach 2**32 - 1.
That is, the next TSN a DATA chunk MUST use after transmitting TSN = That is, the next TSN a DATA chunk MUST use after transmitting
2**32 - 1 is TSN = 0. TSN = 2**32 - 1 is TSN = 0.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 3.3.10.9) Old text: (Section 3.3.10.9)
--------- ---------
No User Data: This error cause is returned to the originator of a No User Data: This error cause is returned to the originator of a
DATA chunk if a received DATA chunk has no user data. DATA chunk if a received DATA chunk has no user data.
--------- ---------
New text: (Section 3.3.10.9) New text: (Section 3.3.10.9)
--------- ---------
No User Data: This error cause is returned to the originator of a No User Data: This error cause is returned to the originator of a
DATA chunk if a received DATA chunk has no user data. DATA chunk if a received DATA chunk has no user data.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 6.7, Figure 9) Old text: (Section 6.7, Figure 9)
--------- ---------
Endpoint A Endpoint Z {App Endpoint A Endpoint Z {App
sends 3 messages; strm 0} DATA [TSN=6,Strm=0,Seq=2] ---------- sends 3 messages; strm 0} DATA [TSN=6,Strm=0,Seq=2] ----------
-----> (ack delayed) (Start T3-rtx timer) -----> (ack delayed) (Start T3-rtx timer)
skipping to change at page 14, line 41 skipping to change at page 14, line 24
DATA [TSN=7,Strm=0,Seq=3] --------> X (lost) DATA [TSN=7,Strm=0,Seq=3] --------> X (lost)
DATA [TSN=8,Strm=0,Seq=4] ---------------> (gap detected, DATA [TSN=8,Strm=0,Seq=4] ---------------> (gap detected,
immediately send ack) immediately send ack)
/----- SACK [TSN Ack=6,Block=1, /----- SACK [TSN Ack=6,Block=1,
/ Start=2,End=2] / Start=2,End=2]
<-----/ <-----/
(remove 6 from out-queue, (remove 6 from out-queue,
and mark 7 as "1" missing report) and mark 7 as "1" missing report)
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 6.10) Old text: (Section 6.10)
--------- ---------
An endpoint bundles chunks by simply including multiple chunks in one An endpoint bundles chunks by simply including multiple chunks in one
outbound SCTP packet. The total size of the resultant IP datagram, outbound SCTP packet. The total size of the resultant IP datagram,
including the SCTP packet and IP headers, MUST be less that or equal including the SCTP packet and IP headers, MUST be less that or equal
to the current Path MTU. to the current Path MTU.
--------- ---------
New text: (Section 6.10) New text: (Section 6.10)
--------- ---------
An endpoint bundles chunks by simply including multiple chunks in one An endpoint bundles chunks by simply including multiple chunks in one
outbound SCTP packet. The total size of the resultant IP datagram, outbound SCTP packet. The total size of the resultant IP datagram,
including the SCTP packet and IP headers, MUST be less than or equal including the SCTP packet and IP headers, MUST be less than or equal
to the current PMTU. to the current Path MTU (PMTU).
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 10.1 O)) Old text: (Section 10.1 O))
--------- ---------
o Receive Unacknowledged Message o Receive Unacknowledged Message
Format: RECEIVE_UNACKED(data retrieval id, buffer address, buffer Format: RECEIVE_UNACKED(data retrieval id, buffer address, buffer
size, [,stream id] [, stream sequence number] [,partial size, [,stream id] [, stream sequence number] [,partial
skipping to change at page 15, line 47 skipping to change at page 15, line 25
--------- ---------
New text: (Section 10.1 O)) New text: (Section 10.1 O))
--------- ---------
O) Receive Unacknowledged Message O) Receive Unacknowledged Message
Format: RECEIVE_UNACKED(data retrieval id, buffer address, buffer Format: RECEIVE_UNACKED(data retrieval id, buffer address, buffer
size [,stream id] [,stream sequence number] [,partial size [,stream id] [,stream sequence number] [,partial
flag] [,payload protocol-id]) flag] [,payload protocol-id])
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 10.1 M)) Old text: (Section 10.1 M))
--------- ---------
M) Set Protocol Parameters M) Set Protocol Parameters
Format: SETPROTOCOLPARAMETERS(association id, Format: SETPROTOCOLPARAMETERS(association id,
[,destination transport address,] [,destination transport address,]
skipping to change at page 16, line 25 skipping to change at page 15, line 48
--------- ---------
New text: (Section 10.1 M)) New text: (Section 10.1 M))
--------- ---------
M) Set Protocol Parameters M) Set Protocol Parameters
Format: SETPROTOCOLPARAMETERS(association id, Format: SETPROTOCOLPARAMETERS(association id,
[destination transport address,] [destination transport address,]
protocol parameter list) protocol parameter list)
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Appendix C) Old text: (Appendix C)
--------- ---------
ICMP2) An implementation MAY ignore all ICMPv6 messages where the ICMP2) An implementation MAY ignore all ICMPv6 messages where the
type field is not "Destination Unreachable", "Parameter type field is not "Destination Unreachable", "Parameter
Problem",, or "Packet Too Big". Problem",, or "Packet Too Big".
--------- ---------
New text: (Appendix C) New text: (Appendix C)
--------- ---------
ICMP2) An implementation MAY ignore all ICMPv6 messages where the ICMP2) An implementation MAY ignore all ICMPv6 messages where the
type field is not "Destination Unreachable", "Parameter type field is not "Destination Unreachable", "Parameter
Problem", or "Packet Too Big". Problem", or "Packet Too Big".
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Appendix C) Old text: (Appendix C)
--------- ---------
ICMP7) If the ICMP message is either a v6 "Packet Too Big" or a v4 ICMP7) If the ICMP message is either a v6 "Packet Too Big" or a v4
"Fragmentation Needed", an implementation MAY process this "Fragmentation Needed", an implementation MAY process this
information as defined for PATH MTU discovery. information as defined for PATH MTU discovery.
--------- ---------
New text: (Appendix C) New text: (Appendix C)
--------- ---------
ICMP7) If the ICMP message is either a v6 "Packet Too Big" or a v4 ICMP7) If the ICMP message is either a v6 "Packet Too Big" or a v4
"Fragmentation Needed", an implementation MAY process this "Fragmentation Needed", an implementation MAY process this
information as defined for PMTU discovery. information as defined for PMTU discovery.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 5.4) Old text: (Section 5.4)
--------- ---------
2) For the receiver of the COOKIE ECHO, the only CONFIRMED address 2) For the receiver of the COOKIE ECHO, the only CONFIRMED address
is the one to which the INIT-ACK was sent. is the one to which the INIT-ACK was sent.
--------- ---------
New text: (Section 5.4) New text: (Section 5.4)
--------- ---------
2) For the receiver of the COOKIE ECHO, the only CONFIRMED address 2) For the receiver of the COOKIE ECHO, the only CONFIRMED address
is the one to which the INIT ACK was sent. is the address to which the INIT ACK was sent.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 5.1.6, Figure 4) Old text: (Section 5.1.6, Figure 4)
--------- ---------
COOKIE ECHO [Cookie_Z] ------\ COOKIE ECHO [Cookie_Z] ------\
(Start T1-init timer) \ (Start T1-init timer) \
(Enter COOKIE-ECHOED state) \---> (build TCB enter ESTABLISHED (Enter COOKIE-ECHOED state) \---> (build TCB enter ESTABLISHED
state) state)
skipping to change at page 18, line 24 skipping to change at page 17, line 34
/ /
(Cancel T1-init timer, <-----/ (Cancel T1-init timer, <-----/
Enter ESTABLISHED state) Enter ESTABLISHED state)
--------- ---------
New text: (Section 5.1.6, Figure 4) New text: (Section 5.1.6, Figure 4)
--------- ---------
COOKIE ECHO [Cookie_Z] ------\ COOKIE ECHO [Cookie_Z] ------\
(Start T1-cookie timer) \ (Start T1-cookie timer) \
(Enter COOKIE-ECHOED state) \---> (build TCB enter ESTABLISHED (Enter COOKIE-ECHOED state) \---> (build TCB, enter ESTABLISHED
state) state)
/---- COOKIE ACK /---- COOKIE ACK
/ /
(Cancel T1-cookie timer, <---/ (Cancel T1-cookie timer, <---/
Enter ESTABLISHED state) enter ESTABLISHED state)
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.8. It is in final form, and is not modifications from Section 3.8. It is in final form and is not
further updated in this document. further updated in this document.
--------- ---------
Old text: (Section 5.2.5) Old text: (Section 5.2.5)
--------- ---------
5.2.5. Handle Duplicate COOKIE-ACK. 5.2.5. Handle Duplicate COOKIE-ACK.
--------- ---------
New text: (Section 5.2.5) New text: (Section 5.2.5)
--------- ---------
5.2.5. Handle Duplicate COOKIE ACK. 5.2.5. Handle Duplicate COOKIE ACK.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 8.3) Old text: (Section 8.3)
--------- ---------
By default, an SCTP endpoint SHOULD monitor the reachability of the By default, an SCTP endpoint SHOULD monitor the reachability of the
idle destination transport address(es) of its peer by sending a idle destination transport address(es) of its peer by sending a
HEARTBEAT chunk periodically to the destination transport HEARTBEAT chunk periodically to the destination transport
address(es). HEARTBEAT sending MAY begin upon reaching the address(es). HEARTBEAT sending MAY begin upon reaching the
skipping to change at page 19, line 23 skipping to change at page 18, line 32
ESTABLISHED state and is discontinued after sending either SHUTDOWN ESTABLISHED state and is discontinued after sending either SHUTDOWN
or SHUTDOWN-ACK. A receiver of a HEARTBEAT MUST respond to a or SHUTDOWN-ACK. A receiver of a HEARTBEAT MUST respond to a
HEARTBEAT with a HEARTBEAT-ACK after entering the COOKIE-ECHOED state HEARTBEAT with a HEARTBEAT-ACK after entering the COOKIE-ECHOED state
(INIT sender) or the ESTABLISHED state (INIT receiver), up until (INIT sender) or the ESTABLISHED state (INIT receiver), up until
reaching the SHUTDOWN-SENT state (SHUTDOWN sender) or the SHUTDOWN- reaching the SHUTDOWN-SENT state (SHUTDOWN sender) or the SHUTDOWN-
ACK-SENT state (SHUTDOWN receiver). ACK-SENT state (SHUTDOWN receiver).
--------- ---------
New text: (Section 8.3) New text: (Section 8.3)
--------- ---------
By default, an SCTP endpoint SHOULD monitor the reachability of the By default, an SCTP endpoint SHOULD monitor the reachability of the
idle destination transport address(es) of its peer by sending a idle destination transport address(es) of its peer by sending a
HEARTBEAT chunk periodically to the destination transport HEARTBEAT chunk periodically to the destination transport
address(es). HEARTBEAT sending MAY begin upon reaching the address(es). HEARTBEAT sending MAY begin upon reaching the
ESTABLISHED state and is discontinued after sending either SHUTDOWN ESTABLISHED state and is discontinued after sending either SHUTDOWN
or SHUTDOWN ACK. A receiver of a HEARTBEAT MUST respond to a or SHUTDOWN ACK. A receiver of a HEARTBEAT MUST respond to a
HEARTBEAT with a HEARTBEAT ACK after entering the COOKIE-ECHOED state HEARTBEAT with a HEARTBEAT ACK after entering the COOKIE-ECHOED state
(INIT sender) or the ESTABLISHED state (INIT receiver), up until (INIT sender) or the ESTABLISHED state (INIT receiver), up until
reaching the SHUTDOWN-SENT state (SHUTDOWN sender) or the SHUTDOWN- reaching the SHUTDOWN-SENT state (SHUTDOWN sender) or the
ACK-SENT state (SHUTDOWN receiver). SHUTDOWN-ACK-SENT state (SHUTDOWN receiver).
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.9.3. Solution Description 3.9.3. Solution Description
Typos fixed. Several typos have been fixed.
3.10. CRC32c Sample Code 3.10. CRC32c Sample Code
3.10.1. Description of the Problem 3.10.1. Description of the Problem
The CRC32c computation is described in Appendix B of [RFC4960]. The CRC32c computation is described in Appendix B of [RFC4960].
However, the corresponding sample code and its explanation appears at However, the corresponding sample code and its explanation appear at
the end of Appendix C, which deals with ICMP handling. the end of Appendix C of [RFC4960], which deals with ICMP handling.
3.10.2. Text Changes to the Document 3.10.2. Text Changes to the Document
Move all of Appendix C starting with the following sentence to the The text in Appendix C of [RFC4960], starting with the following
end of Appendix B. sentence, needs to be moved to the end of Appendix B.
The following non-normative sample code is taken from an open-source The following non-normative sample code is taken from an
CRC generator [WILLIAMS93], using the "mirroring" technique and open-source CRC generator [WILLIAMS93], using the "mirroring"
yielding a lookup table for SCTP CRC32c with 256 entries, each 32 technique and yielding a lookup table for SCTP CRC32c with
bits wide. 256 entries, each 32 bits wide.
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.5. It is further updated in modifications from Section 3.5. It is further updated in
Section 3.46. Section 3.46.
3.10.3. Solution Description 3.10.3. Solution Description
Text moved to the appropriate location. The text is moved to the appropriate location.
3.11. partial_bytes_acked after T3-rtx Expiration 3.11. partial_bytes_acked after T3-rtx Expiration
3.11.1. Description of the Problem 3.11.1. Description of the Problem
Section 7.2.3 of [RFC4960] explicitly states that partial_bytes_acked Section 7.2.3 of [RFC4960] explicitly states that partial_bytes_acked
should be reset to 0 after packet loss detection from SACK but the should be reset to 0 after packet loss detection from selective
same is missed for T3-rtx timer expiration. acknowledgment (SACK), but this information is not accounted for in
the case of T3-rtx timer expiration.
3.11.2. Text Changes to the Document 3.11.2. Text Changes to the Document
--------- ---------
Old text: (Section 7.2.3) Old text: (Section 7.2.3)
--------- ---------
When the T3-rtx timer expires on an address, SCTP should perform slow When the T3-rtx timer expires on an address, SCTP should perform slow
start by: start by:
skipping to change at page 21, line 4 skipping to change at page 20, line 14
--------- ---------
New text: (Section 7.2.3) New text: (Section 7.2.3)
--------- ---------
When the T3-rtx timer expires on an address, SCTP SHOULD perform slow When the T3-rtx timer expires on an address, SCTP SHOULD perform slow
start by: start by:
ssthresh = max(cwnd/2, 4*MTU) ssthresh = max(cwnd/2, 4*MTU)
cwnd = 1*MTU cwnd = 1*MTU
partial_bytes_acked = 0 partial_bytes_acked = 0
This text is in final form, and is not further updated in this
This text is in final form and is not further updated in this
document. document.
3.11.3. Solution Description 3.11.3. Solution Description
Specify that partial_bytes_acked should be reset to 0 after T3-rtx The new text specifies that partial_bytes_acked should be reset to 0
timer expiration. after T3-rtx timer expiration.
3.12. Order of Adjustments of partial_bytes_acked and cwnd 3.12. Order of Adjustments of partial_bytes_acked and cwnd
3.12.1. Description of the Problem 3.12.1. Description of the Problem
Section 7.2.2 of [RFC4960] likely implies the wrong order of Section 7.2.2 of [RFC4960] likely implies the wrong order of
adjustments applied to partial_bytes_acked and cwnd in the congestion adjustments applied to partial_bytes_acked and cwnd in the congestion
avoidance phase. avoidance phase.
3.12.2. Text Changes to the Document 3.12.2. Text Changes to the Document
skipping to change at page 21, line 36 skipping to change at page 20, line 47
o When partial_bytes_acked is equal to or greater than cwnd and o When partial_bytes_acked is equal to or greater than cwnd and
before the arrival of the SACK the sender had cwnd or more bytes before the arrival of the SACK the sender had cwnd or more bytes
of data outstanding (i.e., before arrival of the SACK, flightsize of data outstanding (i.e., before arrival of the SACK, flightsize
was greater than or equal to cwnd), increase cwnd by MTU, and was greater than or equal to cwnd), increase cwnd by MTU, and
reset partial_bytes_acked to (partial_bytes_acked - cwnd). reset partial_bytes_acked to (partial_bytes_acked - cwnd).
--------- ---------
New text: (Section 7.2.2) New text: (Section 7.2.2)
--------- ---------
o When partial_bytes_acked is equal to or greater than cwnd and o (1) when partial_bytes_acked is equal to or greater than cwnd and
before the arrival of the SACK the sender had cwnd or more bytes (2) before the arrival of the SACK the sender had cwnd or more
of data outstanding (i.e., before arrival of the SACK, flightsize bytes of data outstanding (i.e., before the arrival of the SACK,
was greater than or equal to cwnd), partial_bytes_acked is reset flightsize was greater than or equal to cwnd), partial_bytes_acked
to (partial_bytes_acked - cwnd). Next, cwnd is increased by 1*MTU. is reset to (partial_bytes_acked - cwnd). Next, cwnd is increased
by 1*MTU.
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.26. updated in Section 3.26.
3.12.3. Solution Description 3.12.3. Solution Description
The new text defines the exact order of adjustments of The new text defines the exact order of adjustments of
partial_bytes_acked and cwnd in the congestion avoidance phase. partial_bytes_acked and cwnd in the congestion avoidance phase.
3.13. HEARTBEAT ACK and the association error counter 3.13. HEARTBEAT ACK and the Association Error Counter
3.13.1. Description of the Problem 3.13.1. Description of the Problem
Section 8.1 and Section 8.3 of [RFC4960] prescribe that the receiver Sections 8.1 and 8.3 of [RFC4960] prescribe that the receiver of a
of a HEARTBEAT ACK must reset the association overall error counter. HEARTBEAT ACK must reset the association overall error count. In
In some circumstances, e.g. when a router discards DATA chunks but some circumstances, e.g., when a router discards DATA chunks but not
not HEARTBEAT chunks due to the larger size of the DATA chunk, it HEARTBEAT chunks due to the larger size of the DATA chunk, it might
might be better to not clear the association error counter on be better to not clear the association error counter on reception of
reception of the HEARTBEAT ACK and reset it only on reception of the the HEARTBEAT ACK and reset it only on reception of the SACK to avoid
SACK to avoid stalling the association. stalling the association.
3.13.2. Text Changes to the Document 3.13.2. Text Changes to the Document
--------- ---------
Old text: (Section 8.1) Old text: (Section 8.1)
--------- ---------
The counter shall be reset each time a DATA chunk sent to that peer The counter shall be reset each time a DATA chunk sent to that peer
endpoint is acknowledged (by the reception of a SACK) or a HEARTBEAT endpoint is acknowledged (by the reception of a SACK) or a HEARTBEAT
ACK is received from the peer endpoint. ACK is received from the peer endpoint.
--------- ---------
New text: (Section 8.1) New text: (Section 8.1)
--------- ---------
The counter MUST be reset each time a DATA chunk sent to that peer The counter MUST be reset each time a DATA chunk sent to that peer
endpoint is acknowledged (by the reception of a SACK). When a endpoint is acknowledged (by the reception of a SACK). When a
HEARTBEAT ACK is received from the peer endpoint, the counter SHOULD HEARTBEAT ACK is received from the peer endpoint, the counter SHOULD
also be reset. The receiver of the HEARTBEAT ACK MAY choose not to also be reset. The receiver of the HEARTBEAT ACK MAY choose not to
clear the counter if there is outstanding data on the association. clear the counter if there is outstanding data on the association.
This allows for handling the possible difference in reachability This allows for handling the possible difference in reachability
based on DATA chunks and HEARTBEAT chunks. based on DATA chunks and HEARTBEAT chunks.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 8.3) Old text: (Section 8.3)
--------- ---------
Upon the receipt of the HEARTBEAT ACK, the sender of the HEARTBEAT Upon the receipt of the HEARTBEAT ACK, the sender of the HEARTBEAT
should clear the error counter of the destination transport address should clear the error counter of the destination transport address
to which the HEARTBEAT was sent, and mark the destination transport to which the HEARTBEAT was sent, and mark the destination transport
address as active if it is not so marked. The endpoint may address as active if it is not so marked. The endpoint may
optionally report to the upper layer when an inactive destination optionally report to the upper layer when an inactive destination
address is marked as active due to the reception of the latest address is marked as active due to the reception of the latest
HEARTBEAT ACK. The receiver of the HEARTBEAT ACK must also clear the HEARTBEAT ACK. The receiver of the HEARTBEAT ACK must also clear the
association overall error count as well (as defined in Section 8.1). association overall error count as well (as defined in Section 8.1).
--------- ---------
New text: (Section 8.3) New text: (Section 8.3)
--------- ---------
Upon the receipt of the HEARTBEAT ACK, the sender of the HEARTBEAT Upon the receipt of the HEARTBEAT ACK, the sender of the HEARTBEAT
MUST clear the error counter of the destination transport address MUST clear the error counter of the destination transport address to
to which the HEARTBEAT was sent, and mark the destination transport which the HEARTBEAT was sent and mark the destination transport
address as active if it is not so marked. The endpoint MAY address as active if it is not so marked. The endpoint MAY
optionally report to the upper layer when an inactive destination optionally report to the upper layer when an inactive destination
address is marked as active due to the reception of the latest address is marked as active due to the reception of the latest
HEARTBEAT ACK. The receiver of the HEARTBEAT ACK SHOULD also clear HEARTBEAT ACK. The receiver of the HEARTBEAT ACK SHOULD also clear
the association overall error counter (as defined in Section 8.1). the association overall error count (as defined in Section 8.1).
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.23. updated in Section 3.23.
3.13.3. Solution Description 3.13.3. Solution Description
The new text provides a possibility to not reset the association The new text provides the possibility of not resetting the
overall error counter when a HEARTBEAT ACK is received if there are association overall error count when a HEARTBEAT ACK is received if
valid reasons for it. there are valid reasons for not doing so.
3.14. Path for Fast Retransmission 3.14. Path for Fast Retransmission
3.14.1. Description of the Problem 3.14.1. Description of the Problem
[RFC4960] clearly describes where to retransmit data that is timed [RFC4960] clearly describes where to retransmit data that is timed
out when the peer is multi-homed but the same is not stated for fast out when the peer is multi-homed, but the same is not stated for fast
retransmissions. retransmissions.
3.14.2. Text Changes to the Document 3.14.2. Text Changes to the Document
---------
Old text: (Section 6.4)
---------
Furthermore, when its peer is multi-homed, an endpoint SHOULD try to ---------
retransmit a chunk that timed out to an active destination transport Old text: (Section 6.4)
address that is different from the last destination address to which ---------
the DATA chunk was sent.
--------- Furthermore, when its peer is multi-homed, an endpoint SHOULD try to
New text: (Section 6.4) retransmit a chunk that timed out to an active destination transport
--------- address that is different from the last destination address to which
the DATA chunk was sent.
Furthermore, when its peer is multi-homed, an endpoint SHOULD try to ---------
retransmit a chunk that timed out to an active destination transport New text: (Section 6.4)
address that is different from the last destination address to which ---------
the DATA chunk was sent.
When its peer is multi-homed, an endpoint SHOULD send fast Furthermore, when its peer is multi-homed, an endpoint SHOULD try to
retransmissions to the same destination transport address where the retransmit a chunk that timed out to an active destination transport
original data was sent to. If the primary path has been changed and the address that is different from the last destination address to which
original data was sent to the old primary path before the fast the DATA chunk was sent.
retransmit, the implementation MAY send it to the new primary path.
This text is in final form, and is not further updated in this When its peer is multi-homed, an endpoint SHOULD send fast
retransmissions to the same destination transport address to which
the original data was sent. If the primary path has been changed and
the original data was sent to the old primary path before the Fast
Retransmit, the implementation MAY send it to the new primary path.
This text is in final form and is not further updated in this
document. document.
3.14.3. Solution Description 3.14.3. Solution Description
The new text clarifies where to send fast retransmissions. The new text clarifies where to send fast retransmissions.
3.15. Transmittal in Fast Recovery 3.15. Transmittal in Fast Recovery
3.15.1. Description of the Problem 3.15.1. Description of the Problem
The Fast Retransmit on Gap Reports algorithm intends that only the The Fast Retransmit on Gap Reports algorithm intends that only the
very first packet may be sent regardless of cwnd in the Fast Recovery very first packet may be sent regardless of cwnd in the Fast Recovery
phase but rule 3) of [RFC4960], Section 7.2.4, misses this phase, but rule 3) in Section 7.2.4 of [RFC4960] misses this
clarification. clarification.
3.15.2. Text Changes to the Document 3.15.2. Text Changes to the Document
--------- ---------
Old text: (Section 7.2.4) Old text: (Section 7.2.4)
--------- ---------
3) Determine how many of the earliest (i.e., lowest TSN) DATA chunks 3) Determine how many of the earliest (i.e., lowest TSN) DATA chunks
marked for retransmission will fit into a single packet, subject marked for retransmission will fit into a single packet, subject
to constraint of the path MTU of the destination transport to constraint of the path MTU of the destination transport
address to which the packet is being sent. Call this value K. address to which the packet is being sent. Call this value K.
Retransmit those K DATA chunks in a single packet. When a Fast Retransmit those K DATA chunks in a single packet. When a Fast
Retransmit is being performed, the sender SHOULD ignore the value Retransmit is being performed, the sender SHOULD ignore the value
skipping to change at page 25, line 25 skipping to change at page 24, line 28
packet. packet.
--------- ---------
New text: (Section 7.2.4) New text: (Section 7.2.4)
--------- ---------
3) If not in Fast Recovery, determine how many of the earliest 3) If not in Fast Recovery, determine how many of the earliest
(i.e., lowest TSN) DATA chunks marked for retransmission will fit (i.e., lowest TSN) DATA chunks marked for retransmission will fit
into a single packet, subject to constraint of the PMTU of into a single packet, subject to constraint of the PMTU of
the destination transport address to which the packet is being the destination transport address to which the packet is being
sent. Call this value K. Retransmit those K DATA chunks in a sent. Call this value K. Retransmit those K DATA chunks in a
single packet. When a Fast Retransmit is being performed, the single packet. When a Fast Retransmit is being performed, the
sender SHOULD ignore the value of cwnd and SHOULD NOT delay sender SHOULD ignore the value of cwnd and SHOULD NOT delay
retransmission for this single packet. retransmission for this single packet.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.15.3. Solution Description 3.15.3. Solution Description
The new text explicitly specifies to send only the first packet in The new text explicitly specifies that only the first packet in the
the Fast Recovery phase disregarding cwnd limitations. Fast Recovery phase be sent and that the cwnd limitations be
disregarded.
3.16. Initial Value of ssthresh 3.16. Initial Value of ssthresh
3.16.1. Description of the Problem 3.16.1. Description of the Problem
The initial value of ssthresh should be set arbitrarily high. Using The initial value of ssthresh should be set arbitrarily high. Using
the advertised receiver window of the peer is inappropriate if the the advertised receiver window of the peer is inappropriate if the
peer increases its window after the handshake. Furthermore, use a peer increases its window after the handshake. Furthermore, a higher
higher requirements level, since not following the advice may result requirement level needs to be used, since not following the advice
in performance problems. may result in performance problems.
3.16.2. Text Changes to the Document 3.16.2. Text Changes to the Document
--------- ---------
Old text: (Section 7.2.1) Old text: (Section 7.2.1)
--------- ---------
o The initial value of ssthresh MAY be arbitrarily high (for o The initial value of ssthresh MAY be arbitrarily high (for
example, implementations MAY use the size of the receiver example, implementations MAY use the size of the receiver
advertised window). advertised window).
--------- ---------
New text: (Section 7.2.1) New text: (Section 7.2.1)
--------- ---------
o The initial value of ssthresh SHOULD be arbitrarily high (e.g., o The initial value of ssthresh SHOULD be arbitrarily high (e.g.,
the size of the largest possible advertised window). the size of the largest possible advertised window).
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.16.3. Solution Description 3.16.3. Solution Description
Use the same value as suggested in [RFC5681], Section 3.1, as an The same value as the value suggested in [RFC5681], Section 3.1, is
appropriate initial value. Furthermore, use the same requirements now used as an appropriate initial value. Also, the same requirement
level. level is used.
3.17. Automatically Confirmed Addresses 3.17. Automatically CONFIRMED Addresses
3.17.1. Description of the Problem 3.17.1. Description of the Problem
The Path Verification procedure of [RFC4960] prescribes that any The Path Verification procedure of [RFC4960] prescribes that any
address passed to the sender of the INIT by its upper layer is address passed to the sender of the INIT by its upper layer be
automatically CONFIRMED. This, however, is unclear if only addresses automatically CONFIRMED. This, however, is unclear if (1) only
in the request to initiate association establishment are considered addresses in the request to initiate association establishment or
or any addresses provided by the upper layer in any requests (e.g. in (2) any addresses provided by the upper layer in any requests (e.g.,
'Set Primary'). in 'Set Primary') are considered.
3.17.2. Text Changes to the Document 3.17.2. Text Changes to the Document
--------- ---------
Old text: (Section 5.4) Old text: (Section 5.4)
--------- ---------
1) Any address passed to the sender of the INIT by its upper layer 1) Any address passed to the sender of the INIT by its upper layer
is automatically considered to be CONFIRMED. is automatically considered to be CONFIRMED.
--------- ---------
New text: (Section 5.4) New text: (Section 5.4)
--------- ---------
skipping to change at page 27, line 15 skipping to change at page 26, line 9
Old text: (Section 5.4) Old text: (Section 5.4)
--------- ---------
1) Any address passed to the sender of the INIT by its upper layer 1) Any address passed to the sender of the INIT by its upper layer
is automatically considered to be CONFIRMED. is automatically considered to be CONFIRMED.
--------- ---------
New text: (Section 5.4) New text: (Section 5.4)
--------- ---------
1) Any addresses passed to the sender of the INIT by its upper 1) Any addresses passed to the sender of the INIT by its upper layer
layer in the request to initialize an association are in the request to initialize an association are automatically
automatically considered to be CONFIRMED. considered to be CONFIRMED.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.17.3. Solution Description 3.17.3. Solution Description
The new text clarifies that only addresses provided by the upper The new text clarifies that only addresses provided by the upper
layer in the request to initialize an association are automatically layer in the request to initialize an association are automatically
confirmed. CONFIRMED.
3.18. Only One Packet after Retransmission Timeout 3.18. Only One Packet after Retransmission Timeout
3.18.1. Description of the Problem 3.18.1. Description of the Problem
[RFC4960] is not completely clear when it describes data transmission [RFC4960] is not completely clear when it describes data transmission
after T3-rtx timer expiration. Section 7.2.1 does not specify how after T3-rtx timer expiration. Section 7.2.1 of [RFC4960] does not
many packets are allowed to be sent after T3-rtx timer expiration if specify how many packets are allowed to be sent after T3-rtx timer
more than one packet fit into cwnd. At the same time, Section 7.2.3 expiration if more than one packet fits into cwnd. At the same time,
has the text without normative language saying that SCTP should Section 7.2.3 of [RFC4960] has text without normative language saying
ensure that no more than one packet will be in flight after T3-rtx that SCTP should ensure that no more than one packet will be in
timer expiration until successful acknowledgment. It makes the text flight after T3-rtx timer expiration until successful
inconsistent. acknowledgement. The text is therefore inconsistent.
3.18.2. Text Changes to the Document 3.18.2. Text Changes to the Document
--------- ---------
Old text: (Section 7.2.1) Old text: (Section 7.2.1)
--------- ---------
o The initial cwnd after a retransmission timeout MUST be no more o The initial cwnd after a retransmission timeout MUST be no more
than 1*MTU. than 1*MTU.
--------- ---------
New text: (Section 7.2.1) New text: (Section 7.2.1)
--------- ---------
skipping to change at page 28, line 16 skipping to change at page 26, line 49
--------- ---------
o The initial cwnd after a retransmission timeout MUST be no more o The initial cwnd after a retransmission timeout MUST be no more
than 1*MTU. than 1*MTU.
--------- ---------
New text: (Section 7.2.1) New text: (Section 7.2.1)
--------- ---------
o The initial cwnd after a retransmission timeout MUST be no more o The initial cwnd after a retransmission timeout MUST be no more
than 1*MTU and only one packet is allowed to be in flight than 1*MTU, and only one packet is allowed to be in flight until
until successful acknowledgement. successful acknowledgement.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.18.3. Solution Description 3.18.3. Solution Description
The new text clearly specifies that only one packet is allowed to be The new text clearly specifies that only one packet is allowed to be
sent after T3-rtx timer expiration until successful acknowledgement. sent after T3-rtx timer expiration until successful acknowledgement.
3.19. INIT ACK Path for INIT in COOKIE-WAIT State 3.19. INIT ACK Path for INIT in COOKIE-WAIT State
3.19.1. Description of the Problem 3.19.1. Description of the Problem
In case of an INIT received in the COOKIE-WAIT state [RFC4960] In the case of an INIT received in the COOKIE-WAIT state, [RFC4960]
prescribes to send an INIT ACK to the same destination address to prescribes that an INIT ACK be sent to the same destination address
which the original INIT has been sent. This text does not address to which the original INIT has been sent. [RFC4960] does not address
the possibility of the upper layer to provide multiple remote IP the possibility of the upper layer providing multiple remote IP
addresses while requesting the association establishment. If the addresses while requesting the association establishment. If the
upper layer has provided multiple IP addresses and only a subset of upper layer has provided multiple IP addresses and only a subset of
these addresses are supported by the peer then the destination these addresses are supported by the peer, then the destination
address of the original INIT may be absent in the incoming INIT and address of the original INIT may be absent in the incoming INIT and
sending INIT ACK to that address is useless. sending an INIT ACK to that address is useless.
3.19.2. Text Changes to the Document 3.19.2. Text Changes to the Document
--------- ---------
Old text: (Section 5.2.1) Old text: (Section 5.2.1)
--------- ---------
Upon receipt of an INIT in the COOKIE-WAIT state, an endpoint MUST Upon receipt of an INIT in the COOKIE-WAIT state, an endpoint MUST
respond with an INIT ACK using the same parameters it sent in its respond with an INIT ACK using the same parameters it sent in its
original INIT chunk (including its Initiate Tag, unchanged). When original INIT chunk (including its Initiate Tag, unchanged). When
responding, the endpoint MUST send the INIT ACK back to the same responding, the endpoint MUST send the INIT ACK back to the same
address that the original INIT (sent by this endpoint) was sent. address that the original INIT (sent by this endpoint) was sent.
skipping to change at page 29, line 20 skipping to change at page 27, line 45
original INIT chunk (including its Initiate Tag, unchanged). When original INIT chunk (including its Initiate Tag, unchanged). When
responding, the endpoint MUST send the INIT ACK back to the same responding, the endpoint MUST send the INIT ACK back to the same
address that the original INIT (sent by this endpoint) was sent. address that the original INIT (sent by this endpoint) was sent.
--------- ---------
New text: (Section 5.2.1) New text: (Section 5.2.1)
--------- ---------
Upon receipt of an INIT in the COOKIE-WAIT state, an endpoint MUST Upon receipt of an INIT in the COOKIE-WAIT state, an endpoint MUST
respond with an INIT ACK using the same parameters it sent in its respond with an INIT ACK using the same parameters it sent in its
original INIT chunk (including its Initiate Tag, unchanged). When original INIT chunk (including its Initiate Tag, unchanged). When
responding, the following rules MUST be applied: responding, the following rules MUST be applied:
1) The INIT ACK MUST only be sent to an address passed by the upper 1) The INIT ACK MUST only be sent to an address passed by the upper
layer in the request to initialize the association. layer in the request to initialize the association.
2) The INIT ACK MUST only be sent to an address reported in the 2) The INIT ACK MUST only be sent to an address reported in the
incoming INIT. incoming INIT.
3) The INIT ACK SHOULD be sent to the source address of the 3) The INIT ACK SHOULD be sent to the source address of the received
received INIT. INIT.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.19.3. Solution Description 3.19.3. Solution Description
The new text requires sending INIT ACK to a destination address that The new text requires sending an INIT ACK to a destination address
is passed by the upper layer and reported in the incoming INIT. If that is passed by the upper layer and reported in the incoming INIT.
the source address of the INIT meets these conditions, sending the If the source address of the INIT meets these conditions, sending the
INIT ACK to the source address of the INIT is the preferred behavior. INIT ACK to the source address of the INIT is the preferred behavior.
3.20. Zero Window Probing and Unreachable Primary Path 3.20. Zero Window Probing and Unreachable Primary Path
3.20.1. Description of the Problem 3.20.1. Description of the Problem
Section 6.1 of [RFC4960] states that when sending zero window probes, Section 6.1 of [RFC4960] states that when sending zero window probes,
SCTP should neither increment the association counter nor increment SCTP should neither increment the association counter nor increment
the destination address error counter if it continues to receive new the destination address error counter if it continues to receive new
packets from the peer. However, the reception of new packets from packets from the peer. However, the reception of new packets from
the peer does not guarantee the peer's reachability and, if the the peer does not guarantee the peer's reachability, and if the
destination address becomes unreachable during zero window probing, destination address becomes unreachable during zero window probing,
SCTP cannot get an updated rwnd until it switches the destination SCTP cannot get an updated rwnd until it switches the destination
address for probes. address for probes.
3.20.2. Text Changes to the Document 3.20.2. Text Changes to the Document
--------- ---------
Old text: (Section 6.1) Old text: (Section 6.1 A))
--------- ---------
If the sender continues to receive new packets from the receiver If the sender continues to receive new packets from the receiver
while doing zero window probing, the unacknowledged window probes while doing zero window probing, the unacknowledged window probes
should not increment the error counter for the association or any should not increment the error counter for the association or any
destination transport address. This is because the receiver MAY destination transport address. This is because the receiver MAY keep
keep its window closed for an indefinite time. Refer to Section its window closed for an indefinite time. Refer to Section 6.2 on
6.2 on the receiver behavior when it advertises a zero window. the receiver behavior when it advertises a zero window.
--------- ---------
New text: (Section 6.1) New text: (Section 6.1 A))
--------- ---------
If the sender continues to receive SACKs from the peer If the sender continues to receive SACKs from the peer while doing
while doing zero window probing, the unacknowledged window probes zero window probing, the unacknowledged window probes SHOULD NOT
SHOULD NOT increment the error counter for the association or any increment the error counter for the association or any destination
destination transport address. This is because the receiver could transport address. This is because the receiver could keep its
keep its window closed for an indefinite time. Section 6.2 describes window closed for an indefinite time. Section 6.2 describes the
the receiver behavior when it advertises a zero window. receiver behavior when it advertises a zero window.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.20.3. Solution Description 3.20.3. Solution Description
The new text clarifies that if the receiver continues to send SACKs, The new text clarifies that if the receiver continues to send SACKs,
the sender of probes should not increment the error counter of the the sender of probes should not increment the error counter of the
association and the destination address even if the SACKs do not association and the destination address even if the SACKs do not
acknowledge the probes. acknowledge the probes.
3.21. Normative Language in Section 10 3.21. Normative Language in Section 10 of RFC 4960
3.21.1. Description of the Problem 3.21.1. Description of the Problem
Section 10 of [RFC4960] is informative and, therefore, normative Section 10 of [RFC4960] is informative. Therefore, normative
language such as MUST and MAY cannot be used there. However, there language such as MUST and MAY cannot be used there. However, there
are several places in Section 10 where MUST and MAY are used. are several places in Section 10 of [RFC4960] where MUST and MAY
are used.
3.21.2. Text Changes to the Document 3.21.2. Text Changes to the Document
--------- ---------
Old text: (Section 10.1 E)) Old text: (Section 10.1 E))
--------- ---------
o no-bundle flag - instructs SCTP not to bundle this user data with o no-bundle flag - instructs SCTP not to bundle this user data with
other outbound DATA chunks. SCTP MAY still bundle even when this other outbound DATA chunks. SCTP MAY still bundle even when this
flag is present, when faced with network congestion. flag is present, when faced with network congestion.
--------- ---------
New text: (Section 10.1 E)) New text: (Section 10.1 E))
--------- ---------
o no-bundle flag - instructs SCTP not to bundle this user data with o no-bundle flag - instructs SCTP not to bundle this user data with
other outbound DATA chunks. SCTP may still bundle even when this other outbound DATA chunks. When faced with network congestion,
flag is present, when faced with network congestion. SCTP may still bundle the data, even when this flag is present.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 10.1 G)) Old text: (Section 10.1 G))
--------- ---------
o Stream Sequence Number - the Stream Sequence Number assigned by o Stream Sequence Number - the Stream Sequence Number assigned by
the sending SCTP peer. the sending SCTP peer.
o partial flag - if this returned flag is set to 1, then this o partial flag - if this returned flag is set to 1, then this
Receive contains a partial delivery of the whole message. When Receive contains a partial delivery of the whole message. When
this flag is set, the stream id and Stream Sequence Number MUST this flag is set, the stream id and Stream Sequence Number MUST
accompany this receive. When this flag is set to 0, it indicates accompany this receive. When this flag is set to 0, it indicates
that no more deliveries will be received for this Stream Sequence that no more deliveries will be received for this Stream Sequence
Number. Number.
--------- ---------
New text: (Section 10.1 G)) New text: (Section 10.1 G))
--------- ---------
o stream sequence number - the Stream Sequence Number assigned by o stream sequence number - the Stream Sequence Number assigned by
the sending SCTP peer. the sending SCTP peer.
o partial flag - if this returned flag is set to 1, then this o partial flag - if this returned flag is set to 1, then this
primitive contains a partial delivery of the whole message. When primitive contains a partial delivery of the whole message. When
this flag is set, the stream id and stream sequence number must this flag is set, the stream id and stream sequence number must
accompany this primitive. When this flag is set to 0, it indicates accompany this primitive. When this flag is set to 0, it
that no more deliveries will be received for this stream sequence indicates that no more deliveries will be received for this stream
number. sequence number.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 10.1 N)) Old text: (Section 10.1 N))
--------- ---------
o Stream Sequence Number - this value is returned indicating the o Stream Sequence Number - this value is returned indicating the
Stream Sequence Number that was associated with the message. Stream Sequence Number that was associated with the message.
o partial flag - if this returned flag is set to 1, then this o partial flag - if this returned flag is set to 1, then this
message is a partial delivery of the whole message. When this message is a partial delivery of the whole message. When this
flag is set, the stream id and Stream Sequence Number MUST flag is set, the stream id and Stream Sequence Number MUST
accompany this receive. When this flag is set to 0, it indicates accompany this receive. When this flag is set to 0, it indicates
that no more deliveries will be received for this Stream Sequence that no more deliveries will be received for this Stream Sequence
Number. Number.
--------- ---------
New text: (Section 10.1 N)) New text: (Section 10.1 N))
--------- ---------
o stream sequence number - this value is returned indicating the o stream sequence number - this value is returned indicating the
Stream Sequence Number that was associated with the message. Stream Sequence Number that was associated with the message.
o partial flag - if this returned flag is set to 1, then this o partial flag - if this returned flag is set to 1, then this
message is a partial delivery of the whole message. When this message is a partial delivery of the whole message. When this
flag is set, the stream id and stream sequence number must flag is set, the stream id and stream sequence number must
accompany this primitive. When this flag is set to 0, it indicates accompany this primitive. When this flag is set to 0, it
that no more deliveries will be received for this stream sequence indicates that no more deliveries will be received for this stream
number. sequence number.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 10.1 O)) Old text: (Section 10.1 O))
--------- ---------
o Stream Sequence Number - this value is returned indicating the o Stream Sequence Number - this value is returned indicating the
Stream Sequence Number that was associated with the message. Stream Sequence Number that was associated with the message.
o partial flag - if this returned flag is set to 1, then this o partial flag - if this returned flag is set to 1, then this
message is a partial delivery of the whole message. When this message is a partial delivery of the whole message. When this
flag is set, the stream id and Stream Sequence Number MUST flag is set, the stream id and Stream Sequence Number MUST
accompany this receive. When this flag is set to 0, it indicates accompany this receive. When this flag is set to 0, it indicates
that no more deliveries will be received for this Stream Sequence that no more deliveries will be received for this Stream Sequence
Number. Number.
--------- ---------
New text: (Section 10.1 O)) New text: (Section 10.1 O))
--------- ---------
o stream sequence number - this value is returned indicating the o stream sequence number - this value is returned indicating the
Stream Sequence Number that was associated with the message. Stream Sequence Number that was associated with the message.
o partial flag - if this returned flag is set to 1, then this o partial flag - if this returned flag is set to 1, then this
message is a partial delivery of the whole message. When this message is a partial delivery of the whole message. When this
flag is set, the stream id and stream sequence number must flag is set, the stream id and stream sequence number must
accompany this primitive. When this flag is set to 0, it indicates accompany this primitive. When this flag is set to 0, it
that no more deliveries will be received for this stream sequence indicates that no more deliveries will be received for this stream
number. sequence number.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.21.3. Solution Description 3.21.3. Solution Description
The normative language is removed from Section 10. In addition, the The normative language is removed from Section 10. In addition, the
consistency of the text has been improved. consistency of the text has been improved.
3.22. Increase of partial_bytes_acked in Congestion Avoidance 3.22. Increase of partial_bytes_acked in Congestion Avoidance
3.22.1. Description of the Problem 3.22.1. Description of the Problem
Two issues have been discovered with the partial_bytes_acked handling Two issues have been discovered in the text in Section 7.2.2 of
described in Section 7.2.2 of [RFC4960]: [RFC4960] regarding partial_bytes_acked handling:
o If the Cumulative TSN Ack Point is not advanced but the SACK chunk o If the Cumulative TSN Ack Point is not advanced but the SACK chunk
acknowledges new TSNs in the Gap Ack Blocks, these newly acknowledges new TSNs in the Gap Ack Blocks, these newly
acknowledged TSNs are not considered for partial_bytes_acked acknowledged TSNs are not considered for partial_bytes_acked even
although these TSNs were successfully received by the peer. though these TSNs were successfully received by the peer.
o Duplicate TSNs are not considered in partial_bytes_acked although o Duplicate TSNs are not considered in partial_bytes_acked even
they confirm that the DATA chunks were successfully received by though they confirm that the DATA chunks were successfully
the peer. received by the peer.
3.22.2. Text Changes to the Document 3.22.2. Text Changes to the Document
--------- ---------
Old text: (Section 7.2.2) Old text: (Section 7.2.2)
--------- ---------
o Whenever cwnd is greater than ssthresh, upon each SACK arrival o Whenever cwnd is greater than ssthresh, upon each SACK arrival
that advances the Cumulative TSN Ack Point, increase that advances the Cumulative TSN Ack Point, increase
partial_bytes_acked by the total number of bytes of all new chunks partial_bytes_acked by the total number of bytes of all new chunks
acknowledged in that SACK including chunks acknowledged by the new acknowledged in that SACK including chunks acknowledged by the new
Cumulative TSN Ack and by Gap Ack Blocks. Cumulative TSN Ack and by Gap Ack Blocks.
--------- ---------
New text: (Section 7.2.2) New text: (Section 7.2.2)
--------- ---------
o Whenever cwnd is greater than ssthresh, upon each SACK arrival, o Whenever cwnd is greater than ssthresh, upon each SACK arrival,
increase partial_bytes_acked by the total number of bytes of all increase partial_bytes_acked by the total number of bytes of all
new chunks acknowledged in that SACK including chunks acknowledged new chunks acknowledged in that SACK, including chunks
by the new Cumulative TSN Ack, by Gap Ack Blocks and by the number acknowledged by the new Cumulative TSN Ack, by Gap Ack Blocks,
of bytes of duplicated chunks reported in Duplicate TSNs. and by the number of bytes of duplicated chunks reported in
Duplicate TSNs.
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.26. updated in Section 3.26.
3.22.3. Solution Description 3.22.3. Solution Description
Now partial_bytes_acked is increased by TSNs reported as duplicated In the new text, partial_bytes_acked is increased by TSNs reported as
as well as TSNs newly acknowledged in Gap Ack Blocks even if the duplicated, as well as TSNs newly acknowledged in Gap Ack Blocks,
Cumulative TSN Ack Point is not advanced. even if the Cumulative TSN Ack Point is not advanced.
3.23. Inconsistency in Notifications Handling 3.23. Inconsistent Handling of Notifications
3.23.1. Description of the Problem 3.23.1. Description of the Problem
[RFC4960] uses inconsistent normative and non-normative language when [RFC4960] uses inconsistent normative and non-normative language when
describing rules for sending notifications to the upper layer. E.g. describing rules for sending notifications to the upper layer. For
Section 8.2 of [RFC4960] says that when a destination address becomes example, Section 8.2 of [RFC4960] says that when a destination
inactive due to an unacknowledged DATA chunk or HEARTBEAT chunk, SCTP address becomes inactive due to an unacknowledged DATA chunk or
SHOULD send a notification to the upper layer while Section 8.3 of HEARTBEAT chunk, SCTP SHOULD send a notification to the upper layer;
[RFC4960] says that when a destination address becomes inactive due however, Section 8.3 of [RFC4960] says that when a destination
to an unacknowledged HEARTBEAT chunk, SCTP may send a notification to address becomes inactive due to an unacknowledged HEARTBEAT chunk,
the upper layer. SCTP may send a notification to the upper layer.
This makes the text inconsistent. These inconsistent descriptions need to be corrected.
3.23.2. Text Changes to the Document 3.23.2. Text Changes to the Document
--------- ---------
Old text: (Section 8.1) Old text: (Section 8.1)
--------- ---------
An endpoint shall keep a counter on the total number of consecutive An endpoint shall keep a counter on the total number of consecutive
retransmissions to its peer (this includes retransmissions to all the retransmissions to its peer (this includes retransmissions to all the
destination transport addresses of the peer if it is multi-homed), destination transport addresses of the peer if it is multi-homed),
including unacknowledged HEARTBEAT chunks. including unacknowledged HEARTBEAT chunks.
--------- ---------
New text: (Section 8.1) New text: (Section 8.1)
--------- ---------
An endpoint SHOULD keep a counter on the total number of consecutive An endpoint SHOULD keep a counter on the total number of consecutive
retransmissions to its peer (this includes data retransmissions retransmissions to its peer (this includes data retransmissions to
to all the destination transport addresses of the peer if it is all the destination transport addresses of the peer if it is
multi-homed), including the number of unacknowledged HEARTBEAT multi-homed), including the number of unacknowledged HEARTBEAT chunks
chunks observed on the path which currently is used for data observed on the path that is currently used for data transfer.
transfer. Unacknowledged HEARTBEAT chunks observed on paths Unacknowledged HEARTBEAT chunks observed on paths different from the
different from the path currently used for data transfer SHOULD path currently used for data transfer SHOULD NOT increment the
NOT increment the association error counter, as this could lead association error counter, as this could lead to association closure
to association closure even if the path which currently is used for even if the path that is currently used for data transfer is
data transfer is available (but idle). If the value of this available (but idle). If the value of this counter exceeds the limit
counter exceeds the limit indicated in the protocol parameter indicated in the protocol parameter 'Association.Max.Retrans', the
'Association.Max.Retrans', the endpoint SHOULD consider the peer endpoint SHOULD consider the peer endpoint unreachable and SHALL stop
endpoint unreachable and SHALL stop transmitting any more data to it transmitting any more data to it (and thus the association enters the
(and thus the association enters the CLOSED state). In addition, the CLOSED state). In addition, the endpoint SHOULD report the failure
endpoint SHOULD report the failure to the upper layer and optionally to the upper layer and optionally report back all outstanding user
report back all outstanding user data remaining in its outbound data remaining in its outbound queue. The association is
queue. The association is automatically closed when the peer automatically closed when the peer endpoint becomes unreachable.
endpoint becomes unreachable.
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.6. It is in final form, and is not modifications from Section 3.6. It is in final form and is not
further updated in this document. further updated in this document.
--------- ---------
Old text: (Section 8.2) Old text: (Section 8.2)
--------- ---------
When an outstanding TSN is acknowledged or a HEARTBEAT sent to that When an outstanding TSN is acknowledged or a HEARTBEAT sent to that
address is acknowledged with a HEARTBEAT ACK, the endpoint shall address is acknowledged with a HEARTBEAT ACK, the endpoint shall
clear the error counter of the destination transport address to which clear the error counter of the destination transport address to which
the DATA chunk was last sent (or HEARTBEAT was sent). When the peer the DATA chunk was last sent (or HEARTBEAT was sent). When the peer
skipping to change at page 36, line 28 skipping to change at page 34, line 37
ambiguity is undesirable, the transmitter may choose not to clear the ambiguity is undesirable, the transmitter may choose not to clear the
error counter if the last chunk sent was a retransmission. error counter if the last chunk sent was a retransmission.
--------- ---------
New text: (Section 8.2) New text: (Section 8.2)
--------- ---------
When an outstanding TSN is acknowledged or a HEARTBEAT sent to that When an outstanding TSN is acknowledged or a HEARTBEAT sent to that
address is acknowledged with a HEARTBEAT ACK, the endpoint SHOULD address is acknowledged with a HEARTBEAT ACK, the endpoint SHOULD
clear the error counter of the destination transport address to which clear the error counter of the destination transport address to which
the DATA chunk was last sent (or HEARTBEAT was sent), and SHOULD the DATA chunk was last sent (or HEARTBEAT was sent) and SHOULD also
also report to the upper layer when an inactive destination address report to the upper layer when an inactive destination address is
is marked as active. When the peer endpoint is multi-homed and the marked as active. When the peer endpoint is multi-homed and the last
last chunk sent to it was a retransmission to an alternate address, chunk sent to it was a retransmission to an alternate address, there
there exists an ambiguity as to whether or not the acknowledgement exists an ambiguity as to whether or not the acknowledgement could be
could be credited to the address of the last chunk sent. However, credited to the address of the last chunk sent. However, this
this ambiguity does not seem to bear any significant consequence to ambiguity does not seem to have significant consequences for SCTP
SCTP behavior. If this ambiguity is undesirable, the transmitter MAY behavior. If this ambiguity is undesirable, the transmitter MAY
choose not to clear the error counter if the last chunk sent was a choose not to clear the error counter if the last chunk sent was a
retransmission. retransmission.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 8.3) Old text: (Section 8.3)
--------- ---------
When the value of this counter reaches the protocol parameter When the value of this counter reaches the protocol parameter
'Path.Max.Retrans', the endpoint should mark the corresponding 'Path.Max.Retrans', the endpoint should mark the corresponding
destination address as inactive if it is not so marked, and may also destination address as inactive if it is not so marked, and may also
optionally report to the upper layer the change of reachability of optionally report to the upper layer the change of reachability of
this destination address. After this, the endpoint should continue this destination address. After this, the endpoint should continue
HEARTBEAT on this destination address but should stop increasing the HEARTBEAT on this destination address but should stop increasing the
counter. counter.
--------- ---------
New text: (Section 8.3) New text: (Section 8.3)
--------- ---------
When the value of this counter exceeds the protocol parameter When the value of this counter exceeds the protocol parameter
'Path.Max.Retrans', the endpoint SHOULD mark the corresponding 'Path.Max.Retrans', the endpoint SHOULD mark the corresponding
destination address as inactive if it is not so marked, and SHOULD destination address as inactive if it is not so marked and SHOULD
also report to the upper layer the change of reachability of this also report to the upper layer the change in reachability of this
destination address. After this, the endpoint SHOULD continue destination address. After this, the endpoint SHOULD continue
HEARTBEAT on this destination address but SHOULD stop increasing the HEARTBEAT on this destination address but SHOULD stop increasing the
counter. counter.
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.1. It is in final form, and is not modifications from Section 3.1. It is in final form and is not
further updated in this document. further updated in this document.
--------- ---------
Old text: (Section 8.3) Old text: (Section 8.3)
--------- ---------
Upon the receipt of the HEARTBEAT ACK, the sender of the HEARTBEAT Upon the receipt of the HEARTBEAT ACK, the sender of the HEARTBEAT
should clear the error counter of the destination transport address should clear the error counter of the destination transport address
to which the HEARTBEAT was sent, and mark the destination transport to which the HEARTBEAT was sent, and mark the destination transport
address as active if it is not so marked. The endpoint may address as active if it is not so marked. The endpoint may
skipping to change at page 38, line 24 skipping to change at page 35, line 52
address is marked as active due to the reception of the latest address is marked as active due to the reception of the latest
HEARTBEAT ACK. The receiver of the HEARTBEAT ACK must also clear the HEARTBEAT ACK. The receiver of the HEARTBEAT ACK must also clear the
association overall error count as well (as defined in Section 8.1). association overall error count as well (as defined in Section 8.1).
--------- ---------
New text: (Section 8.3) New text: (Section 8.3)
--------- ---------
Upon the receipt of the HEARTBEAT ACK, the sender of the HEARTBEAT Upon the receipt of the HEARTBEAT ACK, the sender of the HEARTBEAT
SHOULD clear the error counter of the destination transport address SHOULD clear the error counter of the destination transport address
to which the HEARTBEAT was sent, and mark the destination transport to which the HEARTBEAT was sent and mark the destination transport
address as active if it is not so marked. The endpoint SHOULD address as active if it is not so marked. The endpoint SHOULD report
report to the upper layer when an inactive destination address to the upper layer when an inactive destination address is marked as
is marked as active due to the reception of the latest active due to the reception of the latest HEARTBEAT ACK. The
HEARTBEAT ACK. The receiver of the HEARTBEAT ACK SHOULD also clear receiver of the HEARTBEAT ACK SHOULD also clear the association
the association overall error counter (as defined in Section 8.1). overall error count (as defined in Section 8.1).
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.13. It is in final form, and is not modifications from Section 3.13. It is in final form and is not
further updated in this document. further updated in this document.
--------- ---------
Old text: (Section 9.2) Old text: (Section 9.2)
--------- ---------
An endpoint should limit the number of retransmissions of the An endpoint should limit the number of retransmissions of the
SHUTDOWN chunk to the protocol parameter 'Association.Max.Retrans'. SHUTDOWN chunk to the protocol parameter 'Association.Max.Retrans'.
If this threshold is exceeded, the endpoint should destroy the TCB If this threshold is exceeded, the endpoint should destroy the TCB
and MUST report the peer endpoint unreachable to the upper layer (and and MUST report the peer endpoint unreachable to the upper layer (and
skipping to change at page 39, line 25 skipping to change at page 36, line 34
--------- ---------
New text: (Section 9.2) New text: (Section 9.2)
--------- ---------
An endpoint SHOULD limit the number of retransmissions of the An endpoint SHOULD limit the number of retransmissions of the
SHUTDOWN chunk to the protocol parameter 'Association.Max.Retrans'. SHUTDOWN chunk to the protocol parameter 'Association.Max.Retrans'.
If this threshold is exceeded, the endpoint SHOULD destroy the TCB If this threshold is exceeded, the endpoint SHOULD destroy the TCB
and SHOULD report the peer endpoint unreachable to the upper layer and SHOULD report the peer endpoint unreachable to the upper layer
(and thus the association enters the CLOSED state). (and thus the association enters the CLOSED state).
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 9.2) Old text: (Section 9.2)
--------- ---------
The sender of the SHUTDOWN ACK should limit the number of The sender of the SHUTDOWN ACK should limit the number of
retransmissions of the SHUTDOWN ACK chunk to the protocol parameter retransmissions of the SHUTDOWN ACK chunk to the protocol parameter
'Association.Max.Retrans'. If this threshold is exceeded, the 'Association.Max.Retrans'. If this threshold is exceeded, the
endpoint should destroy the TCB and may report the peer endpoint endpoint should destroy the TCB and may report the peer endpoint
unreachable to the upper layer (and thus the association enters the unreachable to the upper layer (and thus the association enters the
CLOSED state). CLOSED state).
--------- ---------
New text: (Section 9.2) New text: (Section 9.2)
--------- ---------
The sender of the SHUTDOWN ACK SHOULD limit the number of The sender of the SHUTDOWN ACK SHOULD limit the number of
retransmissions of the SHUTDOWN ACK chunk to the protocol parameter retransmissions of the SHUTDOWN ACK chunk to the protocol parameter
'Association.Max.Retrans'. If this threshold is exceeded, the 'Association.Max.Retrans'. If this threshold is exceeded, the
endpoint SHOULD destroy the TCB and SHOULD report the peer endpoint endpoint SHOULD destroy the TCB and SHOULD report the peer endpoint
unreachable to the upper layer (and thus the association enters the unreachable to the upper layer (and thus the association enters the
CLOSED state). CLOSED state).
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.23.3. Solution Description 3.23.3. Solution Description
The inconsistencies are removed by using consistently SHOULD. The inconsistencies are removed by consistently using SHOULD.
3.24. SACK.Delay Not Listed as a Protocol Parameter 3.24. SACK.Delay Not Listed as a Protocol Parameter
3.24.1. Description of the Problem 3.24.1. Description of the Problem
SCTP as specified in [RFC4960] supports delaying SACKs. The timer SCTP as specified in [RFC4960] supports delaying SACKs. The timer
value for this is a parameter and Section 6.2 of [RFC4960] specifies value for this is a parameter, and Section 6.2 of [RFC4960] specifies
a default and maximum value for it. However, defining a name for a default and maximum value for it. However, (1) defining a name for
this parameter and listing it in the table of protocol parameters in this parameter and (2) listing it in the table of protocol parameters
Section 15 of [RFC4960] is missing. in Section 15 of [RFC4960] are missing.
This issue was reported as an Errata for [RFC4960] with Errata ID This issue was reported as an errata for [RFC4960] with
4656. Errata ID 4656.
3.24.2. Text Changes to the Document 3.24.2. Text Changes to the Document
--------- ---------
Old text: (Section 6.2) Old text: (Section 6.2)
--------- ---------
An implementation MUST NOT allow the maximum delay to be configured An implementation MUST NOT allow the maximum delay to be configured
to be more than 500 ms. In other words, an implementation MAY lower to be more than 500 ms. In other words, an implementation MAY lower
this value below 500 ms but MUST NOT raise it above 500 ms. this value below 500 ms but MUST NOT raise it above 500 ms.
--------- ---------
New text: (Section 6.2) New text: (Section 6.2)
--------- ---------
An implementation MUST NOT allow the maximum delay (protocol An implementation MUST NOT allow the maximum delay (protocol
parameter 'SACK.Delay') to be configured to be more than 500 ms. parameter 'SACK.Delay') to be configured to be more than 500 ms. In
In other words, an implementation MAY lower the value of other words, an implementation MAY lower the value of SACK.Delay
SACK.Delay below 500 ms but MUST NOT raise it above 500 ms. below 500 ms but MUST NOT raise it above 500 ms.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 15) Old text: (Section 15)
--------- ---------
The following protocol parameters are RECOMMENDED: The following protocol parameters are RECOMMENDED:
RTO.Initial - 3 seconds RTO.Initial - 3 seconds
RTO.Min - 1 second RTO.Min - 1 second
skipping to change at page 41, line 30 skipping to change at page 39, line 11
Max.Init.Retransmits - 8 attempts Max.Init.Retransmits - 8 attempts
HB.interval - 30 seconds HB.interval - 30 seconds
HB.Max.Burst - 1 HB.Max.Burst - 1
--------- ---------
New text: (Section 15) New text: (Section 15)
--------- ---------
The following protocol parameters are RECOMMENDED: The following protocol parameters are RECOMMENDED:
RTO.Initial - 3 seconds RTO.Initial: 3 seconds
RTO.Min - 1 second RTO.Min: 1 second
RTO.Max - 60 seconds RTO.Max: 60 seconds
Max.Burst - 4 Max.Burst: 4
RTO.Alpha - 1/8 RTO.Alpha: 1/8
RTO.Beta - 1/4 RTO.Beta: 1/4
Valid.Cookie.Life - 60 seconds Valid.Cookie.Life: 60 seconds
Association.Max.Retrans - 10 attempts Association.Max.Retrans: 10 attempts
Path.Max.Retrans - 5 attempts (per destination address) Path.Max.Retrans: 5 attempts (per destination address)
Max.Init.Retransmits - 8 attempts Max.Init.Retransmits: 8 attempts
HB.interval - 30 seconds HB.interval: 30 seconds
HB.Max.Burst - 1 HB.Max.Burst: 1
SACK.Delay - 200 milliseconds SACK.Delay: 200 milliseconds
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.32. updated in Section 3.32.
3.24.3. Solution Description 3.24.3. Solution Description
The parameter was given a name and added to the list of protocol The parameter is given the name 'SACK.Delay' and added to the list of
parameters. protocol parameters.
3.25. Processing of Chunks in an Incoming SCTP Packet 3.25. Processing of Chunks in an Incoming SCTP Packet
3.25.1. Description of the Problem 3.25.1. Description of the Problem
There are a few places in [RFC4960] where the receiver of a packet There are a few places in [RFC4960] where text specifies that the
must discard it while processing the chunks of the packet. It is receiver of a packet must discard it while processing the chunks of
unclear whether the receiver has to rollback state changes already the packet. Whether or not the receiver has to roll back state
performed while processing the packet or not. changes already performed while processing the packet is unclear.
The intention of [RFC4960] is to process an incoming packet chunk by The intention of [RFC4960] is to process an incoming packet chunk by
chunk and not to perform any prescreening of chunks in the received chunk and not to perform any prescreening of chunks in the received
packet. Thus, by discarding one chunk the receiver also causes packet. Thus, by discarding one chunk, the receiver also causes the
discarding of all further chunks. discarding of all further chunks.
3.25.2. Text Changes to the Document 3.25.2. Text Changes to the Document
--------- ---------
Old text: (Section 3.2) Old text: (Section 3.2)
--------- ---------
00 - Stop processing this SCTP packet and discard it, do not 00 - Stop processing this SCTP packet and discard it, do not
process any further chunks within it. process any further chunks within it.
01 - Stop processing this SCTP packet and discard it, do not 01 - Stop processing this SCTP packet and discard it, do not
process any further chunks within it, and report the process any further chunks within it, and report the
unrecognized chunk in an 'Unrecognized Chunk Type'. unrecognized chunk in an 'Unrecognized Chunk Type'.
--------- ---------
New text: (Section 3.2) New text: (Section 3.2)
--------- ---------
00 - Stop processing this SCTP packet, discard the unrecognized 00 - Stop processing this SCTP packet; discard the unrecognized
chunk and all further chunks. chunk and all further chunks.
01 - Stop processing this SCTP packet, discard the unrecognized 01 - Stop processing this SCTP packet, discard the unrecognized
chunk and all further chunks, and report the unrecognized chunk and all further chunks, and report the unrecognized
chunk in an 'Unrecognized Chunk Type'. chunk in an 'Unrecognized Chunk Type'.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 11.3) Old text: (Section 11.3)
--------- ---------
It is helpful for some firewalls if they can inspect just the first It is helpful for some firewalls if they can inspect just the first
fragment of a fragmented SCTP packet and unambiguously determine fragment of a fragmented SCTP packet and unambiguously determine
whether it corresponds to an INIT chunk (for further information, whether it corresponds to an INIT chunk (for further information,
please refer to [RFC1858]). Accordingly, we stress the requirements, please refer to [RFC1858]). Accordingly, we stress the requirements,
stated in Section 3.1, that (1) an INIT chunk MUST NOT be bundled stated in Section 3.1, that (1) an INIT chunk MUST NOT be bundled
with any other chunk in a packet, and (2) a packet containing an INIT with any other chunk in a packet, and (2) a packet containing an INIT
chunk MUST have a zero Verification Tag. Furthermore, we require chunk MUST have a zero Verification Tag. Furthermore, we require
that the receiver of an INIT chunk MUST enforce these rules by that the receiver of an INIT chunk MUST enforce these rules by
silently discarding an arriving packet with an INIT chunk that is silently discarding an arriving packet with an INIT chunk that is
bundled with other chunks or has a non-zero verification tag and bundled with other chunks or has a non-zero verification tag and
contains an INIT-chunk. contains an INIT-chunk.
--------- ---------
New text: (Section 11.3) New text: (Section 11.3)
--------- ---------
It is helpful for some firewalls if they can inspect just the first It is helpful for some firewalls if they can inspect just the first
fragment of a fragmented SCTP packet and unambiguously determine fragment of a fragmented SCTP packet and unambiguously determine
whether it corresponds to an INIT chunk (for further information, whether it corresponds to an INIT chunk (for further information,
please refer to [RFC1858]). Accordingly, we stress the requirements, please refer to [RFC1858]). Accordingly, we stress the requirements,
stated in Section 3.1, that (1) an INIT chunk MUST NOT be bundled as stated in Section 3.1, that (1) an INIT chunk MUST NOT be bundled
with any other chunk in a packet, and (2) a packet containing an INIT with any other chunk in a packet and (2) a packet containing an INIT
chunk MUST have a zero Verification Tag. chunk MUST have a zero Verification Tag. The receiver of an INIT
The receiver of an INIT chunk MUST silently discard the INIT chunk and chunk MUST silently discard the INIT chunk and all further chunks if
all further chunks if the INIT chunk is bundled with other chunks or the INIT chunk is bundled with other chunks or the packet has a
the packet has a non-zero verification tag. non-zero Verification Tag.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.25.3. Solution Description 3.25.3. Solution Description
The new text makes it clear that chunks can be processed from the The new text makes it clear that chunks can be processed from the
beginning to the end and no rollback or pre-screening is required. beginning to the end and that no rollback or prescreening is
required.
3.26. CWND Increase in Congestion Avoidance Phase 3.26. Increasing the cwnd in the Congestion Avoidance Phase
3.26.1. Description of the Problem 3.26.1. Description of the Problem
[RFC4960] in Section 7.2.2 prescribes to increase cwnd by 1*MTU per Section 7.2.2 of [RFC4960] prescribes that cwnd be increased by 1*MTU
RTT if the sender has cwnd or more bytes of data outstanding to the per RTT if the sender has cwnd or more bytes of data outstanding to
corresponding address in the Congestion Avoidance phase. However, the corresponding address in the congestion avoidance phase.
this is described without normative language. Moreover, However, this is described without normative language. Moreover,
Section 7.2.2 includes an algorithm how an implementation can achieve Section 7.2.2 of [RFC4960] includes an algorithm that specifies how
this but this algorithm is underspecified and actually allows an implementation can achieve this, but this algorithm is
increasing cwnd by more than 1*MTU per RTT. underspecified and actually allows increasing cwnd by more than 1*MTU
per RTT.
3.26.2. Text Changes to the Document 3.26.2. Text Changes to the Document
--------- ---------
Old text: (Section 7.2.2) Old text: (Section 7.2.2)
--------- ---------
When cwnd is greater than ssthresh, cwnd should be incremented by When cwnd is greater than ssthresh, cwnd should be incremented by
1*MTU per RTT if the sender has cwnd or more bytes of data 1*MTU per RTT if the sender has cwnd or more bytes of data
outstanding for the corresponding transport address. outstanding for the corresponding transport address.
--------- ---------
New text: (Section 7.2.2) New text: (Section 7.2.2)
--------- ---------
When cwnd is greater than ssthresh, cwnd SHOULD be incremented by When cwnd is greater than ssthresh, cwnd SHOULD be incremented by
1*MTU per RTT if the sender has cwnd or more bytes of data 1*MTU per RTT if the sender has cwnd or more bytes of data
outstanding for the corresponding transport address. The basic outstanding for the corresponding transport address. The basic
guidelines for incrementing cwnd during congestion avoidance are: guidelines for incrementing cwnd during congestion avoidance are as
follows:
o SCTP MAY increment cwnd by 1*MTU. o SCTP MAY increment cwnd by 1*MTU.
o SCTP SHOULD increment cwnd by one 1*MTU once per RTT when o SCTP SHOULD increment cwnd by 1*MTU once per RTT when the sender
the sender has cwnd or more bytes of data outstanding for has cwnd or more bytes of data outstanding for the corresponding
the corresponding transport address. transport address.
o SCTP MUST NOT increment cwnd by more than 1*MTU per RTT. o SCTP MUST NOT increment cwnd by more than 1*MTU per RTT.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 7.2.2) Old text: (Section 7.2.2)
--------- ---------
o Whenever cwnd is greater than ssthresh, upon each SACK arrival o Whenever cwnd is greater than ssthresh, upon each SACK arrival
that advances the Cumulative TSN Ack Point, increase that advances the Cumulative TSN Ack Point, increase
partial_bytes_acked by the total number of bytes of all new chunks partial_bytes_acked by the total number of bytes of all new chunks
acknowledged in that SACK including chunks acknowledged by the new acknowledged in that SACK including chunks acknowledged by the new
skipping to change at page 45, line 27 skipping to change at page 42, line 48
of data outstanding (i.e., before arrival of the SACK, flightsize of data outstanding (i.e., before arrival of the SACK, flightsize
was greater than or equal to cwnd), increase cwnd by MTU, and was greater than or equal to cwnd), increase cwnd by MTU, and
reset partial_bytes_acked to (partial_bytes_acked - cwnd). reset partial_bytes_acked to (partial_bytes_acked - cwnd).
--------- ---------
New text: (Section 7.2.2) New text: (Section 7.2.2)
--------- ---------
o Whenever cwnd is greater than ssthresh, upon each SACK arrival, o Whenever cwnd is greater than ssthresh, upon each SACK arrival,
increase partial_bytes_acked by the total number of bytes of all increase partial_bytes_acked by the total number of bytes of all
new chunks acknowledged in that SACK including chunks acknowledged new chunks acknowledged in that SACK, including chunks
by the new Cumulative TSN Ack, by Gap Ack Blocks and by the number acknowledged by the new Cumulative TSN Ack, by Gap Ack Blocks,
of bytes of duplicated chunks reported in Duplicate TSNs. and by the number of bytes of duplicated chunks reported in
Duplicate TSNs.
o When partial_bytes_acked is greater than cwnd and before the o (1) when partial_bytes_acked is greater than cwnd and (2) before
arrival of the SACK the sender had less than cwnd bytes of data the arrival of the SACK the sender had less than cwnd bytes of
outstanding (i.e., before arrival of the SACK, flightsize was less data outstanding (i.e., before the arrival of the SACK, flightsize
than cwnd), reset partial_bytes_acked to cwnd. was less than cwnd), reset partial_bytes_acked to cwnd.
o When partial_bytes_acked is equal to or greater than cwnd and o (1) when partial_bytes_acked is equal to or greater than cwnd and
before the arrival of the SACK the sender had cwnd or more bytes (2) before the arrival of the SACK the sender had cwnd or more
of data outstanding (i.e., before arrival of the SACK, flightsize bytes of data outstanding (i.e., before the arrival of the SACK,
was greater than or equal to cwnd), partial_bytes_acked is reset flightsize was greater than or equal to cwnd), partial_bytes_acked
to (partial_bytes_acked - cwnd). Next, cwnd is increased by 1*MTU. is reset to (partial_bytes_acked - cwnd). Next, cwnd is increased
by 1*MTU.
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.12 and Section 3.22. It is in final modifications from Sections 3.12 and 3.22. It is in final form and
form, and is not further updated in this document. is not further updated in this document.
3.26.3. Solution Description 3.26.3. Solution Description
The basic guidelines for incrementing cwnd during the congestion The basic guidelines for incrementing cwnd during the congestion
avoidance phase are added into Section 7.2.2. The guidelines include avoidance phase are added into Section 7.2.2. The guidelines include
the normative language and are aligned with [RFC5681]. the normative language and are aligned with [RFC5681].
The algorithm from Section 7.2.2 is improved to not allow increasing The algorithm from Section 7.2.2 is improved and now does not allow
cwnd by more than 1*MTU per RTT. increasing cwnd by more than 1*MTU per RTT.
3.27. Refresh of cwnd and ssthresh after Idle Period 3.27. Refresh of cwnd and ssthresh after Idle Period
3.27.1. Description of the Problem 3.27.1. Description of the Problem
[RFC4960] prescribes to adjust cwnd per RTO if the endpoint does not [RFC4960] prescribes that cwnd per RTO be adjusted if the endpoint
transmit data on a given transport address. In addition to that, it does not transmit data on a given transport address. In addition to
prescribes to set cwnd to the initial value after a sufficiently long that, it prescribes that cwnd be set to the initial value after a
idle period. The latter is excessive. Moreover, it is unclear what sufficiently long idle period. The latter is excessive. Moreover,
is a sufficiently long idle period. what is considered a sufficiently long idle period is unclear.
[RFC4960] doesn't specify the handling of ssthresh in the idle case. [RFC4960] doesn't specify the handling of ssthresh in the idle case.
If ssthresh is reduced due to a packet loss, ssthresh is never If ssthresh is reduced due to packet loss, ssthresh is never
recovered. So traffic can end up in Congestion Avoidance all the recovered. So, traffic can end up in congestion avoidance all the
time, resulting in a low sending rate and bad performance. The time, resulting in a low sending rate and bad performance. The
problem is even more serious for SCTP because in a multi-homed SCTP problem is even more serious for SCTP: in a multi-homed SCTP
association traffic that switches back to the previously failed association, traffic that switches back to the previously failed
primary path will also lead to the situation where traffic ends up in primary path will also lead to the situation where traffic ends up in
Congestion Avoidance. congestion avoidance.
3.27.2. Text Changes to the Document 3.27.2. Text Changes to the Document
--------- ---------
Old text: (Section 7.2.1) Old text: (Section 7.2.1)
--------- ---------
o The initial cwnd before DATA transmission or after a sufficiently o The initial cwnd before DATA transmission or after a sufficiently
long idle period MUST be set to min(4*MTU, max (2*MTU, 4380 long idle period MUST be set to min(4*MTU, max (2*MTU, 4380
bytes)). bytes)).
--------- ---------
New text: (Section 7.2.1) New text: (Section 7.2.1)
--------- ---------
o The initial cwnd before DATA transmission MUST be set to o The initial cwnd before data transmission MUST be set to
min(4*MTU, max (2*MTU, 4380 bytes)). min(4*MTU, max (2*MTU, 4380 bytes)).
--------- ---------
Old text: (Section 7.2.1) Old text: (Section 7.2.1)
--------- ---------
o When the endpoint does not transmit data on a given transport o When the endpoint does not transmit data on a given transport
address, the cwnd of the transport address should be adjusted to address, the cwnd of the transport address should be adjusted to
max(cwnd/2, 4*MTU) per RTO. max(cwnd/2, 4*MTU) per RTO.
skipping to change at page 47, line 16 skipping to change at page 44, line 33
Old text: (Section 7.2.1) Old text: (Section 7.2.1)
--------- ---------
o When the endpoint does not transmit data on a given transport o When the endpoint does not transmit data on a given transport
address, the cwnd of the transport address should be adjusted to address, the cwnd of the transport address should be adjusted to
max(cwnd/2, 4*MTU) per RTO. max(cwnd/2, 4*MTU) per RTO.
--------- ---------
New text: (Section 7.2.1) New text: (Section 7.2.1)
--------- ---------
o While the endpoint does not transmit data on a given transport o While the endpoint does not transmit data on a given transport
address, the cwnd of the transport address SHOULD be adjusted to address, the cwnd of the transport address SHOULD be adjusted to
max(cwnd/2, 4*MTU) once per RTO. Before the first cwnd adjustment, max(cwnd/2, 4*MTU) once per RTO. Before the first cwnd
the ssthresh of the transport address SHOULD be set to the cwnd. adjustment, the ssthresh of the transport address SHOULD be set to
the cwnd.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.27.3. Solution Description 3.27.3. Solution Description
A rule about cwnd adjustment after a sufficiently long idle period is A rule about cwnd adjustment after a sufficiently long idle period is
removed. removed.
The text is updated to describe the ssthresh handling. When the idle The text is updated to describe the handling of ssthresh. When the
period is detected, the cwnd value is stored to the ssthresh value. idle period is detected, the cwnd value is copied to ssthresh.
3.28. Window Updates After Receiver Window Opens Up 3.28. Window Updates after Receiver Window Opens Up
3.28.1. Description of the Problem 3.28.1. Description of the Problem
The sending of SACK chunks for window updates is only indirectly The sending of SACK chunks for window updates is only indirectly
referenced in [RFC4960], Section 6.2, where it is stated that an SCTP referenced in Section 6.2 of [RFC4960], which states that an SCTP
receiver must not generate more than one SACK for every incoming receiver must not generate more than one SACK for every incoming
packet, other than to update the offered window. packet, other than to update the offered window.
However, the sending of window updates when the receiver window opens However, to avoid performance problems, it is necessary to send the
up is necessary to avoid performance problems. window updates when the receiver window opens up.
3.28.2. Text Changes to the Document 3.28.2. Text Changes to the Document
--------- ---------
Old text: (Section 6.2) Old text: (Section 6.2)
--------- ---------
An SCTP receiver MUST NOT generate more than one SACK for every An SCTP receiver MUST NOT generate more than one SACK for every
incoming packet, other than to update the offered window as the incoming packet, other than to update the offered window as the
receiving application consumes new data. receiving application consumes new data.
--------- ---------
New text: (Section 6.2) New text: (Section 6.2)
skipping to change at page 48, line 18 skipping to change at page 45, line 33
An SCTP receiver MUST NOT generate more than one SACK for every An SCTP receiver MUST NOT generate more than one SACK for every
incoming packet, other than to update the offered window as the incoming packet, other than to update the offered window as the
receiving application consumes new data. receiving application consumes new data.
--------- ---------
New text: (Section 6.2) New text: (Section 6.2)
--------- ---------
An SCTP receiver MUST NOT generate more than one SACK for every An SCTP receiver MUST NOT generate more than one SACK for every
incoming packet, other than to update the offered window as the incoming packet, other than to update the offered window as the
receiving application consumes new data. When the window opens receiving application consumes new data. When the window opens up,
up, an SCTP receiver SHOULD send additional SACK chunks to update an SCTP receiver SHOULD send additional SACK chunks to update the
the window even if no new data is received. window even if no new data is received. The receiver MUST avoid
The receiver MUST avoid sending a large number of window updates, sending a large number of window updates -- in particular, large
in particular large bursts of them. bursts of them. One way to achieve this is to send a window update
One way to achieve this is to send a window update only if the only if the window can be increased by at least a quarter of the
window can be increased by at least a quarter of the receive receive buffer size of the association.
buffer size of the association.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.28.3. Solution Description 3.28.3. Solution Description
The new text makes clear that additional SACK chunks for window The new text makes it clear that additional SACK chunks for window
updates should be sent as long as excessive bursts are avoided. updates should be sent as long as excessive bursts are avoided.
3.29. Path of DATA and Reply Chunks 3.29. Path of DATA and Reply Chunks
3.29.1. Description of the Problem 3.29.1. Description of the Problem
Section 6.4 of [RFC4960] describes the transmission policy for multi- Section 6.4 of [RFC4960] describes the transmission policy for
homed SCTP endpoints. However, there are the following issues with multi-homed SCTP endpoints. However, this policy has the following
it: issues:
o It states that a SACK should be sent to the source address of an o It states that a SACK should be sent to the source address of an
incoming DATA. However, it is known that other SACK policies incoming DATA. However, it is known that other SACK policies
(e.g. sending SACKs always to the primary path) may be more (e.g., always sending SACKs to the primary path) may be more
beneficial in some situations. beneficial in some situations.
o Initially it states that an endpoint should always transmit DATA
chunks to the primary path. Then it states that the rule for o Also, it initially states that an endpoint should always transmit
transmittal of reply chunks should also be followed if the DATA chunks to the primary path but then states that the rule for
endpoint is bundling DATA chunks together with the reply chunk the transmittal of reply chunks should also be followed if the
which contradicts with the first statement to always transmit DATA endpoint is bundling DATA chunks together with the reply chunk.
chunks to the primary path. Some implementations were having The second statement contradicts the first statement. Some
problems with it and sent DATA chunks bundled with reply chunks to implementations were having problems with it and sent DATA chunks
a different destination address than the primary path that caused bundled with reply chunks to a different destination address than
many gaps. the primary path, causing many gaps.
3.29.2. Text Changes to the Document 3.29.2. Text Changes to the Document
Old text: (Section 6.4) ---------
Old text: (Section 6.4)
---------
An endpoint SHOULD transmit reply chunks (e.g., SACK, HEARTBEAT ACK, An endpoint SHOULD transmit reply chunks (e.g., SACK, HEARTBEAT ACK,
etc.) to the same destination transport address from which it etc.) to the same destination transport address from which it
received the DATA or control chunk to which it is replying. This received the DATA or control chunk to which it is replying. This
rule should also be followed if the endpoint is bundling DATA chunks rule should also be followed if the endpoint is bundling DATA chunks
together with the reply chunk. together with the reply chunk.
However, when acknowledging multiple DATA chunks received in packets However, when acknowledging multiple DATA chunks received in packets
from different source addresses in a single SACK, the SACK chunk may from different source addresses in a single SACK, the SACK chunk may
be transmitted to one of the destination transport addresses from be transmitted to one of the destination transport addresses from
which the DATA or control chunks being acknowledged were received. which the DATA or control chunks being acknowledged were received.
New text: (Section 6.4) ---------
New text: (Section 6.4)
---------
An endpoint SHOULD transmit reply chunks (e.g., INIT ACK, COOKIE ACK, An endpoint SHOULD transmit reply chunks (e.g., INIT ACK, COOKIE ACK,
HEARTBEAT ACK, etc.) in response to control chunks to the same HEARTBEAT ACK) in response to control chunks to the same destination
destination transport address from which it received the control transport address from which it received the control chunk to which
chunk to which it is replying. it is replying.
The selection of the destination transport address for packets The selection of the destination transport address for packets
containing SACK chunks is implementation dependent. However, an endpoint containing SACK chunks is implementation dependent. However, an
SHOULD NOT vary the destination transport address of a SACK when it endpoint SHOULD NOT vary the destination transport address of a SACK
receives DATA chunks coming from the same source address. when it receives DATA chunks coming from the same source address.
When acknowledging multiple DATA chunks received in packets When acknowledging multiple DATA chunks received in packets from
from different source addresses in a single SACK, the SACK chunk MAY different source addresses in a single SACK, the SACK chunk MAY be
be transmitted to one of the destination transport addresses from transmitted to one of the destination transport addresses from which
which the DATA or control chunks being acknowledged were received. the DATA or control chunks being acknowledged were received.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.29.3. Solution Description 3.29.3. Solution Description
The SACK transmission policy is left implementation dependent but it The SACK transmission policy is left implementation dependent, but
is specified to not vary the destination address of a packet the new text now specifies that the policy not vary the destination
containing a SACK chunk unless there are reasons for it as it may address of a packet containing a SACK chunk unless there are reasons
negatively impact RTT measurement. for not doing so, as varying the destination address may negatively
impact RTT measurement.
A confusing statement that prescribes to follow the rule for New text removes a confusing statement that prescribes following the
transmittal of reply chunks when the endpoint is bundling DATA chunks rule for transmittal of reply chunks when the endpoint is bundling
together with the reply chunk is removed. DATA chunks together with the reply chunk.
3.30. Outstanding Data, Flightsize and Data In Flight Key Terms 3.30. "Outstanding Data", "Flightsize", and "Data in Flight" Key Terms
3.30.1. Description of the Problem 3.30.1. Description of the Problem
[RFC4960] uses outstanding data, flightsize and data in flight key [RFC4960] uses the key terms "outstanding data", "flightsize", and
terms in formulas and statements but their definitions are not "data in flight" in formulas and statements, but Section 1.3
provided in Section 1.3. Furthermore, outstanding data does not ("Key Terms") of [RFC4960] does not provide their definitions.
include DATA chunks which are classified as lost but which have not Furthermore, outstanding data does not include DATA chunks that are
been retransmitted yet and there is a paragraph in Section 6.1 of classified as lost but that have not yet been retransmitted, and
[RFC4960] where this statement is broken. there is a paragraph in Section 6.1 of [RFC4960] where this statement
is broken.
3.30.2. Text Changes to the Document 3.30.2. Text Changes to the Document
--------- ---------
Old text: (Section 1.3) Old text: (Section 1.3)
--------- ---------
o Congestion window (cwnd): An SCTP variable that limits the data, o Congestion window (cwnd): An SCTP variable that limits the data,
in number of bytes, a sender can send to a particular destination in number of bytes, a sender can send to a particular destination
transport address before receiving an acknowledgement. transport address before receiving an acknowledgement.
... ...
skipping to change at page 51, line 22 skipping to change at page 48, line 13
... ...
o Outstanding TSN (at an SCTP endpoint): A TSN (and the associated o Outstanding TSN (at an SCTP endpoint): A TSN (and the associated
DATA chunk) that has been sent by the endpoint but for which it DATA chunk) that has been sent by the endpoint but for which it
has not yet received an acknowledgement. has not yet received an acknowledgement.
--------- ---------
New text: (Section 1.3) New text: (Section 1.3)
--------- ---------
o Outstanding TSN (at an SCTP endpoint): A TSN (and the associated o Congestion window (cwnd): An SCTP variable that limits outstanding
DATA chunk) that has been sent by the endpoint but for which it data, in number of bytes, that a sender can send to a particular
has not yet received an acknowledgement. destination transport address before receiving an acknowledgement.
o Outstanding data (or Data outstanding or Data in flight): The ...
total amount of the DATA chunks associated with outstanding TSNs.
A retransmitted DATA chunk is counted once in outstanding data.
A DATA chunk which is classified as lost but which has not been
retransmitted yet is not in outstanding data.
o Flightsize: The amount of bytes of outstanding data to a o Flightsize: The amount of bytes of outstanding data to a
particular destination transport address at any given time. particular destination transport address at any given time.
o Congestion window (cwnd): An SCTP variable that limits outstanding ...
data, in number of bytes, a sender can send to a particular
destination transport address before receiving an acknowledgement.
This text is in final form, and is not further updated in this o Outstanding data (or "data outstanding" or "data in flight"): The
total amount of the DATA chunks associated with outstanding TSNs.
A retransmitted DATA chunk is counted once in outstanding data. A
DATA chunk that is classified as lost but that has not yet been
retransmitted is not in outstanding data.
o Outstanding TSN (at an SCTP endpoint): A TSN (and the associated
DATA chunk) that has been sent by the endpoint but for which it
has not yet received an acknowledgement.
This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 6.1) Old text: (Section 6.1)
--------- ---------
C) When the time comes for the sender to transmit, before sending new C) When the time comes for the sender to transmit, before sending new
DATA chunks, the sender MUST first transmit any outstanding DATA DATA chunks, the sender MUST first transmit any outstanding DATA
chunks that are marked for retransmission (limited by the current chunks that are marked for retransmission (limited by the current
cwnd). cwnd).
--------- ---------
New text: (Section 6.1) New text: (Section 6.1)
--------- ---------
C) When the time comes for the sender to transmit, before sending new C) When the time comes for the sender to transmit, before sending new
DATA chunks, the sender MUST first transmit any DATA chunks that DATA chunks, the sender MUST first transmit any DATA chunks that
are marked for retransmission (limited by the current cwnd). are marked for retransmission (limited by the current cwnd).
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.30.3. Solution Description 3.30.3. Solution Description
Now Section 1.3, Key Terms, includes explanations of outstanding Section 1.3 is corrected to include explanations of the key terms
data, data in flight and flightsize key terms. Section 6.1 is "outstanding data", "data in flight", and "flightsize". Section 6.1
corrected to properly use the outstanding data term. is corrected to now use "any DATA chunks" instead of "any outstanding
DATA chunks".
3.31. CWND Degradation due to Max.Burst 3.31. Degradation of cwnd due to Max.Burst
3.31.1. Description of the Problem 3.31.1. Description of the Problem
Some implementations were experiencing a degradation of cwnd because Some implementations were experiencing a degradation of cwnd because
of the Max.Burst limit. This was due to misinterpretation of the of the Max.Burst limit. This was due to misinterpretation of the
suggestion in [RFC4960], Section 6.1, on how to use the Max.Burst suggestion in Section 6.1 of [RFC4960] regarding how to use the
parameter when calculating the number of packets to transmit. Max.Burst parameter when calculating the number of packets to
transmit.
3.31.2. Text Changes to the Document 3.31.2. Text Changes to the Document
--------- ---------
Old text: (Section 6.1) Old text: (Section 6.1)
--------- ---------
D) When the time comes for the sender to transmit new DATA chunks, D) When the time comes for the sender to transmit new DATA chunks,
the protocol parameter Max.Burst SHOULD be used to limit the the protocol parameter Max.Burst SHOULD be used to limit the
number of packets sent. The limit MAY be applied by adjusting number of packets sent. The limit MAY be applied by adjusting
cwnd as follows: cwnd as follows:
if((flightsize + Max.Burst*MTU) < cwnd) cwnd = flightsize + if((flightsize + Max.Burst*MTU) < cwnd) cwnd = flightsize +
skipping to change at page 53, line 26 skipping to change at page 49, line 49
Or it MAY be applied by strictly limiting the number of packets Or it MAY be applied by strictly limiting the number of packets
emitted by the output routine. emitted by the output routine.
--------- ---------
New text: (Section 6.1) New text: (Section 6.1)
--------- ---------
D) When the time comes for the sender to transmit new DATA chunks, D) When the time comes for the sender to transmit new DATA chunks,
the protocol parameter Max.Burst SHOULD be used to limit the the protocol parameter Max.Burst SHOULD be used to limit the
number of packets sent. The limit MAY be applied by adjusting number of packets sent. The limit MAY be applied by adjusting
cwnd temporarily as follows: cwnd temporarily, as follows:
if ((flightsize + Max.Burst*MTU) < cwnd) if ((flightsize + Max.Burst*MTU) < cwnd)
cwnd = flightsize + Max.Burst*MTU cwnd = flightsize + Max.Burst*MTU
Or it MAY be applied by strictly limiting the number of packets Or, it MAY be applied by strictly limiting the number of packets
emitted by the output routine. When calculating the number of emitted by the output routine. When calculating the number of
packets to transmit and particularly using the formula above, packets to transmit, and particularly when using the formula
cwnd SHOULD NOT be changed permanently. above, cwnd SHOULD NOT be changed permanently.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.31.3. Solution Description 3.31.3. Solution Description
The new text clarifies that cwnd should not be changed when applying The new text clarifies that cwnd should not be changed when applying
the Max.Burst limit. This mitigates packet bursts related to the the Max.Burst limit. This mitigates packet bursts related to the
reception of SACK chunks, but not bursts related to an application reception of SACK chunks but not bursts related to an application
sending a burst of user messages. sending a burst of user messages.
3.32. Reduction of RTO.Initial 3.32. Reduction of RTO.Initial
3.32.1. Description of the Problem 3.32.1. Description of the Problem
[RFC4960] uses 3 seconds as the default value for RTO.Initial in [RFC4960] uses 3 seconds as the default value for RTO.Initial in
accordance with Section 4.3.2.1 of [RFC1122]. [RFC6298] updates accordance with Section 4.2.3.1 of [RFC1122]. [RFC6298] updates
[RFC1122] and lowers the initial value of the retransmission timer [RFC1122] and lowers the initial value of the retransmission timer
from 3 seconds to 1 second. from 3 seconds to 1 second.
3.32.2. Text Changes to the Document 3.32.2. Text Changes to the Document
--------- ---------
Old text: (Section 15) Old text: (Section 15)
--------- ---------
The following protocol parameters are RECOMMENDED: The following protocol parameters are RECOMMENDED:
skipping to change at page 54, line 38 skipping to change at page 51, line 11
Max.Init.Retransmits - 8 attempts Max.Init.Retransmits - 8 attempts
HB.interval - 30 seconds HB.interval - 30 seconds
HB.Max.Burst - 1 HB.Max.Burst - 1
--------- ---------
New text: (Section 15) New text: (Section 15)
--------- ---------
The following protocol parameters are RECOMMENDED: The following protocol parameters are RECOMMENDED:
RTO.Initial - 1 second RTO.Initial: 1 second
RTO.Min - 1 second RTO.Min: 1 second
RTO.Max - 60 seconds RTO.Max: 60 seconds
Max.Burst - 4 Max.Burst: 4
RTO.Alpha - 1/8 RTO.Alpha: 1/8
RTO.Beta - 1/4 RTO.Beta: 1/4
Valid.Cookie.Life - 60 seconds Valid.Cookie.Life: 60 seconds
Association.Max.Retrans - 10 attempts Association.Max.Retrans: 10 attempts
Path.Max.Retrans - 5 attempts (per destination address) Path.Max.Retrans: 5 attempts (per destination address)
Max.Init.Retransmits - 8 attempts Max.Init.Retransmits: 8 attempts
HB.interval - 30 seconds HB.interval: 30 seconds
HB.Max.Burst - 1 HB.Max.Burst: 1
SACK.Delay - 200 milliseconds SACK.Delay: 200 milliseconds
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.24. It is in final form, and is not modifications from Section 3.24. It is in final form and is not
further updated in this document. further updated in this document.
3.32.3. Solution Description 3.32.3. Solution Description
The value RTO.Initial has been lowered to 1 second to be in tune with The default value for RTO.Initial has been lowered to 1 second to be
[RFC6298]. in tune with [RFC6298].
3.33. Ordering of Bundled SACK and ERROR Chunks 3.33. Ordering of Bundled SACK and ERROR Chunks
3.33.1. Description of the Problem 3.33.1. Description of the Problem
When an SCTP endpoint receives a DATA chunk with an invalid stream When an SCTP endpoint receives a DATA chunk with an invalid stream
identifier it shall acknowledge it by sending a SACK chunk and identifier, it shall acknowledge it by sending a SACK chunk and
indicate that the stream identifier was invalid by sending an ERROR indicate that the stream identifier was invalid by sending an ERROR
chunk. These two chunks may be bundled. However, [RFC4960] requires chunk. These two chunks may be bundled. However, in the case of
in case of bundling that the ERROR chunk follows the SACK chunk. bundling, [RFC4960] requires that the ERROR chunk follow the SACK
This restriction of the ordering is not necessary and might only chunk. This restriction regarding the ordering of the chunks is not
limit interoperability. necessary and might limit interoperability.
3.33.2. Text Changes to the Document 3.33.2. Text Changes to the Document
--------- ---------
Old text: (Section 6.5) Old text: (Section 6.5)
--------- ---------
Every DATA chunk MUST carry a valid stream identifier. If an Every DATA chunk MUST carry a valid stream identifier. If an
endpoint receives a DATA chunk with an invalid stream identifier, it endpoint receives a DATA chunk with an invalid stream identifier, it
shall acknowledge the reception of the DATA chunk following the shall acknowledge the reception of the DATA chunk following the
normal procedure, immediately send an ERROR chunk with cause set to normal procedure, immediately send an ERROR chunk with cause set to
"Invalid Stream Identifier" (see Section 3.3.10), and discard the "Invalid Stream Identifier" (see Section 3.3.10), and discard the
DATA chunk. The endpoint may bundle the ERROR chunk in the same DATA chunk. The endpoint may bundle the ERROR chunk in the same
packet as the SACK as long as the ERROR follows the SACK. packet as the SACK as long as the ERROR follows the SACK.
--------- ---------
New text: (Section 6.5) New text: (Section 6.5)
--------- ---------
Every DATA chunk MUST carry a valid stream identifier. If an Every DATA chunk MUST carry a valid stream identifier. If an
endpoint receives a DATA chunk with an invalid stream identifier, it endpoint receives a DATA chunk with an invalid stream identifier, it
SHOULD acknowledge the reception of the DATA chunk following the SHOULD acknowledge the reception of the DATA chunk following the
normal procedure, immediately send an ERROR chunk with cause set to normal procedure, immediately send an ERROR chunk with cause set to
"Invalid Stream Identifier" (see Section 3.3.10), and discard the "Invalid Stream Identifier" (see Section 3.3.10), and discard the
DATA chunk. The endpoint MAY bundle the ERROR chunk and the SACK Chunk DATA chunk. The endpoint MAY bundle the ERROR chunk and the SACK
in the same packet. chunk in the same packet.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.33.3. Solution Description 3.33.3. Solution Description
The unnecessary restriction regarding the ordering of the SACK and The unnecessary restriction regarding the ordering of the SACK and
ERROR chunk has been removed. ERROR chunks has been removed.
3.34. Undefined Parameter Returned by RECEIVE Primitive 3.34. Undefined Parameter Returned by RECEIVE Primitive
3.34.1. Description of the Problem 3.34.1. Description of the Problem
[RFC4960] provides a description of an abstract API. In the [RFC4960] provides a description of an abstract API. In the
definition of the RECEIVE primitive an optional parameter with name definition of the RECEIVE primitive, an optional parameter with name
"delivery number" is mentioned. However, no definition of this "delivery number" is mentioned. However, no definition of this
parameter is given in [RFC4960] and the parameter is unnecessary. parameter is given in [RFC4960], and the parameter is unnecessary.
3.34.2. Text Changes to the Document 3.34.2. Text Changes to the Document
--------- ---------
Old text: (Section 10.1 G)) Old text: (Section 10.1 G))
--------- ---------
G) Receive G) Receive
Format: RECEIVE(association id, buffer address, buffer size Format: RECEIVE(association id, buffer address, buffer size
skipping to change at page 56, line 46 skipping to change at page 53, line 29
New text: (Section 10.1 G)) New text: (Section 10.1 G))
--------- ---------
G) Receive G) Receive
Format: RECEIVE(association id, buffer address, buffer size Format: RECEIVE(association id, buffer address, buffer size
[,stream id]) [,stream id])
-> byte count [,transport address] [,stream id] [,stream sequence -> byte count [,transport address] [,stream id] [,stream sequence
number] [,partial flag] [,payload protocol-id] number] [,partial flag] [,payload protocol-id]
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.34.3. Solution Description 3.34.3. Solution Description
The undefined parameter has been removed. The undefined parameter has been removed.
3.35. DSCP Changes 3.35. DSCP Changes
3.35.1. Description of the Problem 3.35.1. Description of the Problem
The upper layer can change the Differentiated Services Code Point The upper layer can change the Differentiated Services Code Point
(DSCP) used for packets being sent. A change of the DSCP can result (DSCP) used for packets being sent. Changing the DSCP can result in
in packets hitting different queues on the path and, therefore, the packets hitting different queues on the path. Therefore, congestion
congestion control should be initialized when the DSCP is changed by control should be initialized when the DSCP is changed by the upper
the upper layer. This is not described in [RFC4960]. layer. This is not described in [RFC4960].
3.35.2. Text Changes to the Document 3.35.2. Text Changes to the Document
--------- ---------
New text: (Section 7.2.5) New text: (Section 7.2.5)
--------- ---------
7.2.5. Change of Differentiated Services Code Points
SCTP implementations MAY allow an application to configure the 7.2.5. Making Changes to Differentiated Services Code Points
Differentiated Services Code Point (DSCP) used for sending packets.
If a DSCP change might result in outgoing packets being queued in
different queues, the congestion control parameters for all affected
destination addresses MUST be reset to their initial values.
This text is in final form, and is not further updated in this SCTP implementations MAY allow an application to configure the
Differentiated Services Code Point (DSCP) used for sending
packets. If a DSCP change might result in outgoing packets being
queued in different queues, the congestion control parameters for
all affected destination addresses MUST be reset to their initial
values.
This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 10.1 M)) Old text: (Section 10.1 M))
--------- ---------
Mandatory attributes: Mandatory attributes:
o association id - local handle to the SCTP association. o association id - local handle to the SCTP association.
o protocol parameter list - the specific names and values of the o protocol parameter list - the specific names and values of the
protocol parameters (e.g., Association.Max.Retrans; see Section protocol parameters (e.g., Association.Max.Retrans; see
15) that the SCTP user wishes to customize. Section 15) that the SCTP user wishes to customize.
--------- ---------
New text: (Section 10.1 M)) New text: (Section 10.1 M))
--------- ---------
Mandatory attributes: Mandatory attributes:
o association id - local handle to the SCTP association. o association id - local handle to the SCTP association.
o protocol parameter list - the specific names and values of the o protocol parameter list - the specific names and values of the
protocol parameters (e.g., Association.Max.Retrans; see Section protocol parameters (e.g., Association.Max.Retrans (see
15, or other parameters like the DSCP) that the SCTP user wishes Section 15), or other parameters like the DSCP) that the SCTP user
to customize. wishes to customize.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.35.3. Solution Description 3.35.3. Solution Description
Text describing the required action on DSCP changes has been added. Text describing the required action for DSCP changes has been added.
3.36. Inconsistent Handling of ICMPv4 and ICMPv6 Messages 3.36. Inconsistent Handling of ICMPv4 and ICMPv6 Messages
3.36.1. Description of the Problem 3.36.1. Description of the Problem
Appendix C of [RFC4960] describes the handling of ICMPv4 and ICMPv6 Appendix C of [RFC4960] describes the handling of ICMPv4 and ICMPv6
messages. The handling of ICMP messages indicating that the port messages. The handling of ICMP messages indicating that the port
number is unreachable described in the enumeration is not consistent number is unreachable, as described in the enumerated procedures, is
with the description given in [RFC4960] after the enumeration. not consistent with the description given in [RFC4960] after the
Furthermore, the text explicitly describes the handling of ICMPv6 procedures. Furthermore, the text explicitly describes the handling
packets indicating reachability problems, but does not do the same of ICMPv6 packets indicating reachability problems but does not do
for the corresponding ICMPv4 packets. the same for the corresponding ICMPv4 packets.
3.36.2. Text Changes to the Document 3.36.2. Text Changes to the Document
--------- ---------
Old text: (Appendix C) Old text: (Appendix C)
--------- ---------
ICMP3) An implementation MAY ignore any ICMPv4 messages where the ICMP3) An implementation MAY ignore any ICMPv4 messages where the
code does not indicate "Protocol Unreachable" or code does not indicate "Protocol Unreachable" or
"Fragmentation Needed". "Fragmentation Needed".
--------- ---------
New text: (Appendix C) New text: (Appendix C)
--------- ---------
ICMP3) An implementation SHOULD ignore any ICMP messages where the ICMP3) An implementation SHOULD ignore any ICMP messages where the
code indicates "Port Unreachable". code indicates "Port Unreachable".
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Appendix C) Old text: (Appendix C)
--------- ---------
ICMP9) If the ICMPv6 code is "Destination Unreachable", the ICMP9) If the ICMPv6 code is "Destination Unreachable", the
implementation MAY mark the destination into the unreachable implementation MAY mark the destination into the unreachable
state or alternatively increment the path error counter. state or alternatively increment the path error counter.
--------- ---------
New text: (Appendix C) New text: (Appendix C)
--------- ---------
ICMP9) If the ICMP type is "Destination Unreachable", the ICMP9) If the ICMP type is "Destination Unreachable", the
implementation MAY mark the destination into the unreachable implementation MAY move the destination to the unreachable
state or alternatively increment the path error counter. state or, alternatively, increment the path error counter.
This text has been modified by multiple errata. It is further This text has been modified by multiple errata. It is further
updated in Section 3.37. updated in Section 3.37.
3.36.3. Solution Description 3.36.3. Solution Description
The text has been changed to describe the intended handling of ICMP The text has been changed to describe the intended handling of ICMP
messages indicating that the port number is unreachable by replacing messages indicating that the port number is unreachable by replacing
the third rule. Furthermore, remove the limitation to ICMPv6 in the the third rule. Also, the limitation to ICMPv6 in the ninth rule has
ninth rule. been removed.
3.37. Handling of Soft Errors 3.37. Handling of Soft Errors
3.37.1. Description of the Problem 3.37.1. Description of the Problem
[RFC1122] defines the handling of soft errors and hard errors for [RFC1122] defines the handling of soft errors and hard errors for
TCP. Appendix C of [RFC4960] only deals with hard errors. TCP. Appendix C of [RFC4960] only deals with hard errors.
3.37.2. Text Changes to the Document 3.37.2. Text Changes to the Document
skipping to change at page 60, line 27 skipping to change at page 56, line 45
ICMP9) If the ICMPv6 code is "Destination Unreachable", the ICMP9) If the ICMPv6 code is "Destination Unreachable", the
implementation MAY mark the destination into the unreachable implementation MAY mark the destination into the unreachable
state or alternatively increment the path error counter. state or alternatively increment the path error counter.
--------- ---------
New text: (Appendix C) New text: (Appendix C)
--------- ---------
ICMP9) If the ICMP type is "Destination Unreachable", the ICMP9) If the ICMP type is "Destination Unreachable", the
implementation MAY mark the destination into the unreachable implementation MAY move the destination to the unreachable
state or alternatively increment the path error counter. state or, alternatively, increment the path error counter.
SCTP MAY provide information to the upper layer indicating SCTP MAY provide information to the upper layer indicating
the reception of ICMP messages when reporting a network status the reception of ICMP messages when reporting a network status
change. change.
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.36. It is in final form, and is not modifications from Section 3.36. It is in final form and is not
further updated in this document. further updated in this document.
3.37.3. Solution Description 3.37.3. Solution Description
Text has been added allowing SCTP to notify the application in case Text has been added allowing SCTP to notify the application in the
of soft errors. case of soft errors.
3.38. Honoring CWND 3.38. Honoring cwnd
3.38.1. Description of the Problem 3.38.1. Description of the Problem
When using the slow start algorithm, SCTP increases the congestion When using the slow start algorithm, SCTP increases the congestion
window only when it is being fully utilized. Since SCTP uses DATA window only when it is being fully utilized. Since SCTP uses DATA
chunks and does not use the congestion window to fragment user chunks and does not use the congestion window to fragment user
messages, this requires that some overbooking of the congestion messages, this requires that some overbooking of the congestion
window is allowed. window be allowed.
3.38.2. Text Changes to the Document 3.38.2. Text Changes to the Document
--------- ---------
Old text: (Section 6.1) Old text: (Section 6.1)
--------- ---------
B) At any given time, the sender MUST NOT transmit new data to a B) At any given time, the sender MUST NOT transmit new data to a
given transport address if it has cwnd or more bytes of data given transport address if it has cwnd or more bytes of data
outstanding to that transport address. outstanding to that transport address.
--------- ---------
New text: (Section 6.1) New text: (Section 6.1)
--------- ---------
B) At any given time, the sender MUST NOT transmit new data to a B) At any given time, the sender MUST NOT transmit new data to a
given transport address if it has cwnd + (PMTU - 1) or more bytes given transport address if it has cwnd + (PMTU - 1) or more bytes
of data outstanding to that transport address. If data is of data outstanding to that transport address. If data is
available the sender SHOULD exceed cwnd by up to (PMTU-1) bytes on available, the sender SHOULD exceed cwnd by up to (PMTU - 1) bytes
a new data transmission if the flightsize does not currently reach on a new data transmission if the flightsize does not currently
cwnd. The breach of cwnd MUST constitute one packet only. reach cwnd. The breach of cwnd MUST constitute one packet only.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 7.2.1) Old text: (Section 7.2.1)
--------- ---------
o Whenever cwnd is greater than zero, the endpoint is allowed to o Whenever cwnd is greater than zero, the endpoint is allowed to
have cwnd bytes of data outstanding on that transport address. have cwnd bytes of data outstanding on that transport address.
--------- ---------
skipping to change at page 61, line 39 skipping to change at page 58, line 15
--------- ---------
Old text: (Section 7.2.1) Old text: (Section 7.2.1)
--------- ---------
o Whenever cwnd is greater than zero, the endpoint is allowed to o Whenever cwnd is greater than zero, the endpoint is allowed to
have cwnd bytes of data outstanding on that transport address. have cwnd bytes of data outstanding on that transport address.
--------- ---------
New text: (Section 7.2.1) New text: (Section 7.2.1)
--------- ---------
o Whenever cwnd is greater than zero, the endpoint is allowed to o Whenever cwnd is greater than zero, the endpoint is allowed to
have cwnd bytes of data outstanding on that transport address. have cwnd bytes of data outstanding on that transport address. A
A limited overbooking as described in B) of Section 6.1 SHOULD limited overbooking as described in Section 6.1 B) SHOULD be
be supported. supported.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.38.3. Solution Description 3.38.3. Solution Description
Text was added to clarify how the cwnd limit should be handled. Text was added to clarify how the cwnd limit should be handled.
3.39. Zero Window Probing 3.39. Zero Window Probing
3.39.1. Description of the Problem 3.39.1. Description of the Problem
The text describing zero window probing was not clearly handling the The text in Section 6.1 of [RFC4960] that describes zero window
case where the window was not zero, but too small for the next DATA probing does not clearly address the case where the window is not
chunk to be transmitted. Even in this case, zero window probing has zero but is too small for the next DATA chunk to be transmitted.
to be performed to avoid deadlocks. Even in this case, zero window probing has to be performed to avoid
deadlocks.
3.39.2. Text Changes to the Document 3.39.2. Text Changes to the Document
--------- ---------
Old text: (Section 6.1) Old text: (Section 6.1)
--------- ---------
A) At any given time, the data sender MUST NOT transmit new data to A) At any given time, the data sender MUST NOT transmit new data to
any destination transport address if its peer's rwnd indicates any destination transport address if its peer's rwnd indicates
that the peer has no buffer space (i.e., rwnd is 0; see Section that the peer has no buffer space (i.e., rwnd is 0; see Section
6.2.1). However, regardless of the value of rwnd (including if it 6.2.1). However, regardless of the value of rwnd (including if it
is 0), the data sender can always have one DATA chunk in flight to is 0), the data sender can always have one DATA chunk in flight to
the receiver if allowed by cwnd (see rule B, below). This rule the receiver if allowed by cwnd (see rule B, below). This rule
skipping to change at page 63, line 31 skipping to change at page 59, line 34
cumulatively acknowledged and no DATA chunks are in flight. Zero cumulatively acknowledged and no DATA chunks are in flight. Zero
window probing MUST be supported. window probing MUST be supported.
--------- ---------
New text: (Section 6.1) New text: (Section 6.1)
--------- ---------
A) At any given time, the data sender MUST NOT transmit new data to A) At any given time, the data sender MUST NOT transmit new data to
any destination transport address if its peer's rwnd indicates any destination transport address if its peer's rwnd indicates
that the peer has no buffer space (i.e., rwnd is smaller than the that the peer has no buffer space (i.e., rwnd is smaller than the
size of the next DATA chunk; see Section 6.2.1). size of the next DATA chunk; see Section 6.2.1). However,
However, regardless of the value of rwnd (including if it is 0), regardless of the value of rwnd (including if it is 0), the data
the data sender can always have one DATA chunk in flight to sender can always have one DATA chunk in flight to the receiver
the receiver if allowed by cwnd (see rule B, below). This rule if allowed by cwnd (see rule B, below). This rule allows the
allows the sender to probe for a change in rwnd that the sender sender to probe for a change in rwnd that the sender missed
missed due to the SACK's having been lost in transit from the data due to the SACK's having been lost in transit from the data
receiver to the data sender. receiver to the data sender.
When the receiver has no buffer space, this probe is When the receiver has no buffer space, this probe is called a
called a zero window probe. Note that a zero window probe SHOULD zero window probe. Note that a zero window probe SHOULD only be
only be sent when all outstanding DATA chunks have been sent when all outstanding DATA chunks have been cumulatively
cumulatively acknowledged and no DATA chunks are in flight. Zero acknowledged and no DATA chunks are in flight. Zero window
window probing MUST be supported. probing MUST be supported.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.39.3. Solution Description 3.39.3. Solution Description
The terminology is used in a cleaner way. The terminology is used in a cleaner way.
3.40. Updating References Regarding ECN 3.40. Updating References regarding ECN
3.40.1. Description of the Problem 3.40.1. Description of the Problem
[RFC4960] refers for ECN only to [RFC3168], which will be updated by For Explicit Congestion Notification (ECN), [RFC4960] refers only to
[RFC8311]. This needs to be reflected when referring to ECN. [RFC3168], which has been updated by [RFC8311]. This needs to be
reflected in the text when referring to ECN.
3.40.2. Text Changes to the Document 3.40.2. Text Changes to the Document
--------- ---------
Old text: (Appendix A) Old text: (Appendix A)
--------- ---------
ECN [RFC3168] describes a proposed extension to IP that details a ECN [RFC3168] describes a proposed extension to IP that details a
method to become aware of congestion outside of datagram loss. method to become aware of congestion outside of datagram loss.
--------- ---------
New text: (Appendix A) New text: (Appendix A)
--------- ---------
ECN as specified in [RFC3168] updated by [RFC8311] describes an ECN as specified in [RFC3168] (updated by [RFC8311]) describes an
extension to IP that details a method to become aware of congestion extension to IP that details a method for becoming aware of
outside of datagram loss. congestion outside of datagram loss.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Appendix A) Old text: (Appendix A)
--------- ---------
In general, [RFC3168] should be followed with the following In general, [RFC3168] should be followed with the following
exceptions. exceptions.
--------- ---------
New text: (Appendix A) New text: (Appendix A)
--------- ---------
In general, [RFC3168] updated by [RFC8311] SHOULD be followed with the In general, [RFC3168] (updated by [RFC8311]) SHOULD be followed, with
following exceptions. the following exceptions.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Appendix A) Old text: (Appendix A)
--------- ---------
[RFC3168] details negotiation of ECN during the SYN and SYN-ACK [RFC3168] details negotiation of ECN during the SYN and SYN-ACK
stages of a TCP connection. stages of a TCP connection.
--------- ---------
New text: (Appendix A) New text: (Appendix A)
--------- ---------
[RFC3168] updated by [RFC8311] details negotiation of ECN during the [RFC3168] (updated by [RFC8311]) details the negotiation of ECN
SYN and SYN-ACK stages of a TCP connection. during the SYN and SYN-ACK stages of a TCP connection.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Appendix A) Old text: (Appendix A)
--------- ---------
[RFC3168] details a specific bit for a receiver to send back in its [RFC3168] details a specific bit for a receiver to send back in its
TCP acknowledgements to notify the sender of the Congestion TCP acknowledgements to notify the sender of the Congestion
Experienced (CE) bit having arrived from the network. Experienced (CE) bit having arrived from the network.
--------- ---------
New text: (Appendix A) New text: (Appendix A)
--------- ---------
[RFC3168] updated by [RFC8311] details a specific bit for a receiver [RFC3168] (updated by [RFC8311]) details a specific bit for a
to send back in its TCP acknowledgements to notify the sender of the receiver to send back in its TCP acknowledgements to notify the
Congestion Experienced (CE) bit having arrived from the network. sender of the Congestion Experienced (CE) bit that the CE bit has
arrived from the network.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Appendix A) Old text: (Appendix A)
--------- ---------
[RFC3168] details a specific bit for a sender to send in the header [RFC3168] details a specific bit for a sender to send in the header
of its next outbound TCP segment to indicate to its peer that it has of its next outbound TCP segment to indicate to its peer that it has
reduced its congestion window. reduced its congestion window.
--------- ---------
New text: (Appendix A) New text: (Appendix A)
--------- ---------
[RFC3168] updated by [RFC8311] details a specific bit for a sender [RFC3168] (updated by [RFC8311]) details a specific bit for a sender
to send in the header of its next outbound TCP segment to indicate to to send in the header of its next outbound TCP segment to indicate to
its peer that it has reduced its congestion window. its peer that it has reduced its congestion window.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.40.3. Solution Description 3.40.3. Solution Description
References to [RFC8311] have been added. While there, some References to [RFC8311] have been added. Some wordsmithing was also
wordsmithing has been performed. done while making those updates.
3.41. Host Name Address Parameter Deprecated 3.41. Host Name Address Parameter Deprecated
3.41.1. Description of the Problem 3.41.1. Description of the Problem
[RFC4960] defines three types of address parameters to be used with [RFC4960] defines three types of address parameters to be used with
INIT and INIT ACK chunks: INIT and INIT ACK chunks:
1. IPv4 Address parameters. 1. IPv4 Address parameters.
2. IPv6 Address parameters. 2. IPv6 Address parameters.
3. Host Name Address parameters. 3. Host Name Address parameters.
The first two are supported by the SCTP kernel implementations of The first two parameter types are supported by the SCTP kernel
FreeBSD, Linux and Solaris, but the third one is not. In addition, implementations of FreeBSD, Linux, and Solaris, but the third is not.
the first two where successfully tested in all nine interoperability In addition, the first two were successfully tested in all nine
tests for SCTP, but the third one has never been successfully tested. interoperability tests for SCTP, but the third has never been
Therefore, the Host Name Address parameter should be deprecated. successfully tested. Therefore, the Host Name Address parameter
should be deprecated.
3.41.2. Text Changes to the Document 3.41.2. Text Changes to the Document
--------- ---------
Old text: (Section 3.3.2) Old text: (Section 3.3.2)
--------- ---------
Note 3: An INIT chunk MUST NOT contain more than one Host Name Note 3: An INIT chunk MUST NOT contain more than one Host Name
Address parameter. Moreover, the sender of the INIT MUST NOT combine Address parameter. Moreover, the sender of the INIT MUST NOT combine
any other address types with the Host Name Address in the INIT. The any other address types with the Host Name Address in the INIT. The
receiver of INIT MUST ignore any other address types if the Host Name receiver of INIT MUST ignore any other address types if the Host Name
Address parameter is present in the received INIT chunk. Address parameter is present in the received INIT chunk.
skipping to change at page 67, line 20 skipping to change at page 63, line 11
any other address types with the Host Name Address in the INIT. The any other address types with the Host Name Address in the INIT. The
receiver of INIT MUST ignore any other address types if the Host Name receiver of INIT MUST ignore any other address types if the Host Name
Address parameter is present in the received INIT chunk. Address parameter is present in the received INIT chunk.
--------- ---------
New text: (Section 3.3.2) New text: (Section 3.3.2)
--------- ---------
Note 3: An INIT chunk MUST NOT contain the Host Name Address Note 3: An INIT chunk MUST NOT contain the Host Name Address
parameter. The receiver of an INIT chunk containing a Host Name parameter. The receiver of an INIT chunk containing a Host Name
Address parameter MUST send an ABORT and MAY include an Error Cause Address parameter MUST send an ABORT and MAY include an "Unresolvable
indicating an Unresolvable Address. Address" error cause.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 3.3.2.1) Old text: (Section 3.3.2.1)
--------- ---------
The sender of INIT uses this parameter to pass its Host Name (in The sender of INIT uses this parameter to pass its Host Name (in
place of its IP addresses) to its peer. The peer is responsible for place of its IP addresses) to its peer. The peer is responsible for
resolving the name. Using this parameter might make it more likely resolving the name. Using this parameter might make it more likely
for the association to work across a NAT box. for the association to work across a NAT box.
--------- ---------
New text: (Section 3.3.2.1) New text: (Section 3.3.2.1)
--------- ---------
The sender of an INIT chunk MUST NOT include this parameter. The The sender of an INIT chunk MUST NOT include this parameter. The
usage of the Host Name Address parameter is deprecated. usage of the Host Name Address parameter is deprecated.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 3.3.2.1) Old text: (Section 3.3.2.1)
--------- ---------
Address Type: 16 bits (unsigned integer) Address Type: 16 bits (unsigned integer)
This is filled with the type value of the corresponding address This is filled with the type value of the corresponding address
TLV (e.g., IPv4 = 5, IPv6 = 6, Host name = 11). TLV (e.g., IPv4 = 5, IPv6 = 6, Host name = 11).
skipping to change at page 68, line 17 skipping to change at page 64, line 8
--------- ---------
Address Type: 16 bits (unsigned integer) Address Type: 16 bits (unsigned integer)
This is filled with the type value of the corresponding address This is filled with the type value of the corresponding address
TLV (e.g., IPv4 = 5, IPv6 = 6, Host name = 11). TLV (e.g., IPv4 = 5, IPv6 = 6, Host name = 11).
--------- ---------
New text: (Section 3.3.2.1) New text: (Section 3.3.2.1)
--------- ---------
Address Type: 16 bits (unsigned integer) Address Type: 16 bits (unsigned integer)
This is filled with the type value of the corresponding address This is filled with the type value of the corresponding address
TLV (e.g., IPv4 = 5, IPv6 = 6). The value indicating the Host TLV (e.g., IPv4 = 5, IPv6 = 6). The value indicating the Host
Name Address parameter (Host name = 11) MUST NOT be used. Name Address parameter (Host name = 11) MUST NOT be used.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 3.3.3) Old text: (Section 3.3.3)
--------- ---------
Note 3: The INIT ACK chunks MUST NOT contain more than one Host Name Note 3: The INIT ACK chunks MUST NOT contain more than one Host Name
Address parameter. Moreover, the sender of the INIT ACK MUST NOT Address parameter. Moreover, the sender of the INIT ACK MUST NOT
combine any other address types with the Host Name Address in the combine any other address types with the Host Name Address in the
INIT ACK. The receiver of the INIT ACK MUST ignore any other address INIT ACK. The receiver of the INIT ACK MUST ignore any other address
types if the Host Name Address parameter is present. types if the Host Name Address parameter is present.
--------- ---------
New text: (Section 3.3.3) New text: (Section 3.3.3)
--------- ---------
Note 3: An INIT ACK chunk MUST NOT contain the Host Name Address Note 3: An INIT ACK chunk MUST NOT contain the Host Name Address
parameter. The receiver of INIT ACK chunks containing a Host Name parameter. The receiver of INIT ACK chunks containing a Host Name
Address parameter MUST send an ABORT and MAY include an Error Cause Address parameter MUST send an ABORT and MAY include an "Unresolvable
indicating an Unresolvable Address. Address" error cause.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 5.1.2) Old text: (Section 5.1.2)
--------- ---------
B) If there is a Host Name parameter present in the received INIT or B) If there is a Host Name parameter present in the received INIT or
INIT ACK chunk, the endpoint shall resolve that host name to a INIT ACK chunk, the endpoint shall resolve that host name to a
list of IP address(es) and derive the transport address(es) of list of IP address(es) and derive the transport address(es) of
this peer by combining the resolved IP address(es) with the SCTP this peer by combining the resolved IP address(es) with the SCTP
skipping to change at page 69, line 45 skipping to change at page 65, line 38
If the name resolution is not successful, the endpoint MUST If the name resolution is not successful, the endpoint MUST
immediately send an ABORT with "Unresolvable Address" error cause immediately send an ABORT with "Unresolvable Address" error cause
to its peer. The ABORT shall be sent to the source IP address to its peer. The ABORT shall be sent to the source IP address
from which the last peer packet was received. from which the last peer packet was received.
--------- ---------
New text: (Section 5.1.2) New text: (Section 5.1.2)
--------- ---------
B) If there is a Host Name parameter present in the received INIT or B) If there is a Host Name Address parameter present in the received
INIT ACK chunk, the endpoint MUST immediately send an ABORT and INIT or INIT ACK chunk, the endpoint MUST immediately send an
MAY include an Error Cause indicating an Unresolvable Address to ABORT and MAY include an "Unresolvable Address" error cause
its peer. The ABORT SHALL be sent to the source IP address to its peer. The ABORT SHALL be sent to the source
from which the last peer packet was received. IP address from which the last peer packet was received.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 11.2.4.1) Old text: (Section 11.2.4.1)
--------- ---------
The use of the host name feature in the INIT chunk could be used to The use of the host name feature in the INIT chunk could be used to
flood a target DNS server. A large backlog of DNS queries, resolving flood a target DNS server. A large backlog of DNS queries, resolving
the host name received in the INIT chunk to IP addresses, could be the host name received in the INIT chunk to IP addresses, could be
accomplished by sending INITs to multiple hosts in a given domain. accomplished by sending INITs to multiple hosts in a given domain.
skipping to change at page 70, line 31 skipping to change at page 66, line 28
this type of attack is to verify that the IP addresses received from this type of attack is to verify that the IP addresses received from
DNS include the source IP address of the original INIT. If the list DNS include the source IP address of the original INIT. If the list
of IP addresses received from DNS does not include the source IP of IP addresses received from DNS does not include the source IP
address of the INIT, the endpoint MAY silently discard the INIT. address of the INIT, the endpoint MAY silently discard the INIT.
This last option will not protect against the attack against the DNS. This last option will not protect against the attack against the DNS.
--------- ---------
New text: (Section 11.2.4.1) New text: (Section 11.2.4.1)
--------- ---------
The support of the Host Name Address parameter has been removed from Support for the Host Name Address parameter has been removed from the
the protocol. Endpoints receiving INIT or INIT ACK chunks containing protocol. Endpoints receiving INIT or INIT ACK chunks containing the
the Host Name Address parameter MUST send an ABORT chunk in response Host Name Address parameter MUST send an ABORT chunk in response and
and MAY include an Error Cause indicating an Unresolvable Address. MAY include an "Unresolvable Address" error cause.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.41.3. Solution Description 3.41.3. Solution Description
The usage of the Host Name Address parameter has been deprecated. The usage of the Host Name Address parameter has been deprecated.
3.42. Conflicting Text Regarding the Supported Address Types Parameter 3.42. Conflicting Text regarding the 'Supported Address Types'
Parameter
3.42.1. Description of the Problem 3.42.1. Description of the Problem
When receiving an SCTP packet containing an INIT chunk sent from an Section 5.1.2 of [RFC4960] contains conflicting text regarding the
receipt of an SCTP packet containing an INIT chunk sent from an
address for which the corresponding address type is not listed in the address for which the corresponding address type is not listed in the
Supported Address Types, there is conflicting text in Section 5.1.2 'Supported Address Types' parameter. The text states that the
of [RFC4960]. It is stated that the association MUST be aborted and association MUST be aborted, but it also states that the association
also that the association SHOULD be established and there SHOULD NOT SHOULD be established and there SHOULD NOT be any error indication.
be any error indication.
3.42.2. Text Changes to the Document 3.42.2. Text Changes to the Document
--------- ---------
Old text: (Section 5.1.2) Old text: (Section 5.1.2)
--------- ---------
The sender of INIT may include a 'Supported Address Types' parameter The sender of INIT may include a 'Supported Address Types' parameter
in the INIT to indicate what types of address are acceptable. When in the INIT to indicate what types of address are acceptable. When
this parameter is present, the receiver of INIT (initiate) MUST this parameter is present, the receiver of INIT (initiate) MUST
skipping to change at page 71, line 28 skipping to change at page 67, line 28
its peer. its peer.
--------- ---------
New text: (Section 5.1.2) New text: (Section 5.1.2)
--------- ---------
The sender of INIT chunks MAY include a 'Supported Address Types' The sender of INIT chunks MAY include a 'Supported Address Types'
parameter in the INIT to indicate what types of addresses are parameter in the INIT to indicate what types of addresses are
acceptable. acceptable.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.42.3. Solution Description 3.42.3. Solution Description
The conflicting text has been removed. The conflicting text has been removed.
3.43. Integration of RFC 6096 3.43. Integration of RFC 6096
3.43.1. Description of the Problem 3.43.1. Description of the Problem
[RFC6096] updates [RFC4960] by adding a Chunk Flags Registry. This [RFC6096] updates [RFC4960] by adding the "Chunk Flags" registry.
should be integrated into the base specification. This should be integrated into the base specification.
3.43.2. Text Changes to the Document 3.43.2. Text Changes to the Document
Old text: (Section 14.1) ---------
Old text: (Section 14.1)
---------
14.1. IETF-Defined Chunk Extension 14.1. IETF-Defined Chunk Extension
The assignment of new chunk parameter type codes is done through an The assignment of new chunk parameter type codes is done through
IETF Consensus action, as defined in [RFC2434]. Documentation of the an IETF Consensus action, as defined in [RFC2434]. Documentation
chunk parameter MUST contain the following information: of the chunk parameter MUST contain the following information:
a) A long and short name for the new chunk type. a) A long and short name for the new chunk type.
b) A detailed description of the structure of the chunk, which MUST b) A detailed description of the structure of the chunk, which
conform to the basic structure defined in Section 3.2. MUST conform to the basic structure defined in Section 3.2.
c) A detailed definition and description of the intended use of each c) A detailed definition and description of the intended use of
field within the chunk, including the chunk flags if any. each field within the chunk, including the chunk flags if any.
d) A detailed procedural description of the use of the new chunk type d) A detailed procedural description of the use of the new chunk
within the operation of the protocol. type within the operation of the protocol.
The last chunk type (255) is reserved for future extension if The last chunk type (255) is reserved for future extension if
necessary. necessary.
New text: (Section 14.1) ---------
New text: (Section 14.1)
---------
14.1. IETF-Defined Chunk Extension 14.1. IETF-Defined Chunk Extension
The assignment of new chunk type codes is done through an IETF Review The assignment of new chunk type codes is done through an IETF
action, as defined in [RFC8126]. Documentation of a new chunk MUST Review action, as defined in [RFC8126]. Documentation for a new
contain the following information: chunk MUST contain the following information:
a) A long and short name for the new chunk type; a) A long and short name for the new chunk type.
b) A detailed description of the structure of the chunk, which MUST b) A detailed description of the structure of the chunk, which
conform to the basic structure defined in Section 3.2 of MUST conform to the basic structure defined in Section 3.2.
[RFC4960];
c) A detailed definition and description of the intended use of each c) A detailed definition and description of the intended use of
field within the chunk, including the chunk flags if any. each field within the chunk, including the chunk flags
Defined chunk flags will be used as initial entries in the chunk (if any). Defined chunk flags will be used as initial entries
flags table for the new chunk type; in the chunk flags table for the new chunk type.
d) A detailed procedural description of the use of the new chunk d) A detailed procedural description of the use of the new chunk
type within the operation of the protocol. type within the operation of the protocol.
The last chunk type (255) is reserved for future extension if The last chunk type (255) is reserved for future extension if
necessary. necessary.
For each new chunk type, IANA creates a registration table for the For each new chunk type, IANA creates a registration table for the
chunk flags of that type. The procedure for registering particular chunk flags of that type. The procedure for registering
chunk flags is described in the following Section 14.2. particular chunk flags is described in Section 14.2.
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.3. It is in final form, and is not modifications from Section 3.3. It is in final form and is not
further updated in this document. further updated in this document.
New text: (Section 14.2) ---------
New text: (Section 14.2)
---------
14.2. New IETF Chunk Flags Registration 14.2. New IETF Chunk Flags Registration
The assignment of new chunk flags is done through an RFC required The assignment of new chunk flags is done through an RFC Required
action, as defined in [RFC8126]. Documentation of the chunk flags action, as defined in [RFC8126]. Documentation for the chunk
MUST contain the following information: flags MUST contain the following information:
a) A name for the new chunk flag; a) A name for the new chunk flag.
b) A detailed procedural description of the use of the new chunk b) A detailed procedural description of the use of the new chunk
flag within the operation of the protocol. It MUST be considered flag within the operation of the protocol. It MUST be
that implementations not supporting the flag will send '0' on considered that implementations not supporting the flag will
transmit and just ignore it on receipt. send '0' on transmit and just ignore it on receipt.
IANA selects a chunk flags value. This MUST be one of 0x01, 0x02, IANA selects a chunk flags value. This MUST be one of 0x01, 0x02,
0x04, 0x08, 0x10, 0x20, 0x40, or 0x80, which MUST be unique within 0x04, 0x08, 0x10, 0x20, 0x40, or 0x80, which MUST be unique within
the chunk flag values for the specific chunk type. the chunk flag values for the specific chunk type.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
Please note that Sections 14.2, 14.3, 14.4, and 14.5 need to be Please note that Sections 14.2, 14.3, 14.4, and 14.5 as shown in
renumbered. [RFC4960] will need to be renumbered when [RFC4960] is updated.
3.43.3. Solution Description 3.43.3. Solution Description
[RFC6096] was integrated and the reference updated to [RFC8126]. [RFC6096] has been integrated, and the reference has been updated to
[RFC8126].
3.44. Integration of RFC 6335 3.44. Integration of RFC 6335
3.44.1. Description of the Problem 3.44.1. Description of the Problem
[RFC6335] updates [RFC4960] by updating Procedures for the Port [RFC6335] updates [RFC4960] by updating procedures for the "Service
Numbers Registry. This should be integrated into the base Name and Transport Protocol Port Number Registry". This should be
specification. While there, update the reference to the RFC giving integrated into the base specification. Also, the "Guidelines for
guidelines for writing IANA sections to [RFC8126]. Writing an IANA Considerations Section in RFCs" reference needs to be
changed to [RFC8126].
3.44.2. Text Changes to the Document 3.44.2. Text Changes to the Document
--------- ---------
Old text: (Section 14.5) Old text: (Section 14.5)
--------- ---------
SCTP services may use contact port numbers to provide service to SCTP services may use contact port numbers to provide service to
unknown callers, as in TCP and UDP. IANA is therefore requested to unknown callers, as in TCP and UDP. IANA is therefore requested to
open the existing Port Numbers registry for SCTP using the following open the existing Port Numbers registry for SCTP using the following
skipping to change at page 75, line 20 skipping to change at page 71, line 41
o Concrete intent to use a port SHOULD precede port registration. o Concrete intent to use a port SHOULD precede port registration.
For example, existing TCP ports SHOULD NOT be registered in For example, existing TCP ports SHOULD NOT be registered in
advance of any intent to use those ports for SCTP. advance of any intent to use those ports for SCTP.
--------- ---------
New text: (Section 14.5) New text: (Section 14.5)
--------- ---------
SCTP services can use contact port numbers to provide service to SCTP services can use contact port numbers to provide service to
unknown callers, as in TCP and UDP. IANA is therefore requested to unknown callers, as in TCP and UDP. IANA is therefore requested to
open the existing Port Numbers registry for SCTP using the following open the existing "Service Name and Transport Protocol Port Number
rules, which we intend to mesh well with existing Port Numbers Registry" for SCTP using the following rules, which we intend to mesh
registration procedures. An IESG-appointed Expert Reviewer supports well with existing port-number registration procedures. An
IANA in evaluating SCTP port allocation requests, according to the IESG-appointed expert reviewer supports IANA in evaluating SCTP port
procedure defined in [RFC8126]. The details of this process are allocation requests, according to the procedure defined in [RFC8126].
defined in [RFC6335]. The details of this process are defined in [RFC6335].
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.44.3. Solution Description 3.44.3. Solution Description
[RFC6335] was integrated and the reference was updated to [RFC8126]. [RFC6335] has been integrated, and the reference has been updated to
[RFC8126].
3.45. Integration of RFC 7053 3.45. Integration of RFC 7053
3.45.1. Description of the Problem 3.45.1. Description of the Problem
[RFC7053] updates [RFC4960] by adding the I bit to the DATA chunk. [RFC7053] updates [RFC4960] by adding the I bit to the DATA chunk.
This should be integrated into the base specification. This should be integrated into the base specification.
3.45.2. Text Changes to the Document 3.45.2. Text Changes to the Document
Old text: (Section 3.3.1) ---------
Old text: (Section 3.3.1)
---------
The following format MUST be used for the DATA chunk: The following format MUST be used for the DATA chunk:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type = 0 | Reserved|U|B|E| Length | | Type = 0 | Reserved|U|B|E| Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| TSN | | TSN |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Stream Identifier S | Stream Sequence Number n | | Stream Identifier S | Stream Sequence Number n |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Payload Protocol Identifier | | Payload Protocol Identifier |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
\ \ \ \
/ User Data (seq n of Stream S) / / User Data (seq n of Stream S) /
\ \ \ \
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Reserved: 5 bits Reserved: 5 bits
Should be set to all '0's and ignored by the receiver. Should be set to all '0's and ignored by the receiver.
New text: (Section 3.3.1) ---------
New text: (Section 3.3.1)
---------
0 1 2 3 The following format MUST be used for the DATA chunk:
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type = 0 | Res |I|U|B|E| Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| TSN |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Stream Identifier S | Stream Sequence Number n |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Payload Protocol Identifier |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
\ \
/ User Data (seq n of Stream S) /
\ \
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Res: 4 bits 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type = 0 | Res |I|U|B|E| Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| TSN |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Stream Identifier S | Stream Sequence Number n |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Payload Protocol Identifier |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
\ \
/ User Data (seq n of Stream S) /
\ \
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
SHOULD be set to all '0's and ignored by the receiver. Res: 4 bits
I bit: 1 bit SHOULD be set to all '0's and ignored by the receiver.
The (I)mmediate Bit MAY be set by the sender, whenever the sender of I bit: 1 bit
a DATA chunk can benefit from the corresponding SACK chunk being sent
back without delay. See [RFC7053] for a discussion about The (I)mmediate bit MAY be set by the sender whenever the sender
This text is in final form, and is not further updated in this of a DATA chunk can benefit from the corresponding SACK chunk
being sent back without delay. See Section 4 of [RFC7053] for a
discussion of the benefits.
This text is in final form and is not further updated in this
document. document.
--------- ---------
New text: (Append to Section 6.1) New text: (Append to Section 6.1)
--------- ---------
Whenever the sender of a DATA chunk can benefit from the Whenever the sender of a DATA chunk can benefit from the
corresponding SACK chunk being sent back without delay, the sender corresponding SACK chunk being sent back without delay, the sender
MAY set the I bit in the DATA chunk header. Please note that why the MAY set the I bit in the DATA chunk header. Please note that why the
sender has set the I bit is irrelevant to the receiver. sender has set the I bit is irrelevant to the receiver.
Reasons for setting the I bit include, but are not limited to (see Reasons for setting the I bit include, but are not limited to, the
Section 4 of [RFC7053] for the benefits): following (see Section 4 of [RFC7053] for a discussion of the
benefits):
o The application requests to set the I bit of the last DATA chunk o The application requests that the I bit of the last DATA chunk of
of a user message when providing the user message to the SCTP a user message be set when providing the user message to the SCTP
implementation (see Section 7). implementation (see Section 7).
o The sender is in the SHUTDOWN-PENDING state. o The sender is in the SHUTDOWN-PENDING state.
o The sending of a DATA chunk fills the congestion or receiver o The sending of a DATA chunk fills the congestion or receiver
window. window.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 6.2) Old text: (Section 6.2)
--------- ---------
Note: The SHUTDOWN chunk does not contain Gap Ack Block fields. Note: The SHUTDOWN chunk does not contain Gap Ack Block fields.
Therefore, the endpoint should use a SACK instead of the SHUTDOWN Therefore, the endpoint should use a SACK instead of the SHUTDOWN
chunk to acknowledge DATA chunks received out of order. chunk to acknowledge DATA chunks received out of order.
skipping to change at page 78, line 7 skipping to change at page 75, line 5
Therefore, the endpoint SHOULD use a SACK instead of the SHUTDOWN Therefore, the endpoint SHOULD use a SACK instead of the SHUTDOWN
chunk to acknowledge DATA chunks received out of order. chunk to acknowledge DATA chunks received out of order.
Upon receipt of an SCTP packet containing a DATA chunk with the I bit Upon receipt of an SCTP packet containing a DATA chunk with the I bit
set, the receiver SHOULD NOT delay the sending of the corresponding set, the receiver SHOULD NOT delay the sending of the corresponding
SACK chunk, i.e., the receiver SHOULD immediately respond with the SACK chunk, i.e., the receiver SHOULD immediately respond with the
corresponding SACK chunk. corresponding SACK chunk.
Please note that this change is only about adding a paragraph. Please note that this change is only about adding a paragraph.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 10.1 E)) Old text: (Section 10.1 E))
--------- ---------
E) Send E) Send
Format: SEND(association id, buffer address, byte count [,context] Format: SEND(association id, buffer address, byte count [,context]
[,stream id] [,life time] [,destination transport address] [,stream id] [,life time] [,destination transport address]
skipping to change at page 78, line 30 skipping to change at page 75, line 28
--------- ---------
New text: (Section 10.1 E)) New text: (Section 10.1 E))
--------- ---------
E) Send E) Send
Format: SEND(association id, buffer address, byte count [,context] Format: SEND(association id, buffer address, byte count [,context]
[,stream id] [,life time] [,destination transport address] [,stream id] [,life time] [,destination transport address]
[,unordered flag] [,no-bundle flag] [,payload protocol-id] [,unordered flag] [,no-bundle flag] [,payload protocol-id]
[,sack immediately] ) [,sack-immediately])
-> result -> result
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
New text: (Append optional parameter in Subsection E of Section 10.1) New text: (Append optional parameter in item E) of Section 10.1)
--------- ---------
o sack immediately - set the I bit on the last DATA chunk used for o sack-immediately flag - set the I bit on the last DATA chunk used
sending buffer. for the user message to be transmitted.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.45.3. Solution Description 3.45.3. Solution Description
[RFC7053] was integrated. [RFC7053] has been integrated.
3.46. CRC32c Code Improvements 3.46. CRC32c Code Improvements
3.46.1. Description of the Problem 3.46.1. Description of the Problem
The code given for the CRC32c computations uses types like long which The code given for the CRC32c computations uses types such as "long",
may have different length on different operating systems or which may have different lengths on different operating systems or
processors. Therefore, the code is changed to use specific types processors. Therefore, the code needs to be changed, so that it uses
like uint32_t. specific types such as uint32_t.
While there, fix also some syntax errors and a comment. Some syntax errors and a comment also need to be fixed.
We remind the reader that per Section 3.10.2 of this document most of
Appendix C of RFC 4960 will be moved to Appendix B in the bis
document (thus the "Old text: (Appendix C)" and "New text:
(Appendix B)" items in this section).
3.46.2. Text Changes to the Document 3.46.2. Text Changes to the Document
--------- ---------
Old text: (Appendix C) Old text: (Appendix C)
--------- ---------
/*************************************************************/ /*************************************************************/
/* Note Definition for Ross Williams table generator would */ /* Note Definition for Ross Williams table generator would */
/* be: TB_WIDTH=4, TB_POLLY=0x1EDC6F41, TB_REVER=TRUE */ /* be: TB_WIDTH=4, TB_POLLY=0x1EDC6F41, TB_REVER=TRUE */
/* For Mr. Williams direct calculation code use the settings */ /* For Mr. Williams direct calculation code use the settings */
/* cm_width=32, cm_poly=0x1EDC6F41, cm_init=0xFFFFFFFF, */ /* cm_width=32, cm_poly=0x1EDC6F41, cm_init=0xFFFFFFFF, */
/* cm_refin=TRUE, cm_refot=TRUE, cm_xorort=0x00000000 */ /* cm_refin=TRUE, cm_refot=TRUE, cm_xorort=0x00000000 */
/*************************************************************/ /*************************************************************/
/* Example of the crc table file */ /* Example of the crc table file */
#ifndef __crc32cr_table_h__ #ifndef __crc32cr_table_h__
skipping to change at page 81, line 4 skipping to change at page 78, line 41
0x8ECEE914L, 0x7CA56A17L, 0x6FF599E3L, 0x9D9E1AE0L, 0x8ECEE914L, 0x7CA56A17L, 0x6FF599E3L, 0x9D9E1AE0L,
0xD3D3E1ABL, 0x21B862A8L, 0x32E8915CL, 0xC083125FL, 0xD3D3E1ABL, 0x21B862A8L, 0x32E8915CL, 0xC083125FL,
0x144976B4L, 0xE622F5B7L, 0xF5720643L, 0x07198540L, 0x144976B4L, 0xE622F5B7L, 0xF5720643L, 0x07198540L,
0x590AB964L, 0xAB613A67L, 0xB831C993L, 0x4A5A4A90L, 0x590AB964L, 0xAB613A67L, 0xB831C993L, 0x4A5A4A90L,
0x9E902E7BL, 0x6CFBAD78L, 0x7FAB5E8CL, 0x8DC0DD8FL, 0x9E902E7BL, 0x6CFBAD78L, 0x7FAB5E8CL, 0x8DC0DD8FL,
0xE330A81AL, 0x115B2B19L, 0x020BD8EDL, 0xF0605BEEL, 0xE330A81AL, 0x115B2B19L, 0x020BD8EDL, 0xF0605BEEL,
0x24AA3F05L, 0xD6C1BC06L, 0xC5914FF2L, 0x37FACCF1L, 0x24AA3F05L, 0xD6C1BC06L, 0xC5914FF2L, 0x37FACCF1L,
0x69E9F0D5L, 0x9B8273D6L, 0x88D28022L, 0x7AB90321L, 0x69E9F0D5L, 0x9B8273D6L, 0x88D28022L, 0x7AB90321L,
0xAE7367CAL, 0x5C18E4C9L, 0x4F48173DL, 0xBD23943EL, 0xAE7367CAL, 0x5C18E4C9L, 0x4F48173DL, 0xBD23943EL,
0xF36E6F75L, 0x0105EC76L, 0x12551F82L, 0xE03E9C81L, 0xF36E6F75L, 0x0105EC76L, 0x12551F82L, 0xE03E9C81L,
0x34F4F86AL, 0xC69F7B69L, 0xD5CF889DL, 0x27A40B9EL, 0x34F4F86AL, 0xC69F7B69L, 0xD5CF889DL, 0x27A40B9EL,
0x79B737BAL, 0x8BDCB4B9L, 0x988C474DL, 0x6AE7C44EL, 0x79B737BAL, 0x8BDCB4B9L, 0x988C474DL, 0x6AE7C44EL,
0xBE2DA0A5L, 0x4C4623A6L, 0x5F16D052L, 0xAD7D5351L, 0xBE2DA0A5L, 0x4C4623A6L, 0x5F16D052L, 0xAD7D5351L,
}; };
#endif #endif
--------- ---------
New text: (Appendix B) New text: (Appendix B)
--------- ---------
<CODE BEGINS> <CODE BEGINS>
/*************************************************************/ /****************************************************************/
/* Note Definition for Ross Williams table generator would */ /* Note: The definitions for Ross Williams's table generator */
/* be: TB_WIDTH=4, TB_POLLY=0x1EDC6F41, TB_REVER=TRUE */ /* would be TB_WIDTH=4, TB_POLY=0x1EDC6F41, TB_REVER=TRUE. */
/* For Mr. Williams direct calculation code use the settings */ /* For Mr. Williams's direct calculation code, use the settings */
/* cm_width=32, cm_poly=0x1EDC6F41, cm_init=0xFFFFFFFF, */ /* cm_width=32, cm_poly=0x1EDC6F41, cm_init=0xFFFFFFFF, */
/* cm_refin=TRUE, cm_refot=TRUE, cm_xorort=0x00000000 */ /* cm_refin=TRUE, cm_refot=TRUE, cm_xorot=0x00000000. */
/*************************************************************/ /****************************************************************/
/* Example of the crc table file */ /* Example of the crc table file */
#ifndef __crc32cr_h__ #ifndef __crc32cr_h__
#define __crc32cr_h__ #define __crc32cr_h__
#define CRC32C_POLY 0x1EDC6F41UL #define CRC32C_POLY 0x1EDC6F41UL
#define CRC32C(c,d) (c=(c>>8)^crc_c[(c^(d))&0xFF]) #define CRC32C(c,d) (c=(c>>8)^crc_c[(c^(d))&0xFF])
uint32_t crc_c[256] = uint32_t crc_c[256] =
{ {
skipping to change at page 83, line 4 skipping to change at page 80, line 45
0x24AA3F05UL, 0xD6C1BC06UL, 0xC5914FF2UL, 0x37FACCF1UL, 0x24AA3F05UL, 0xD6C1BC06UL, 0xC5914FF2UL, 0x37FACCF1UL,
0x69E9F0D5UL, 0x9B8273D6UL, 0x88D28022UL, 0x7AB90321UL, 0x69E9F0D5UL, 0x9B8273D6UL, 0x88D28022UL, 0x7AB90321UL,
0xAE7367CAUL, 0x5C18E4C9UL, 0x4F48173DUL, 0xBD23943EUL, 0xAE7367CAUL, 0x5C18E4C9UL, 0x4F48173DUL, 0xBD23943EUL,
0xF36E6F75UL, 0x0105EC76UL, 0x12551F82UL, 0xE03E9C81UL, 0xF36E6F75UL, 0x0105EC76UL, 0x12551F82UL, 0xE03E9C81UL,
0x34F4F86AUL, 0xC69F7B69UL, 0xD5CF889DUL, 0x27A40B9EUL, 0x34F4F86AUL, 0xC69F7B69UL, 0xD5CF889DUL, 0x27A40B9EUL,
0x79B737BAUL, 0x8BDCB4B9UL, 0x988C474DUL, 0x6AE7C44EUL, 0x79B737BAUL, 0x8BDCB4B9UL, 0x988C474DUL, 0x6AE7C44EUL,
0xBE2DA0A5UL, 0x4C4623A6UL, 0x5F16D052UL, 0xAD7D5351UL, 0xBE2DA0A5UL, 0x4C4623A6UL, 0x5F16D052UL, 0xAD7D5351UL,
}; };
#endif #endif
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.10. It is in final form, and is not modifications from Section 3.10. It is in final form and is not
further updated in this document. further updated in this document.
--------- ---------
Old text: (Appendix C) Old text: (Appendix C)
--------- ---------
/* Example of table build routine */ /* Example of table build routine */
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
skipping to change at page 85, line 16 skipping to change at page 83, line 12
for (i = 0; i < 32; i++) { for (i = 0; i < 32; i++) {
if (b & 1) if (b & 1)
rw |= 1 << (31 - i); rw |= 1 << (31 - i);
b >>= 1; b >>= 1;
} }
return (rw); return (rw);
} }
static uint32_t static uint32_t
build_crc_table(int index) build_crc_table (int index)
{ {
int i; int i;
uint32_t rb; uint32_t rb;
rb = reflect_32(index); rb = reflect_32(index);
for (i = 0; i < 8; i++) { for (i = 0; i < 8; i++) {
if (rb & 0x80000000UL) if (rb & 0x80000000UL)
rb = (rb << 1) ^ (uint32_t)CRC32C_POLY; rb = (rb << 1) ^ (uint32_t)CRC32C_POLY;
else else
rb <<= 1; rb <<= 1;
} }
return (reflect_32(rb)); return (reflect_32(rb));
} }
int int
main (void) main (void)
{ {
int i; int i;
printf("\nGenerating CRC-32c table file <%s>\n", printf("\nGenerating CRC32c table file <%s>.\n",
OUTPUT_FILE); OUTPUT_FILE);
if ((tf = fopen(OUTPUT_FILE, "w")) == NULL) { if ((tf = fopen(OUTPUT_FILE, "w")) == NULL) {
printf ("Unable to open %s\n", OUTPUT_FILE); printf("Unable to open %s.\n", OUTPUT_FILE);
exit (1); exit (1);
} }
fprintf(tf, "#ifndef __crc32cr_h__\n"); fprintf(tf, "#ifndef __crc32cr_h__\n");
fprintf(tf, "#define __crc32cr_h__\n\n"); fprintf(tf, "#define __crc32cr_h__\n\n");
fprintf(tf, "#define CRC32C_POLY 0x%08XUL\n", fprintf(tf, "#define CRC32C_POLY 0x%08XUL\n",
(uint32_t)CRC32C_POLY); (uint32_t)CRC32C_POLY);
fprintf(tf, fprintf(tf,
"#define CRC32C(c,d) (c=(c>>8)^crc_c[(c^(d))&0xFF])\n"); "#define CRC32C(c,d) (c=(c>>8)^crc_c[(c^(d))&0xFF])\n");
fprintf(tf, "\nuint32_t crc_c[256] =\n{\n"); fprintf(tf, "\nuint32_t crc_c[256] =\n{\n");
for (i = 0; i < 256; i++) { for (i = 0; i < 256; i++) {
fprintf(tf, "0x%08XUL,", build_crc_table (i)); fprintf(tf, "0x%08XUL,", build_crc_table (i));
if ((i & 3) == 3) if ((i & 3) == 3)
fprintf(tf, "\n"); fprintf(tf, "\n");
else else
fprintf(tf, " "); fprintf(tf, " ");
} }
fprintf(tf, "};\n\n#endif\n"); fprintf(tf, "};\n\n#endif\n");
if (fclose (tf) != 0) if (fclose(tf) != 0)
printf("Unable to close <%s>.", OUTPUT_FILE); printf("Unable to close <%s>.\n", OUTPUT_FILE);
else else
printf("\nThe CRC-32c table has been written to <%s>.\n", printf("\nThe CRC32c table has been written to <%s>.\n",
OUTPUT_FILE); OUTPUT_FILE);
} }
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.10. It is in final form, and is not modifications from Section 3.10. It is in final form and is not
further updated in this document. further updated in this document.
--------- ---------
Old text: (Appendix C) Old text: (Appendix C)
--------- ---------
/* Example of crc insertion */ /* Example of crc insertion */
#include "crc32cr.h" #include "crc32cr.h"
skipping to change at page 88, line 26 skipping to change at page 86, line 26
uint32_t crc32 = 0xffffffffUL; uint32_t crc32 = 0xffffffffUL;
uint32_t result; uint32_t result;
uint8_t byte0, byte1, byte2, byte3; uint8_t byte0, byte1, byte2, byte3;
for (i = 0; i < length; i++) { for (i = 0; i < length; i++) {
CRC32C(crc32, buffer[i]); CRC32C(crc32, buffer[i]);
} }
result = ~crc32; result = ~crc32;
/* result now holds the negated polynomial remainder; /* result now holds the negated polynomial remainder,
* since the table and algorithm is "reflected" [williams95]. * since the table and algorithm are "reflected" [williams95].
* That is, result has the same value as if we mapped the message * That is, result has the same value as if we mapped the message
* to a polynomial, computed the host-bit-order polynomial * to a polynomial, computed the host-bit-order polynomial
* remainder, performed final negation, then did an end-for-end * remainder, performed final negation, and then did an
* bit-reversal. * end-for-end bit-reversal.
* Note that a 32-bit bit-reversal is identical to four inplace * Note that a 32-bit bit-reversal is identical to four in-place
* 8-bit reversals followed by an end-for-end byteswap. * 8-bit bit-reversals followed by an end-for-end byteswap.
* In other words, the bits of each byte are in the right order, * In other words, the bits of each byte are in the right order,
* but the bytes have been byteswapped. So we now do an explicit * but the bytes have been byteswapped. So, we now do an explicit
* byteswap. On a little-endian machine, this byteswap and * byteswap. On a little-endian machine, this byteswap and
* the final ntohl cancel out and could be elided. * the final ntohl cancel out and could be elided.
*/ */
byte0 = result & 0xff; byte0 = result & 0xff;
byte1 = (result>>8) & 0xff; byte1 = (result>>8) & 0xff;
byte2 = (result>>16) & 0xff; byte2 = (result>>16) & 0xff;
byte3 = (result>>24) & 0xff; byte3 = (result>>24) & 0xff;
crc32 = ((byte0 << 24) | crc32 = ((byte0 << 24) |
(byte1 << 16) | (byte1 << 16) |
skipping to change at page 89, line 34 skipping to change at page 87, line 34
/* save and zero checksum */ /* save and zero checksum */
message = (SCTP_message *)buffer; message = (SCTP_message *)buffer;
original_crc32 = ntohl(message->common_header.checksum); original_crc32 = ntohl(message->common_header.checksum);
message->common_header.checksum = 0L; message->common_header.checksum = 0L;
crc32 = generate_crc32c(buffer, length); crc32 = generate_crc32c(buffer, length);
return ((original_crc32 == crc32)? 1 : -1); return ((original_crc32 == crc32)? 1 : -1);
} }
<CODE ENDS> <CODE ENDS>
This text has been modified by multiple errata. It includes This text has been modified by multiple errata. It includes
modifications from Section 3.5 and Section 3.10. It is in final modifications from Sections 3.5 and 3.10. It is in final form and is
form, and is not further updated in this document. not further updated in this document.
3.46.3. Solution Description 3.46.3. Solution Description
The code was changed to use platform independent types. The code was changed to use platform-independent types.
3.47. Clarification of Gap Ack Blocks in SACK Chunks 3.47. Clarification of Gap Ack Blocks in SACK Chunks
3.47.1. Description of the Problem 3.47.1. Description of the Problem
The Gap Ack Blocks in the SACK chunk are intended to be isolated. The Gap Ack Blocks in the SACK chunk are intended to be isolated.
However, this is not mentioned with normative text. However, this is not mentioned with normative text.
This issue was reported as part of an Errata for [RFC4960] with This issue was reported as part of an errata for [RFC4960] with
Errata ID 5202. Errata ID 5202.
3.47.2. Text Changes to the Document 3.47.2. Text Changes to the Document
Old text: (Section 3.3.4) ---------
Old text: (Section 3.3.4)
---------
The SACK also contains zero or more Gap Ack Blocks. Each Gap Ack The SACK also contains zero or more Gap Ack Blocks. Each Gap Ack
Block acknowledges a subsequence of TSNs received following a break Block acknowledges a subsequence of TSNs received following a break
in the sequence of received TSNs. By definition, all TSNs in the sequence of received TSNs. By definition, all TSNs
acknowledged by Gap Ack Blocks are greater than the value of the acknowledged by Gap Ack Blocks are greater than the value of the
Cumulative TSN Ack. Cumulative TSN Ack.
New text: (Section 3.3.4) ---------
New text: (Section 3.3.4)
---------
The SACK also contains zero or more Gap Ack Blocks. Each Gap Ack The SACK also contains zero or more Gap Ack Blocks. Each Gap Ack
Block acknowledges a subsequence of TSNs received following a break Block acknowledges a subsequence of TSNs received following a break
in the sequence of received TSNs. The Gap Ack Blocks SHOULD be isolated. in the sequence of received TSNs. The Gap Ack Blocks SHOULD be
This means that the TSN just before each Gap Ack Block and the TSN just isolated. This means that the TSN just before each Gap Ack Block and
after each Gap Ack Block has not been received. By definition, all TSNs the TSN just after each Gap Ack Block have not been received. By
acknowledged by Gap Ack Blocks are greater than the value of the definition, all TSNs acknowledged by Gap Ack Blocks are greater than
Cumulative TSN Ack. the value of the Cumulative TSN Ack.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
--------- ---------
Old text: (Section 3.3.4) Old text: (Section 3.3.4)
--------- ---------
Gap Ack Blocks: Gap Ack Blocks:
These fields contain the Gap Ack Blocks. They are repeated for These fields contain the Gap Ack Blocks. They are repeated for
each Gap Ack Block up to the number of Gap Ack Blocks defined in each Gap Ack Block up to the number of Gap Ack Blocks defined in
skipping to change at page 91, line 31 skipping to change at page 89, line 17
--------- ---------
Gap Ack Blocks: Gap Ack Blocks:
These fields contain the Gap Ack Blocks. They are repeated for These fields contain the Gap Ack Blocks. They are repeated for
each Gap Ack Block up to the number of Gap Ack Blocks defined in each Gap Ack Block up to the number of Gap Ack Blocks defined in
the Number of Gap Ack Blocks field. All DATA chunks with TSNs the Number of Gap Ack Blocks field. All DATA chunks with TSNs
greater than or equal to (Cumulative TSN Ack + Gap Ack Block greater than or equal to (Cumulative TSN Ack + Gap Ack Block
Start) and less than or equal to (Cumulative TSN Ack + Gap Ack Start) and less than or equal to (Cumulative TSN Ack + Gap Ack
Block End) of each Gap Ack Block are assumed to have been received Block End) of each Gap Ack Block are assumed to have been received
correctly. Gap Ack Blocks SHOULD be isolated. That means that correctly. Gap Ack Blocks SHOULD be isolated. This means that
the DATA chunks with TSN equal to (Cumulative TSN Ack + Gap Ack the DATA chunks with TSNs equal to (Cumulative TSN Ack + Gap Ack
Block Start - 1) and (Cumulative TSN Ack + Gap Ack Block End + 1) Block Start - 1) and (Cumulative TSN Ack + Gap Ack Block End + 1)
have not been received. have not been received.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.47.3. Solution Description 3.47.3. Solution Description
Normative text describing the intended usage of Gap Ack Blocks has Normative text describing the intended usage of Gap Ack Blocks has
been added. been added.
3.48. Handling of SSN Wrap Arounds 3.48. Handling of SSN Wraparounds
3.48.1. Description of the Problem 3.48.1. Description of the Problem
The Stream Sequence Number (SSN) is used for preserving the ordering The Stream Sequence Number (SSN) is used for preserving the ordering
of user messages within each SCTP stream. The SSN is limited to 16 of user messages within each SCTP stream. The SSN is limited to
bits. Therefore, multiple wrap arounds of the SSN might happen 16 bits. Therefore, multiple wraparounds of the SSN might happen
within the current send window. To allow the receiver to deliver within the current send window. To allow the receiver to deliver
ordered user messages in the correct sequence, the sender should ordered user messages in the correct sequence, the sender should
limit the number of user messages per stream. limit the number of user messages per stream.
3.48.2. Text Changes to the Document 3.48.2. Text Changes to the Document
Old text: (Section 6.1) ---------
Old text: (Section 6.1)
---------
Note: The data sender SHOULD NOT use a TSN that is more than 2**31 - Note: The data sender SHOULD NOT use a TSN that is more than 2**31 -
1 above the beginning TSN of the current send window. 1 above the beginning TSN of the current send window.
New text: (Section 6.1) ---------
New text: (Section 6.1)
---------
Note: The data sender SHOULD NOT use a TSN that is more than 2**31 - Note: The data sender SHOULD NOT use a TSN that is more than
1 above the beginning TSN of the current send window. 2**31 - 1 above the beginning TSN of the current send window.
Note: For each stream, the data sender SHOULD NOT have more than 2**16-1 Note: For each stream, the data sender SHOULD NOT have more than
ordered user messages in the current send window. 2**16 - 1 ordered user messages in the current send window.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.48.3. Solution Description 3.48.3. Solution Description
The data sender is required to limit the number of ordered user The data sender is required to limit the number of ordered user
messages within the current send window. messages within the current send window.
3.49. Update RFC 2119 Boilerplate 3.49. Update to RFC 2119 Boilerplate Text
3.49.1. Description of the Problem 3.49.1. Description of the Problem
The text to be used to refer to the [RFC2119] terms has been updated The text to be used to refer to the terms ("key words") defined in
by [RFC8174]. [RFC2119] has been updated by [RFC8174]. This needs to be integrated
into the base specification.
3.49.2. Text Changes to the Document 3.49.2. Text Changes to the Document
--------- ---------
Old text: (Section 2) Old text: (Section 2)
--------- ---------
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in RFC 2119 [RFC2119]. document are to be interpreted as described in RFC 2119 [RFC2119].
--------- ---------
New text: (Section 2) New text: (Section 2)
skipping to change at page 93, line 22 skipping to change at page 90, line 50
--------- ---------
New text: (Section 2) New text: (Section 2)
--------- ---------
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
"OPTIONAL" in this document are to be interpreted as described in "OPTIONAL" in this document are to be interpreted as described in
BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all
capitals, as shown here. capitals, as shown here.
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.49.3. Solution Description 3.49.3. Solution Description
The text has been updated to the one specified in [RFC8174]. The text has been updated to the text specified in [RFC8174].
3.50. Missed Text Removal 3.50. Removal of Text (Previously Missed in RFC 4960)
3.50.1. Description of the Problem 3.50.1. Description of the Problem
When integrating the changes to Section 7.2.4 of [RFC2960] as When integrating the changes to Section 7.2.4 of [RFC2960] as
described in Section 2.8.2 of [RFC4460] some text was not removed and described in Section 2.8.2 of [RFC4460], some text was not removed
is therefore still in [RFC4960]. and is therefore still in [RFC4960].
3.50.2. Text Changes to the Document 3.50.2. Text Changes to the Document
--------- ---------
Old text: (Section 7.2.4) Old text: (Section 7.2.4)
--------- ---------
A straightforward implementation of the above keeps a counter for A straightforward implementation of the above keeps a counter for
each TSN hole reported by a SACK. The counter increments for each each TSN hole reported by a SACK. The counter increments for each
consecutive SACK reporting the TSN hole. After reaching 3 and consecutive SACK reporting the TSN hole. After reaching 3 and
starting the Fast-Retransmit procedure, the counter resets to 0. starting the Fast-Retransmit procedure, the counter resets to 0.
Because cwnd in SCTP indirectly bounds the number of outstanding Because cwnd in SCTP indirectly bounds the number of outstanding
TSN's, the effect of TCP Fast Recovery is achieved automatically with TSN's, the effect of TCP Fast Recovery is achieved automatically with
skipping to change at page 94, line 20 skipping to change at page 91, line 35
consecutive SACK reporting the TSN hole. After reaching 3 and consecutive SACK reporting the TSN hole. After reaching 3 and
starting the Fast-Retransmit procedure, the counter resets to 0. starting the Fast-Retransmit procedure, the counter resets to 0.
Because cwnd in SCTP indirectly bounds the number of outstanding Because cwnd in SCTP indirectly bounds the number of outstanding
TSN's, the effect of TCP Fast Recovery is achieved automatically with TSN's, the effect of TCP Fast Recovery is achieved automatically with
no adjustment to the congestion control window size. no adjustment to the congestion control window size.
--------- ---------
New text: (Section 7.2.4) New text: (Section 7.2.4)
--------- ---------
This text is in final form, and is not further updated in this This text is in final form and is not further updated in this
document. document.
3.50.3. Solution Description 3.50.3. Solution Description
The text has finally been removed. The text has finally been removed.
4. IANA Considerations 4. IANA Considerations
Section 3.44 of this document updates the port number registry for Section 3.44 of this document suggests new text that would update the
SCTP to be consistent with [RFC6335]. IANA is requested to review "Service Name and Transport Protocol Port Number Registry" for SCTP
Section 3.44. to be consistent with [RFC6335].
IANA is only requested to check if it is OK to make the proposed text IANA has confirmed that it is OK to make the proposed text change in
change in an upcoming standards track document that updates an upcoming Standards Track document that will update [RFC4960].
[RFC4960]. IANA is not asked to perform any other action and this IANA is not asked to perform any other action, and this document does
document does not request IANA to make a change to any registry. not request that IANA make a change to any registry.
5. Security Considerations 5. Security Considerations
This document does not add any security considerations to those given This document does not add any security considerations to those given
in [RFC4960]. in [RFC4960].
6. Acknowledgments 6. References
The authors wish to thank Pontus Andersson, Eric W. Biederman,
Cedric Bonnet, Spencer Dawkins, Gorry Fairhurst, Benjamin Kaduk,
Mirja Kuehlewind, Peter Lei, Gyula Marosi, Lionel Morand, Jeff
Morriss, Karen E. E. Nielsen, Tom Petch, Kacheong Poon, Julien
Pourtet, Irene Ruengeler, Michael Welzl, and Qiaobing Xie for their
invaluable comments.
7. References
7.1. Normative References 6.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, Requirement Levels", BCP 14, RFC 2119,
DOI 10.17487/RFC2119, March 1997, DOI 10.17487/RFC2119, March 1997,
<https://www.rfc-editor.org/info/rfc2119>. <https://www.rfc-editor.org/info/rfc2119>.
[RFC4960] Stewart, R., Ed., "Stream Control Transmission Protocol", [RFC4960] Stewart, R., Ed., "Stream Control Transmission Protocol",
RFC 4960, DOI 10.17487/RFC4960, September 2007, RFC 4960, DOI 10.17487/RFC4960, September 2007,
<https://www.rfc-editor.org/info/rfc4960>. <https://www.rfc-editor.org/info/rfc4960>.
7.2. Informative References [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC
2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174,
May 2017, <https://www.rfc-editor.org/info/rfc8174>.
6.2. Informative References
[RFC1122] Braden, R., Ed., "Requirements for Internet Hosts - [RFC1122] Braden, R., Ed., "Requirements for Internet Hosts -
Communication Layers", STD 3, RFC 1122, Communication Layers", STD 3, RFC 1122,
DOI 10.17487/RFC1122, October 1989, DOI 10.17487/RFC1122, October 1989,
<https://www.rfc-editor.org/info/rfc1122>. <https://www.rfc-editor.org/info/rfc1122>.
[RFC1858] Ziemba, G., Reed, D., and P. Traina, "Security [RFC1858] Ziemba, G., Reed, D., and P. Traina, "Security
Considerations for IP Fragment Filtering", RFC 1858, Considerations for IP Fragment Filtering", RFC 1858,
DOI 10.17487/RFC1858, October 1995, DOI 10.17487/RFC1858, October 1995,
<https://www.rfc-editor.org/info/rfc1858>. <https://www.rfc-editor.org/info/rfc1858>.
skipping to change at page 96, line 32 skipping to change at page 93, line 42
[RFC7053] Tuexen, M., Ruengeler, I., and R. Stewart, "SACK- [RFC7053] Tuexen, M., Ruengeler, I., and R. Stewart, "SACK-
IMMEDIATELY Extension for the Stream Control Transmission IMMEDIATELY Extension for the Stream Control Transmission
Protocol", RFC 7053, DOI 10.17487/RFC7053, November 2013, Protocol", RFC 7053, DOI 10.17487/RFC7053, November 2013,
<https://www.rfc-editor.org/info/rfc7053>. <https://www.rfc-editor.org/info/rfc7053>.
[RFC8126] Cotton, M., Leiba, B., and T. Narten, "Guidelines for [RFC8126] Cotton, M., Leiba, B., and T. Narten, "Guidelines for
Writing an IANA Considerations Section in RFCs", BCP 26, Writing an IANA Considerations Section in RFCs", BCP 26,
RFC 8126, DOI 10.17487/RFC8126, June 2017, RFC 8126, DOI 10.17487/RFC8126, June 2017,
<https://www.rfc-editor.org/info/rfc8126>. <https://www.rfc-editor.org/info/rfc8126>.
[RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC
2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174,
May 2017, <https://www.rfc-editor.org/info/rfc8174>.
[RFC8311] Black, D., "Relaxing Restrictions on Explicit Congestion [RFC8311] Black, D., "Relaxing Restrictions on Explicit Congestion
Notification (ECN) Experimentation", RFC 8311, Notification (ECN) Experimentation", RFC 8311,
DOI 10.17487/RFC8311, January 2018, DOI 10.17487/RFC8311, January 2018,
<https://www.rfc-editor.org/info/rfc8311>. <https://www.rfc-editor.org/info/rfc8311>.
Acknowledgements
The authors wish to thank Pontus Andersson, Eric W. Biederman, Cedric
Bonnet, Spencer Dawkins, Gorry Fairhurst, Benjamin Kaduk, Mirja
Kuehlewind, Peter Lei, Gyula Marosi, Lionel Morand, Jeff Morriss,
Karen E. E. Nielsen, Tom Petch, Kacheong Poon, Julien Pourtet, Irene
Ruengeler, Michael Welzl, and Qiaobing Xie for their invaluable
comments.
Authors' Addresses Authors' Addresses
Randall R. Stewart Randall R. Stewart
Netflix, Inc. Netflix, Inc.
Chapin, SC 29036 Chapin, SC 29036
United States United States of America
Email: randall@lakerest.net Email: randall@lakerest.net
Michael Tuexen Michael Tuexen
Muenster University of Applied Sciences Muenster University of Applied Sciences
Stegerwaldstrasse 39 Stegerwaldstrasse 39
48565 Steinfurt 48565 Steinfurt
Germany Germany
Email: tuexen@fh-muenster.de Email: tuexen@fh-muenster.de
Maksim Proshin Maksim Proshin
Ericsson Ericsson
 End of changes. 443 change blocks. 
1045 lines changed or deleted 1133 lines changed or added

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