| 1 |
<pre>Network Working Group G. Pelletier |
| 2 |
Request for Comments: 4224 L-E. Jonsson |
| 3 |
Category: Informational K. Sandlund |
| 4 |
Ericsson |
| 5 |
January 2006 |
| 6 |
|
| 7 |
|
| 8 |
<span class="h1">RObust Header Compression (ROHC):</span> |
| 9 |
<span class="h1">ROHC over Channels That Can Reorder Packets</span> |
| 10 |
|
| 11 |
Status of This Memo |
| 12 |
|
| 13 |
This memo provides information for the Internet community. It does |
| 14 |
not specify an Internet standard of any kind. Distribution of this |
| 15 |
memo is unlimited. |
| 16 |
|
| 17 |
Copyright Notice |
| 18 |
|
| 19 |
Copyright (C) The Internet Society (2006). |
| 20 |
|
| 21 |
Abstract |
| 22 |
|
| 23 |
RObust Header Compression (ROHC), <a href="./rfc3095">RFC 3095</a>, defines a framework for |
| 24 |
header compression, along with a number of compression protocols |
| 25 |
(profiles). One operating assumption for the profiles defined in <a href="./rfc3095">RFC</a> |
| 26 |
<a href="./rfc3095">3095</a> is that the channel between compressor and decompressor is |
| 27 |
required to maintain packet ordering. This document discusses |
| 28 |
aspects of using ROHC over channels that can reorder packets. It |
| 29 |
provides guidelines on how to implement existing profiles over such |
| 30 |
channels, as well as suggestions for the design of new profiles. |
| 31 |
|
| 32 |
|
| 33 |
|
| 34 |
|
| 35 |
|
| 36 |
|
| 37 |
|
| 38 |
|
| 39 |
|
| 40 |
|
| 41 |
|
| 42 |
|
| 43 |
|
| 44 |
|
| 45 |
|
| 46 |
|
| 47 |
|
| 48 |
|
| 49 |
|
| 50 |
|
| 51 |
|
| 52 |
<span class="grey">Pelletier, et al. Informational [Page 1]</span></pre> |
| 53 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span> |
| 54 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 55 |
|
| 56 |
|
| 57 |
Table of Contents |
| 58 |
|
| 59 |
<a href="#section-1">1</a>. Introduction ....................................................<a href="#page-3">3</a> |
| 60 |
<a href="#section-2">2</a>. Terminology .....................................................<a href="#page-4">4</a> |
| 61 |
<a href="#section-3">3</a>. Applicability of This Document to ROHC Profiles .................<a href="#page-5">5</a> |
| 62 |
<a href="#section-3.1">3.1</a>. Profiles within Scope ......................................<a href="#page-5">5</a> |
| 63 |
<a href="#section-3.2">3.2</a>. Profiles with Special Considerations .......................<a href="#page-5">5</a> |
| 64 |
<a href="#section-3.3">3.3</a>. Profiles Incompatible with Reordering ......................<a href="#page-6">6</a> |
| 65 |
<a href="#section-4">4</a>. Background ......................................................<a href="#page-6">6</a> |
| 66 |
<a href="#section-4.1">4.1</a>. Reordering Channels ........................................<a href="#page-6">6</a> |
| 67 |
<a href="#section-4.2">4.2</a>. Robustness Principles of ROHC ..............................<a href="#page-6">6</a> |
| 68 |
<a href="#section-4.2.1">4.2.1</a>. Optimistic Approach (U/O-mode) ......................<a href="#page-7">7</a> |
| 69 |
<a href="#section-4.2.2">4.2.2</a>. Secure Reference Principle (R-mode) .................<a href="#page-7">7</a> |
| 70 |
<a href="#section-5">5</a>. Problem Description .............................................<a href="#page-7">7</a> |
| 71 |
<a href="#section-5.1">5.1</a>. ROHC and Reordering Channels ...............................<a href="#page-7">7</a> |
| 72 |
<a href="#section-5.1.1">5.1.1</a>. LSB Interpretation Interval and Reordering ..........<a href="#page-7">7</a> |
| 73 |
<a href="#section-5.1.2">5.1.2</a>. Reordering of Packets in R-mode .....................<a href="#page-9">9</a> |
| 74 |
<a href="#section-5.1.2.1">5.1.2.1</a>. Updating Packets ...........................<a href="#page-9">9</a> |
| 75 |
<a href="#section-5.1.2.2">5.1.2.2</a>. Non-Updating Packets ......................<a href="#page-10">10</a> |
| 76 |
<a href="#section-5.1.3">5.1.3</a>. Reordering of Packets in U/O-mode ..................<a href="#page-10">10</a> |
| 77 |
<a href="#section-5.1.4">5.1.4</a>. Reordering on the Feedback Channel .................<a href="#page-11">11</a> |
| 78 |
<a href="#section-5.1.5">5.1.5</a>. List Compression ...................................<a href="#page-11">11</a> |
| 79 |
<a href="#section-5.1.6">5.1.6</a>. Reordering and Mode Transitions ....................<a href="#page-12">12</a> |
| 80 |
<a href="#section-5.2">5.2</a>. Consequences of Reordering ................................<a href="#page-13">13</a> |
| 81 |
<a href="#section-5.2.1">5.2.1</a>. Functionality Incompatible with Reordering .........<a href="#page-13">13</a> |
| 82 |
<a href="#section-5.2.2">5.2.2</a>. Context Damage (Loss of Synchronization) ...........<a href="#page-13">13</a> |
| 83 |
<a href="#section-5.2.3">5.2.3</a>. Detected Decompression Failures (U/O/R-mode) .......<a href="#page-13">13</a> |
| 84 |
<a href="#section-5.2.4">5.2.4</a>. Undetected Decompression Failures (R-mode only) ....<a href="#page-14">14</a> |
| 85 |
<a href="#section-6">6</a>. Making ROHC Tolerant against Reordering ........................<a href="#page-14">14</a> |
| 86 |
<a href="#section-6.1">6.1</a>. Properties of ROHC Implementations ........................<a href="#page-14">14</a> |
| 87 |
6.1.1. Compressing Headers with Robustness against |
| 88 |
Reordering .........................................<a href="#page-14">14</a> |
| 89 |
<a href="#section-6.1.1.1">6.1.1.1</a>. Reordering and the Optimistic Approach ....<a href="#page-15">15</a> |
| 90 |
6.1.1.2. Reordering and the Secure |
| 91 |
Reference Principle .......................<a href="#page-15">15</a> |
| 92 |
<a href="#section-6.1.1.3">6.1.1.3</a>. Robust Selection of Compressed Header .....<a href="#page-15">15</a> |
| 93 |
<a href="#section-6.1.2">6.1.2</a>. Implementing a Reordering-Tolerant Decompressor ....<a href="#page-16">16</a> |
| 94 |
<a href="#section-6.1.2.1">6.1.2.1</a>. Decompressor Feedback Considerations ......<a href="#page-16">16</a> |
| 95 |
6.1.2.2. Considerations for Local Repair |
| 96 |
Mechanisms ................................<a href="#page-17">17</a> |
| 97 |
6.2. Specifying ROHC Profiles with Robustness against |
| 98 |
Reordering ................................................<a href="#page-17">17</a> |
| 99 |
6.2.1. Profiles with Interpretation Interval |
| 100 |
Offset p = -1 ......................................<a href="#page-17">17</a> |
| 101 |
<a href="#section-6.2.2">6.2.2</a>. Modifying the Interpretation Interval Offset .......<a href="#page-18">18</a> |
| 102 |
<a href="#section-6.2.2.1">6.2.2.1</a>. Example Profile for Handling Reordering ...<a href="#page-18">18</a> |
| 103 |
6.2.2.2. Defining the Values of p for New |
| 104 |
Profiles ..................................<a href="#page-18">18</a> |
| 105 |
|
| 106 |
|
| 107 |
|
| 108 |
<span class="grey">Pelletier, et al. Informational [Page 2]</span></pre> |
| 109 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span> |
| 110 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 111 |
|
| 112 |
|
| 113 |
<a href="#section-7">7</a>. Security Considerations ........................................<a href="#page-19">19</a> |
| 114 |
<a href="#section-8">8</a>. Acknowledgements ...............................................<a href="#page-19">19</a> |
| 115 |
<a href="#section-9">9</a>. Informative References .........................................<a href="#page-19">19</a> |
| 116 |
|
| 117 |
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span> |
| 118 |
|
| 119 |
RObust Header Compression (ROHC), <a href="./rfc3095">RFC 3095</a> [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], defines a framework |
| 120 |
for header compression, along with a number of compression protocols |
| 121 |
(profiles). One operating assumption for the profiles defined in <a href="./rfc3095">RFC</a> |
| 122 |
<a href="./rfc3095">3095</a> is that the channel between compressor and decompressor is |
| 123 |
required to maintain packet ordering for each compressed flow. The |
| 124 |
motivation behind this assumption was that the primary candidate |
| 125 |
channels considered did guarantee in-order delivery of header- |
| 126 |
compressed packets. This assumption made it possible to meet the |
| 127 |
design objectives that were on top of the requirements list at the |
| 128 |
time when ROHC was being designed, namely to improve the compression |
| 129 |
efficiency and the tolerance to packet losses. |
| 130 |
|
| 131 |
Since the publication of <a href="./rfc3095">RFC 3095</a> in 2001, the question about ROHC |
| 132 |
operation over channels that do not guarantee in-order delivery has |
| 133 |
surfaced several times; arguments that ROHC cannot perform adequately |
| 134 |
over such channels have been heard. Specifically, this has been |
| 135 |
raised as a weakness when compared to other header compression |
| 136 |
alternatives, as <a href="./rfc3095">RFC 3095</a> explicitly states its inability to operate |
| 137 |
if in-order delivery is not guaranteed. For those familiar with the |
| 138 |
details of ROHC and of other header compression schemes, it is clear |
| 139 |
that this is a misconception, but it can also be easily understood |
| 140 |
that the wording used in <a href="./rfc3095">RFC 3095</a> can lead to such interpretation. |
| 141 |
|
| 142 |
This document discusses the various aspects of implementing ROHC over |
| 143 |
channels that can reorder header-compressed packets. It explains |
| 144 |
different ways of implementing the profiles found in <a href="./rfc3095">RFC 3095</a>, as |
| 145 |
well as other profiles based on those profiles, over reordering |
| 146 |
channels. This can be achieved either by ensuring that compressor |
| 147 |
implementations use compressed headers that are sufficiently robust |
| 148 |
to the expected possible reordering and/or by modifying decompressor |
| 149 |
implementations to tolerate reordered packets. Ideas regarding how |
| 150 |
existing profiles could be updated and how new profiles can be |
| 151 |
defined to cope efficiently with reordering are also discussed. |
| 152 |
|
| 153 |
In some scenarios, there might be external means (such as a sequence |
| 154 |
number) to detect and potentially correct reordering. That is, for |
| 155 |
example, the case when running compression over an IPsec |
| 156 |
Encapsulating Security Payload (ESP) tunnel. With such external |
| 157 |
means to detect reordering, the decompressor can be modified to make |
| 158 |
use of the external information provided, and reordering can then be |
| 159 |
handled. How to make use of external means to address reordering is, |
| 160 |
however, out of scope for this document. |
| 161 |
|
| 162 |
|
| 163 |
|
| 164 |
<span class="grey">Pelletier, et al. Informational [Page 3]</span></pre> |
| 165 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span> |
| 166 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 167 |
|
| 168 |
|
| 169 |
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Terminology</span> |
| 170 |
|
| 171 |
This document uses terminology consistent with <a href="./rfc3759">RFC 3759</a> [<a href="#ref-2" title=""RObust Header Compression (ROHC): Terminology and Channel Mapping Examples"">2</a>], and is |
| 172 |
in itself only informative. Although it does discuss technical |
| 173 |
aspects of implementing the ROHC specifications in particular |
| 174 |
environments, it does not specify any new technology. |
| 175 |
|
| 176 |
ROHC |
| 177 |
|
| 178 |
The term "ROHC" herein refers to the following profiles: |
| 179 |
|
| 180 |
- 0x0001, 0x0002, and 0x0003 defined in <a href="./rfc3095">RFC 3095</a> [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>]; |
| 181 |
- 0x0004 for compression of IP-only headers [<a href="#ref-3" title=""RObust Header Compression (ROHC): A Compression Profile for IP"">3</a>]; |
| 182 |
- 0x0007 and 0x0008 for compression of UDP-Lite headers [<a href="#ref-4" title=""RObust Header Compression (ROHC): Profiles for User Datagram Protocol (UDP) Lite"">4</a>]. |
| 183 |
|
| 184 |
The term "ROHC" excludes the following profiles, which are either |
| 185 |
not affected by reordering or have the assumption of in-order |
| 186 |
delivery as a fundamental requirement for their proper operation: |
| 187 |
|
| 188 |
- 0x0000 (uncompressed) [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>]; |
| 189 |
- 0x0005 (Link-Layer Assisted (LLA)) [<a href="#ref-5" title=""RObust Header Compression (ROHC): A Link-Layer Assisted Profile for IP/UDP/RTP"">5</a>] and 0x0105 |
| 190 |
(R-mode extension to LLA) [<a href="#ref-6" title=""Zero-byte Support for Bidirectional Reliable Mode (R-mode) in Extended Link-Layer Assisted RObust Header Compression (ROHC) Profile"">6</a>]; |
| 191 |
|
| 192 |
Reordering |
| 193 |
|
| 194 |
A type of transmission taking place between compressor and |
| 195 |
decompressor where in-order delivery of header-compressed packets |
| 196 |
is not guaranteed. |
| 197 |
|
| 198 |
Reordering channel |
| 199 |
|
| 200 |
A connection over which reordering, as defined above, can occur. |
| 201 |
|
| 202 |
Sequentially early packet |
| 203 |
|
| 204 |
A packet that reaches the decompressor before one or several |
| 205 |
packets of the same context identifier (CID) that were delayed on |
| 206 |
the link. At the time of the arrival of a sequentially early |
| 207 |
packet, the packet(s) delayed on the link cannot be differentiated |
| 208 |
from lost packet(s). |
| 209 |
|
| 210 |
Sequentially late packet |
| 211 |
|
| 212 |
A packet is late within its sequence if it reaches the |
| 213 |
decompressor after one or several other packets belonging to the |
| 214 |
same CID have been received, although the sequentially late packet |
| 215 |
was sent from the compressor before the other packet(s). |
| 216 |
|
| 217 |
|
| 218 |
|
| 219 |
|
| 220 |
<span class="grey">Pelletier, et al. Informational [Page 4]</span></pre> |
| 221 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span> |
| 222 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 223 |
|
| 224 |
|
| 225 |
Updating packet |
| 226 |
|
| 227 |
A packet that updates the context of the decompressor, e.g., all |
| 228 |
packets except R-0 and R-1* in <a href="./rfc3095">RFC 3095</a> [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>]. |
| 229 |
|
| 230 |
Non-updating packet |
| 231 |
|
| 232 |
A packet that does not update the context of the decompressor, |
| 233 |
e.g., only R-0 and R-1* in <a href="./rfc3095">RFC 3095</a> [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>]. |
| 234 |
|
| 235 |
Change packet |
| 236 |
|
| 237 |
A packet that updates one or more fields of the context other than |
| 238 |
the fields pertaining to the functions established with respect to |
| 239 |
the sequence number (SN). Specifically, it is a packet that |
| 240 |
updates fields other than the SN, the IPv4 identifier (IP-ID), the |
| 241 |
sequence number of an extension header or the RTP timestamp (TS). |
| 242 |
|
| 243 |
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Applicability of This Document to ROHC Profiles</span> |
| 244 |
|
| 245 |
This document addresses general reordering issues for ROHC profiles. |
| 246 |
The foremost objectives are to ensure that ROHC implementations do |
| 247 |
not forward packets with incorrectly decompressed headers to upper |
| 248 |
layers, as well as to limit the possible increase in the rate of |
| 249 |
decompression failures or in events leading to context damage, when |
| 250 |
compression is applied over reordering channels. |
| 251 |
|
| 252 |
<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. Profiles within Scope</span> |
| 253 |
|
| 254 |
The following sections outline solutions that are generally |
| 255 |
applicable to profiles 0x0001 (RTP), 0x0002 (UDP), and 0x0003 (ESP) |
| 256 |
defined in <a href="./rfc3095">RFC 3095</a> [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>]. Profile 0x0000 (uncompressed) is not |
| 257 |
affected by reordering, as the headers are sent uncompressed. The |
| 258 |
solutions also apply to profiles for IP-only (0x0004) [<a href="#ref-3" title=""RObust Header Compression (ROHC): A Compression Profile for IP"">3</a>] and for |
| 259 |
UDP-Lite (0x0007 and 0x0008) [<a href="#ref-4" title=""RObust Header Compression (ROHC): Profiles for User Datagram Protocol (UDP) Lite"">4</a>]. These profiles are based on the |
| 260 |
profiles of <a href="./rfc3095">RFC 3095</a> [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>] and inherently make the same in-order |
| 261 |
delivery assumption. |
| 262 |
|
| 263 |
<span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a>. Profiles with Special Considerations</span> |
| 264 |
|
| 265 |
Special considerations are needed to make some of the implementation |
| 266 |
solutions of sections <a href="#section-6.1">6.1</a> and <a href="#section-6.2">6.2</a> applicable to profiles 0x0002 (UDP) |
| 267 |
[<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], 0x0004 (IP-only) [<a href="#ref-3" title=""RObust Header Compression (ROHC): A Compression Profile for IP"">3</a>], and 0x0008 (UDP-Lite) [<a href="#ref-4" title=""RObust Header Compression (ROHC): Profiles for User Datagram Protocol (UDP) Lite"">4</a>]. For these |
| 268 |
profiles, the SN is generated at the compressor, as it is not present |
| 269 |
in headers being compressed. For the least significant bit (LSB) |
| 270 |
encoding method, the interpretation interval offset (p) is always |
| 271 |
p = -1 (see <a href="#section-5.1.1">section 5.1.1</a>) when interpreting the SN. The SN is thus |
| 272 |
|
| 273 |
|
| 274 |
|
| 275 |
|
| 276 |
<span class="grey">Pelletier, et al. Informational [Page 5]</span></pre> |
| 277 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span> |
| 278 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 279 |
|
| 280 |
|
| 281 |
required to increase for each packet received at the decompressor, |
| 282 |
which means that reordered packets cannot be decompressed. |
| 283 |
|
| 284 |
<span class="h3"><a class="selflink" id="section-3.3" href="#section-3.3">3.3</a>. Profiles Incompatible with Reordering</span> |
| 285 |
|
| 286 |
The ROHC LLA profiles defined in <a href="./rfc3242">RFC 3242</a> [<a href="#ref-5" title=""RObust Header Compression (ROHC): A Link-Layer Assisted Profile for IP/UDP/RTP"">5</a>] and <a href="./rfc3408">RFC 3408</a> [<a href="#ref-6" title=""Zero-byte Support for Bidirectional Reliable Mode (R-mode) in Extended Link-Layer Assisted RObust Header Compression (ROHC) Profile"">6</a>] have |
| 287 |
been explicitly designed with in-order delivery as a fundamental |
| 288 |
requirement to their proper operation. Profiles 0x0005 and 0x0105 |
| 289 |
can therefore not be implemented over channels where reordering can |
| 290 |
occur; this document therefore does not apply to these profiles. |
| 291 |
|
| 292 |
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Background</span> |
| 293 |
|
| 294 |
ROHC was designed with the assumption that packets are delivered in |
| 295 |
order from compressor to decompressor. This was considered as a |
| 296 |
reasonable working assumption for links where it was expected that |
| 297 |
ROHC would be used. However, many have expressed that it would be |
| 298 |
desirable to use ROHC also over connections where in-order delivery |
| 299 |
is not guaranteed [<a href="#ref-7" title=""Requirements for Header Compression over MPLS"">7</a>]. |
| 300 |
|
| 301 |
<span class="h3"><a class="selflink" id="section-4.1" href="#section-4.1">4.1</a>. Reordering Channels</span> |
| 302 |
|
| 303 |
The reordering channels that are potential candidates to use ROHC are |
| 304 |
single-hop channels and multi-hop virtual channels. |
| 305 |
|
| 306 |
A single-hop channel is a point-to-point link that constitutes a |
| 307 |
single IP hop. Note that one IP hop could be one or multiple |
| 308 |
physical links. For example, a single-hop reordering channel could |
| 309 |
be a wireless link that applies error detection and performs |
| 310 |
retransmissions to guarantee error-free delivery of all data. |
| 311 |
Another example could be a wireless connection that performs |
| 312 |
bicasting of data during a handoff procedure. |
| 313 |
|
| 314 |
A multi-hop virtual channel is a virtual point-to-point link that |
| 315 |
traverses multiple IP hops. A multi-hop virtual channel would |
| 316 |
typically be an IP tunnel, where compression is applied over the |
| 317 |
tunnel by the endpoints of the tunnel (not to be confused with single |
| 318 |
link compression of tunneled packets). |
| 319 |
|
| 320 |
<span class="h3"><a class="selflink" id="section-4.2" href="#section-4.2">4.2</a>. Robustness Principles of ROHC</span> |
| 321 |
|
| 322 |
Robustness is based on the optimistic approach in the unidirectional |
| 323 |
and optimistic modes of operation (U/O-mode), and on the secure |
| 324 |
reference principle in the bidirectional reliable mode (R-mode). |
| 325 |
Both approaches have different characteristics in the presence of |
| 326 |
reordering between compressor and decompressor. However, in any |
| 327 |
mode, decompression of sequentially early packets will generally be |
| 328 |
|
| 329 |
|
| 330 |
|
| 331 |
|
| 332 |
<span class="grey">Pelletier, et al. Informational [Page 6]</span></pre> |
| 333 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span> |
| 334 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 335 |
|
| 336 |
|
| 337 |
handled quite well since they will be perceived and treated by the |
| 338 |
decompressor as if there had been one or more packet losses. |
| 339 |
|
| 340 |
<span class="h4"><a class="selflink" id="section-4.2.1" href="#section-4.2.1">4.2.1</a>. Optimistic Approach (U/O-mode)</span> |
| 341 |
|
| 342 |
A ROHC compressor uses the optimistic approach to reduce header |
| 343 |
overhead when performing context updates in U/O-mode. The compressor |
| 344 |
normally repeats the same update until it is fairly confident that |
| 345 |
the decompressor has successfully received the information. The |
| 346 |
number of consecutive packets needed to obtain this confidence is |
| 347 |
open to implementations, and this number is normally related to the |
| 348 |
packet loss characteristics of the link where header compression is |
| 349 |
used (see also [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], section 5.3.1.1.1). |
| 350 |
|
| 351 |
All packet types used in U/O-mode are context updating. |
| 352 |
|
| 353 |
<span class="h4"><a class="selflink" id="section-4.2.2" href="#section-4.2.2">4.2.2</a>. Secure Reference Principle (R-mode)</span> |
| 354 |
|
| 355 |
A ROHC compressor uses the secure reference principle in R-mode to |
| 356 |
ensure that context synchronization between ROHC peers cannot be lost |
| 357 |
due to packet losses. The compressor obtains its confidence that the |
| 358 |
decompressor has successfully updated the context from a packet |
| 359 |
carrying a 7- or 8-bit Cyclic Redundancy Check (CRC) based on |
| 360 |
acknowledgements received from the decompressor (see also [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], |
| 361 |
section 5.5.1.2). |
| 362 |
|
| 363 |
The secure reference principle makes it possible for a compressor to |
| 364 |
use packets that do not update the context (i.e., R-0 and R-1* [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>]). |
| 365 |
|
| 366 |
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Problem Description</span> |
| 367 |
|
| 368 |
<span class="h3"><a class="selflink" id="section-5.1" href="#section-5.1">5.1</a>. ROHC and Reordering Channels</span> |
| 369 |
|
| 370 |
This section reviews different aspects of ROHC susceptible of being |
| 371 |
impacted by reordering of compressed packets between ROHC peers. |
| 372 |
|
| 373 |
<span class="h4"><a class="selflink" id="section-5.1.1" href="#section-5.1.1">5.1.1</a>. LSB Interpretation Interval and Reordering</span> |
| 374 |
|
| 375 |
The least significant bit (LSB) encoding method defined in <a href="./rfc3095">RFC 3095</a> |
| 376 |
([<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], section 5.7) specifies the interpretation interval offset, |
| 377 |
called p, as follows: |
| 378 |
|
| 379 |
For profiles 0x0001, 0x0003, and 0x0007: |
| 380 |
|
| 381 |
p = 1, when bits(SN) <= 4; |
| 382 |
p = 2^(bits(SN)-5) - 1 otherwise. |
| 383 |
|
| 384 |
|
| 385 |
|
| 386 |
|
| 387 |
|
| 388 |
<span class="grey">Pelletier, et al. Informational [Page 7]</span></pre> |
| 389 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span> |
| 390 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 391 |
|
| 392 |
|
| 393 |
The resulting table describing the interpretation interval is as |
| 394 |
follows: |
| 395 |
|
| 396 |
+-----------+--------------+--------------+ |
| 397 |
| bits (SN) | Offset p | (2^k-1) - p | |
| 398 |
| k | (reordering) | (losses) | |
| 399 |
+-----------+--------------+--------------+ |
| 400 |
| 4 | 1 | 14 | |
| 401 |
| 5 | 0 | 31 | |
| 402 |
| 6 | 1 | 62 | |
| 403 |
| 7 | 3 | 124 | |
| 404 |
| 8 | 7 | 248 | |
| 405 |
| 9 | 15 | 496 | |
| 406 |
+-----------+--------------+--------------+ |
| 407 |
|
| 408 |
As shown in the table above, the ability for ROHC to handle |
| 409 |
sequentially late packets depends on the number of bits sent in |
| 410 |
each packet. For example, a sequentially late packet of type 0 |
| 411 |
(with either 4 or 6 bits of SN) sets the limit to one packet out |
| 412 |
of sequence for successful decompression to be possible. |
| 413 |
|
| 414 |
For profiles 0x0002, 0x0004, and 0x0008: |
| 415 |
|
| 416 |
p = - 1, independently of bits(SN). |
| 417 |
|
| 418 |
A value of p = -1 means that the interpretation interval offset |
| 419 |
can only take positive values and that no sequentially late packet |
| 420 |
can be decompressed if reordering occurs over the link. |
| 421 |
|
| 422 |
The trade-off between reordering and robustness |
| 423 |
|
| 424 |
The ability of ROHC to handle sequentially late packets is limited |
| 425 |
by the interpretation interval offset of the sliding window used |
| 426 |
for LSB encoding. This offset has a very small value for packets |
| 427 |
with a small number of sequence number (SN) bits, but grows with |
| 428 |
the number of SN bits transmitted. |
| 429 |
|
| 430 |
For channels where both packet losses and reordering can occur, |
| 431 |
modifications to the interpretation interval face a trade-off |
| 432 |
between the amount of reordering and the number of consecutive |
| 433 |
packet losses that can be handled by the decompressor. If the |
| 434 |
negative offset (i.e., p) is increased to handle a larger amount |
| 435 |
of reordering, the value of the positive offset of the |
| 436 |
interpretation interval must be decreased. This may impact the |
| 437 |
compression efficiency when the channel has a high loss rate. |
| 438 |
|
| 439 |
|
| 440 |
|
| 441 |
|
| 442 |
|
| 443 |
|
| 444 |
<span class="grey">Pelletier, et al. Informational [Page 8]</span></pre> |
| 445 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span> |
| 446 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 447 |
|
| 448 |
|
| 449 |
This is shown in the figure: |
| 450 |
|
| 451 |
<--- interpretation interval (size is 2^k) ----> |
| 452 |
|------------------+---------------------------| |
| 453 |
Lower v_ref Upper |
| 454 |
Bound Bound |
| 455 |
<--- reordering --> <--------- losses ---------> |
| 456 |
max delta(SN) = p max delta(SN) = (2^k-1) - p |
| 457 |
|
| 458 |
where v_ref is the reference value as per [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], section 4.5.1. |
| 459 |
|
| 460 |
In practice, the maximum variation in SN value (max delta(SN)) due |
| 461 |
to reordering that can be handled will normally correspond to the |
| 462 |
maximum number of packets that can be reordered. The same applies |
| 463 |
to the maximum number of consecutive packet losses covered by the |
| 464 |
robustness interval. |
| 465 |
|
| 466 |
Timer-based compression of RTP TS (see [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], section 4.5.4) provides |
| 467 |
means to reduce the number of timestamp bits needed in compressed |
| 468 |
headers after longer gaps in the packet stream (e.g., for an audio |
| 469 |
stream, this is typically due to silence suppression). To use |
| 470 |
timer-based compression, an upper limit on the inter-arrival jitter |
| 471 |
must be reliably estimated by the compressor. It should be noted |
| 472 |
that although the risk of reordering of course means there is a more |
| 473 |
significant jitter on the path between the compressor and the |
| 474 |
decompressor, there are no special reordering considerations for |
| 475 |
timer-based compression. It all still boils down to the task of |
| 476 |
estimating the jitter, requiring channel characteristics knowledge at |
| 477 |
the compressor, and/or jitter estimation figures received from the |
| 478 |
decompressor. |
| 479 |
|
| 480 |
<span class="h4"><a class="selflink" id="section-5.1.2" href="#section-5.1.2">5.1.2</a>. Reordering of Packets in R-mode</span> |
| 481 |
|
| 482 |
<span class="h5"><a class="selflink" id="section-5.1.2.1" href="#section-5.1.2.1">5.1.2.1</a>. Updating Packets</span> |
| 483 |
|
| 484 |
The compressor always adds references in the sliding window for all |
| 485 |
updating packets sent. The compressor removes values older than |
| 486 |
values for which it has received an acknowledgement to shrink the |
| 487 |
window and thereby increase the compression efficiency. |
| 488 |
|
| 489 |
The decompressor always updates the context when receiving an |
| 490 |
updating packet and uses the new reference for decompression. |
| 491 |
Acknowledgements are sent to allow the compressor to shrink its |
| 492 |
sliding window. |
| 493 |
|
| 494 |
|
| 495 |
|
| 496 |
|
| 497 |
|
| 498 |
|
| 499 |
|
| 500 |
<span class="grey">Pelletier, et al. Informational [Page 9]</span></pre> |
| 501 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span> |
| 502 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 503 |
|
| 504 |
|
| 505 |
Reordering between updating packets |
| 506 |
|
| 507 |
The decompressor can update its context from the reception of a |
| 508 |
sequentially late updating packet. The decompressor reference is |
| 509 |
then updated with a value that is no longer in the sliding window |
| 510 |
of the compressor. This "missing reference" can be caused by |
| 511 |
reordering when operating in R-mode. |
| 512 |
|
| 513 |
The result is that the compressor and the decompressor lose |
| 514 |
synchronization with each other. When the decompressor |
| 515 |
acknowledges the sequentially late packet, the compressor might |
| 516 |
already have discarded the reference to this sequence number, and |
| 517 |
continue to compress packets based on more recent references (in |
| 518 |
packet arrival time). Decompression will then be attempted using |
| 519 |
the wrong reference. |
| 520 |
|
| 521 |
<span class="h5"><a class="selflink" id="section-5.1.2.2" href="#section-5.1.2.2">5.1.2.2</a>. Non-Updating Packets</span> |
| 522 |
|
| 523 |
Reordering between non-updating packets only |
| 524 |
|
| 525 |
A non-updating packet that reaches the decompressor out of |
| 526 |
sequence only with respect to other non-updating packets can |
| 527 |
always be decompressed properly. |
| 528 |
|
| 529 |
Reordering between non-updating packets and updating packets |
| 530 |
|
| 531 |
When a non-updating packet is reordered and becomes sequentially |
| 532 |
late with respect to an updating packet, the decompressor may have |
| 533 |
already updated the context with a new reference when the late |
| 534 |
packet is received. It is thus possible for a non-updating packet |
| 535 |
to be decompressed based on the wrong reference because of |
| 536 |
reordering when operating in R-mode. |
| 537 |
|
| 538 |
Since decompression of non-updating packets cannot be verified, |
| 539 |
this can lead to a packet erroneously decompressed to be forwarded |
| 540 |
to upper layers. |
| 541 |
|
| 542 |
<span class="h4"><a class="selflink" id="section-5.1.3" href="#section-5.1.3">5.1.3</a>. Reordering of Packets in U/O-mode</span> |
| 543 |
|
| 544 |
Reordering between non-change packets only |
| 545 |
|
| 546 |
When only non-change packets are reordered with respect to each |
| 547 |
other, decompression of sequentially late packets is limited by |
| 548 |
the offset p of the interpretation interval (see <a href="#section-5.1.1">section 5.1.1</a>). |
| 549 |
Decompression of a sequentially late packet with SN = x is |
| 550 |
possible if the value of the SN of the packet that last updated |
| 551 |
the context was less than or equal to x + p. |
| 552 |
|
| 553 |
|
| 554 |
|
| 555 |
|
| 556 |
<span class="grey">Pelletier, et al. Informational [Page 10]</span></pre> |
| 557 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span> |
| 558 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 559 |
|
| 560 |
|
| 561 |
Problems occur if context(SN) has increased by more than p with |
| 562 |
respect to field(SN) carried within the packet to decompress. |
| 563 |
|
| 564 |
This means that for a well-behaved stream with a constant unit |
| 565 |
increase in the RTP SN, a packet can arrive up to p packets out of |
| 566 |
sequence and still be correctly decompressed. Otherwise, it |
| 567 |
cannot be properly decompressed. It also means that if the |
| 568 |
compressor sends two consecutive packets with SN(packet1)=100 and |
| 569 |
SN(packet2)=108 when p=7, packet1 cannot be decompressed if it |
| 570 |
arrives even one packet late due to reordering. |
| 571 |
|
| 572 |
Reordering involving change packets |
| 573 |
|
| 574 |
When a packet is reordered and becomes sequentially late with |
| 575 |
respect to a change packet, decompression of the late packet may |
| 576 |
eventually fail, as the context information required for |
| 577 |
successful decompression may not be available anymore. |
| 578 |
|
| 579 |
Decompression can always be verified since all U/O-mode packet types |
| 580 |
are context updating. Consequently, a failure to decompress a packet |
| 581 |
that is caused by reordering can be detected, and context |
| 582 |
invalidation due to reordering can thus be avoided. The risk of |
| 583 |
forwarding incorrectly decompressed packets to upper layers is |
| 584 |
therefore small when operating in U/O-mode. For channels known to |
| 585 |
reorder packets, U/O-mode should therefore be the preferred mode of |
| 586 |
operation. The additional risk of losing context synchronization, or |
| 587 |
for erroneous packet to be delivered to upper layers, is limited. |
| 588 |
|
| 589 |
<span class="h4"><a class="selflink" id="section-5.1.4" href="#section-5.1.4">5.1.4</a>. Reordering on the Feedback Channel</span> |
| 590 |
|
| 591 |
For R-mode, upon reception of an acknowledgement, the compressor |
| 592 |
searches the sliding window to locate an updating packet with the |
| 593 |
corresponding SN; if it is not found, the acknowledgement is invalid |
| 594 |
and is discarded ([<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], section 5.5.1.2). In other words, feedback |
| 595 |
received out of order either is still useful or is discarded. |
| 596 |
|
| 597 |
In U/O-mode, if the compressor updates its context based on feedback, |
| 598 |
the same logic as for R-mode applies in practice. |
| 599 |
|
| 600 |
Reordering on the feedback channel has thus no impact in either mode. |
| 601 |
|
| 602 |
<span class="h4"><a class="selflink" id="section-5.1.5" href="#section-5.1.5">5.1.5</a>. List Compression</span> |
| 603 |
|
| 604 |
ROHC list compression is an additional compression scheme for RTP |
| 605 |
contributing source (CSRC) lists and IP extension header chains. The |
| 606 |
base is called table-based item compression, and it is almost |
| 607 |
completely independent from the rest of the ROHC compression logic. |
| 608 |
Therefore, this part of the scheme does not exhibit any special |
| 609 |
|
| 610 |
|
| 611 |
|
| 612 |
<span class="grey">Pelletier, et al. Informational [Page 11]</span></pre> |
| 613 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span> |
| 614 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 615 |
|
| 616 |
|
| 617 |
vulnerabilities when it comes to reordering, assuming a reasonable |
| 618 |
optimistic approach is used in U/O-mode. Specifically, it does not |
| 619 |
suffer significantly from the "missing reference" problem when |
| 620 |
operating in R-mode. |
| 621 |
|
| 622 |
On top of the table-based item compression mechanism, an additional |
| 623 |
compression technique may be used, called reference based list |
| 624 |
compression. Reference based list compression however has a logic |
| 625 |
that is similar to the rest of the ROHC compression logic, and |
| 626 |
therefore it suffers from similar reordering vulnerabilities, |
| 627 |
especially the "missing reference" problem of R-mode. Note, however, |
| 628 |
that the generation identifier used in U/O-mode makes that scheme |
| 629 |
more robust to reordering. |
| 630 |
|
| 631 |
When using list encoding type 1, 2, or 3, which makes use of |
| 632 |
reference lists, decompression will succeed only if all individual |
| 633 |
items are known by the decompressor, along with the correct reference |
| 634 |
list required to properly decompress the packet. List compression |
| 635 |
using the "Generic scheme", also known as "Encoding type 0", is not |
| 636 |
using reference based list compression, and type 0 decompression will |
| 637 |
thus succeed as long as all individual items are known by the |
| 638 |
decompressor. Because of this, type 0 list compression should be the |
| 639 |
preferred method used when operating over reordering channels. |
| 640 |
|
| 641 |
<span class="h4"><a class="selflink" id="section-5.1.6" href="#section-5.1.6">5.1.6</a>. Reordering and Mode Transitions</span> |
| 642 |
|
| 643 |
Transition from U/O-mode to R-mode |
| 644 |
|
| 645 |
This transition can be affected by reordering if a packet type 0 |
| 646 |
(UO-0) is reordered and delayed by at least one round-trip time |
| 647 |
(RTT). If the decompressor initiates a mode change request to |
| 648 |
R-mode in the meantime, the reordered UO-0 packet may be handled |
| 649 |
as an R-0 packet; it can be erroneously decompressed and forwarded |
| 650 |
to upper layers. This is because the decompressor can switch to |
| 651 |
R-mode as soon as it sends the acknowledgement Ack(SN, R) to the |
| 652 |
compressor (see also [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], section 5.6). |
| 653 |
|
| 654 |
Transition from R-mode to U/O-mode |
| 655 |
|
| 656 |
A similar situation as above can occur during this transition. |
| 657 |
However, because the outcome of the decompression is always |
| 658 |
verified using a CRC verification in U/O-mode, the reordered |
| 659 |
packet will most likely fail decompression and will be discarded. |
| 660 |
|
| 661 |
The above situation, although it is not deemed to occur frequently, |
| 662 |
is still possible; thus, mode transitions from U/O-mode to R-mode |
| 663 |
should be avoided when reordering can occur. |
| 664 |
|
| 665 |
|
| 666 |
|
| 667 |
|
| 668 |
<span class="grey">Pelletier, et al. Informational [Page 12]</span></pre> |
| 669 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span> |
| 670 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 671 |
|
| 672 |
|
| 673 |
<span class="h3"><a class="selflink" id="section-5.2" href="#section-5.2">5.2</a>. Consequences of Reordering</span> |
| 674 |
|
| 675 |
The context updating properties of the packets exchanged between ROHC |
| 676 |
peers are the most important factors to consider when deriving the |
| 677 |
impacts of reordering. For this reason, the robustness properties of |
| 678 |
the U/O-mode and of the R-mode are affected differently. |
| 679 |
|
| 680 |
The effects of reordering on ROHC can be summarized as follows: |
| 681 |
|
| 682 |
- Functionality incompatible with reordering; |
| 683 |
- Increased probability of context damage (loss of synchronization); |
| 684 |
- Increased number of decompression failures - Detected (U/O/R-mode); |
| 685 |
- Increased number of decompression failures - Undetected (R-mode). |
| 686 |
|
| 687 |
<span class="h4"><a class="selflink" id="section-5.2.1" href="#section-5.2.1">5.2.1</a>. Functionality Incompatible with Reordering</span> |
| 688 |
|
| 689 |
There is one optional ROHC function that cannot work in the presence |
| 690 |
of reordering between ROHC peers. |
| 691 |
|
| 692 |
The ROHC segmentation scheme (see [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], section 5.2.5) relies entirely |
| 693 |
on the in-order delivery of each segment, as there is no sequencing |
| 694 |
information in the segments. A segmented packet for which one (or |
| 695 |
more) segment is received out of order cannot be decompressed, and it |
| 696 |
is discarded by the decompressor. Therefore, segmentation should not |
| 697 |
be used if there can be reordering between the ROHC peers. |
| 698 |
|
| 699 |
The use of this optional feature is open to implementations and is |
| 700 |
local to the compressor only; it does not impact the decompressor. |
| 701 |
|
| 702 |
<span class="h4"><a class="selflink" id="section-5.2.2" href="#section-5.2.2">5.2.2</a>. Context Damage (Loss of Synchronization)</span> |
| 703 |
|
| 704 |
Reordering of packets between ROHC peers can impact the robustness |
| 705 |
properties of the optimistic approach (U/O-mode) as well as the |
| 706 |
reliability of the secure reference principle (R-mode). |
| 707 |
|
| 708 |
The successful decompression of a sequentially late change packet |
| 709 |
(U/O-mode) and/or updating packet (R-mode) can update the context of |
| 710 |
the decompressor in a manner unexpected by the compressor. This can |
| 711 |
lead to a loss of context synchronization between the ROHC peers. |
| 712 |
|
| 713 |
<span class="h4"><a class="selflink" id="section-5.2.3" href="#section-5.2.3">5.2.3</a>. Detected Decompression Failures (U/O/R-mode)</span> |
| 714 |
|
| 715 |
Reordering of packets between ROHC peers can lead to an increase in |
| 716 |
the number of decompression failures for context updating packets |
| 717 |
(see sections <a href="#section-5.1.2.1">5.1.2.1</a> and <a href="#section-5.1.3">5.1.3</a>). Fortunately, as the outcome of the |
| 718 |
decompression of updating packets can be verified, the decompressor |
| 719 |
can reliably detect decompression failures, including those caused by |
| 720 |
reordering, and discard the packet. Note that local repairs, subject |
| 721 |
|
| 722 |
|
| 723 |
|
| 724 |
<span class="grey">Pelletier, et al. Informational [Page 13]</span></pre> |
| 725 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span> |
| 726 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 727 |
|
| 728 |
|
| 729 |
to the limitations stated in [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>] <a href="#section-5.3.2.2.3">section 5.3.2.2.3</a>, can still be |
| 730 |
performed. |
| 731 |
|
| 732 |
<span class="h4"><a class="selflink" id="section-5.2.4" href="#section-5.2.4">5.2.4</a>. Undetected Decompression Failures (R-mode only)</span> |
| 733 |
|
| 734 |
Reordering of packets between ROHC peers can lead to an increase in |
| 735 |
the number of decompression errors for non-updating packets. For |
| 736 |
R-mode, decompression of R-0 and R-1* packets cannot be verified. If |
| 737 |
reordering occurs and decompression is performed using the wrong |
| 738 |
secure reference (see <a href="#section-5.1.2.1">section 5.1.2.1</a> and 5.1.2.2), the decompressor |
| 739 |
cannot reliably detect such errors. As a result, erroneous packets |
| 740 |
may be forwarded to upper layers. |
| 741 |
|
| 742 |
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Making ROHC Tolerant against Reordering</span> |
| 743 |
|
| 744 |
This section describes different approaches that can improve the |
| 745 |
performance of ROHC when used over reordering channels and minimize |
| 746 |
the effects of reordering. Examples are provided to guide |
| 747 |
implementers and designers of new profiles. The solutions target |
| 748 |
either the properties of ROHC implementations or the specification of |
| 749 |
profiles. This is covered by sections <a href="#section-6.1">6.1</a> and <a href="#section-6.2">6.2</a>, respectively. |
| 750 |
|
| 751 |
<span class="h3"><a class="selflink" id="section-6.1" href="#section-6.1">6.1</a>. Properties of ROHC Implementations</span> |
| 752 |
|
| 753 |
Existing ROHC profiles can be implemented with the capability to |
| 754 |
properly handle packet reordering. The methods described in this |
| 755 |
section conform with, and thus do not require any modifications to, |
| 756 |
the ROHC specifications within scope of this document (see <a href="#section-3">section</a> |
| 757 |
<a href="#section-3">3</a>). Specifically, the methods presented in this section can be |
| 758 |
implemented without any impairment to interoperability with other |
| 759 |
ROHC implementations that do not use these methods. |
| 760 |
|
| 761 |
The methods suggested here may, however, lower the compression |
| 762 |
efficiency, and these modifications should not be used when |
| 763 |
reordering is known not to occur. Some of these methods aim to |
| 764 |
increase the decompression success rate at the decompressor, while |
| 765 |
others aim to avoid context damage that would cause a loss of context |
| 766 |
synchronization between compressor and decompressor. |
| 767 |
|
| 768 |
The methods proposed are each addressing specific issues listed in |
| 769 |
<a href="#section-5">section 5</a> and can be combined to achieve better robustness against |
| 770 |
reordering. |
| 771 |
|
| 772 |
<span class="h4"><a class="selflink" id="section-6.1.1" href="#section-6.1.1">6.1.1</a>. Compressing Headers with Robustness against Reordering</span> |
| 773 |
|
| 774 |
The methods described in this section are methods local only to the |
| 775 |
compressor implementation. They can be used without modifications or |
| 776 |
impact to the decompressor. |
| 777 |
|
| 778 |
|
| 779 |
|
| 780 |
<span class="grey">Pelletier, et al. Informational [Page 14]</span></pre> |
| 781 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span> |
| 782 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 783 |
|
| 784 |
|
| 785 |
<span class="h5"><a class="selflink" id="section-6.1.1.1" href="#section-6.1.1.1">6.1.1.1</a>. Reordering and the Optimistic Approach</span> |
| 786 |
|
| 787 |
The optimistic approach is affected by the reordering characteristics |
| 788 |
of the channel when operating over a reordering channel. Compressor |
| 789 |
implementations should therefore adjust their optimistic approach |
| 790 |
strategy to match both packet loss and reordering characteristics. |
| 791 |
|
| 792 |
For example, the number of repetitions for each context update can be |
| 793 |
increased. The compressor should ensure that each update is repeated |
| 794 |
until it is reasonably confident that at least one change packet in |
| 795 |
the sequence of repetitions has reached the decompressor before the |
| 796 |
first packet sent after this sequence. |
| 797 |
|
| 798 |
<span class="h5"><a class="selflink" id="section-6.1.1.2" href="#section-6.1.1.2">6.1.1.2</a>. Reordering and the Secure Reference Principle</span> |
| 799 |
|
| 800 |
Fundamental to the secure reference principle is that only values |
| 801 |
acknowledged by the decompressor can be used as reference for |
| 802 |
compression. In addition, some of the packet types used in R-mode do |
| 803 |
not include a CRC over the original uncompressed header, and the |
| 804 |
decompressor has no means to verify the outcome of the decompression. |
| 805 |
|
| 806 |
Decompression of non-updating packet types thus entirely relies on |
| 807 |
the cumulative effect of previous updates to the secure reference, |
| 808 |
and the compressed data is based on the current value of the |
| 809 |
reference. This reference must be synchronized between ROHC peers. |
| 810 |
For R-0 and R-1* packets, the reception of the encoded bits applied |
| 811 |
to the secure reference is sufficient for correct decompression, but |
| 812 |
only when in-order delivery between ROHC peers is guaranteed. |
| 813 |
|
| 814 |
Avoiding the "missing reference" problem (<a href="#section-5.1.2.1">section 5.1.2.1</a>) |
| 815 |
|
| 816 |
A compressor implementation can delay the advance in the sliding |
| 817 |
window to a reference acknowledged by the decompressor, until it |
| 818 |
has confidence that no acknowledgement for any of the values that |
| 819 |
could be discarded can be received. This confidence can be based |
| 820 |
on the maximum delay that reordering can introduce over the |
| 821 |
channel. |
| 822 |
|
| 823 |
<span class="h5"><a class="selflink" id="section-6.1.1.3" href="#section-6.1.1.3">6.1.1.3</a>. Robust Selection of Compressed Header</span> |
| 824 |
|
| 825 |
Packet formats can be chosen with an interpretation interval for the |
| 826 |
LSB encoded sequence number that allows for larger negative offsets |
| 827 |
(see <a href="#section-5.1.1">section 5.1.1</a>). This provides the capability to decompress |
| 828 |
sequentially late packets with a greater amount of reordering. |
| 829 |
|
| 830 |
To achieve this, the compressor should be implemented conservatively |
| 831 |
in terms of the choice of packet types to send, by transmitting |
| 832 |
packets with more sequence number bits. As shown in the table in |
| 833 |
|
| 834 |
|
| 835 |
|
| 836 |
<span class="grey">Pelletier, et al. Informational [Page 15]</span></pre> |
| 837 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span> |
| 838 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 839 |
|
| 840 |
|
| 841 |
<a href="#section-5.1.1">section 5.1.1</a>, using 8 bits of SN allows a packet to be decompressed |
| 842 |
when the reordering leads to up to 7 units in sequence number |
| 843 |
variation (i.e., delta(SN)). Increasing the number of SN bits (i.e., |
| 844 |
using a larger SN_k [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>]) transmitted will make ROHC even more |
| 845 |
tolerant to reordering. |
| 846 |
|
| 847 |
For example, a conservative compressor implementation could use the |
| 848 |
packet types as shown in the table below: |
| 849 |
|
| 850 |
+----------------------+-------------------------+ |
| 851 |
| Optimal Packet Type | Alternative Packet Type | |
| 852 |
| (without reordering) | (reordering possible) | |
| 853 |
+----------------------+-------------------------+ |
| 854 |
| UO-0 | UOR-2*-ext0 | |
| 855 |
| R-0 | R-1*-ext0 | |
| 856 |
| R-0-CRC | UOR-2*-ext0 | |
| 857 |
| R-1* | R-1*-ext0 | |
| 858 |
| UO-1 | UOR-2-ext0 | |
| 859 |
| UO-1-TS | UOR-2-TS-ext0 | |
| 860 |
| UO-1-ID | UO-1-ID-ext3 (with S=1) | |
| 861 |
| | UOR-2-ID-ext0 | |
| 862 |
| UOR-2* | UOR-2*-ext0 | |
| 863 |
+----------------------+-------------------------+ |
| 864 |
|
| 865 |
Such a compressor implementation would thus always be sending at |
| 866 |
least 3 octets (R-mode) or 4 octets (U/O-mode). This is a trade-off |
| 867 |
when compared to the 1 octet that can be sent by a more aggressive |
| 868 |
implementation operating on a channel with no reordering. |
| 869 |
|
| 870 |
Note that since the interpretation interval for profiles 0x0002, |
| 871 |
0x0004, and 0x0008 is always p = -1 independently of bits(SN), the |
| 872 |
methods suggested in this section will not work for these profiles |
| 873 |
unless this value is modified (<a href="#section-6.2.1">section 6.2.1</a>). |
| 874 |
|
| 875 |
<span class="h4"><a class="selflink" id="section-6.1.2" href="#section-6.1.2">6.1.2</a>. Implementing a Reordering-Tolerant Decompressor</span> |
| 876 |
|
| 877 |
The methods described in this section are methods local only to the |
| 878 |
decompressor implementation. They can be used without modifications |
| 879 |
or impact to the compressor. |
| 880 |
|
| 881 |
<span class="h5"><a class="selflink" id="section-6.1.2.1" href="#section-6.1.2.1">6.1.2.1</a>. Decompressor Feedback Considerations</span> |
| 882 |
|
| 883 |
Reducing the feedback rate when the flow behaves linearly |
| 884 |
|
| 885 |
The decompressor should reduce its feedback rate when a large |
| 886 |
number of UOR-2 packets with extensions are received, when the |
| 887 |
flow behaves linearly (i.e., when only fields pertaining to the |
| 888 |
|
| 889 |
|
| 890 |
|
| 891 |
|
| 892 |
<span class="grey">Pelletier, et al. Informational [Page 16]</span></pre> |
| 893 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span> |
| 894 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 895 |
|
| 896 |
|
| 897 |
functions established with respect to the sequence number are |
| 898 |
changing). |
| 899 |
|
| 900 |
In particular, if the compressor implementation makes a more |
| 901 |
conservative selection of packet types (<a href="#section-6.1.1.3">section 6.1.1.3</a>) in order |
| 902 |
to handle reordering, the decompressor should try to avoid sending |
| 903 |
more feedback than it would for the case where the more optimal |
| 904 |
packet types are used. This can be useful to minimize the usage |
| 905 |
of the feedback channel, thereby improving efficiency of the link. |
| 906 |
|
| 907 |
Note that even if the decompressor does not make this adjustment |
| 908 |
to its feedback rate, packet losses or context damages will not |
| 909 |
increase. |
| 910 |
|
| 911 |
Acknowledgements and sequentially late packets |
| 912 |
|
| 913 |
Reordered feedback (or feedback for packets received out of order) |
| 914 |
will not cause problems (see <a href="#section-5.1.4">section 5.1.4</a>). However, the |
| 915 |
decompressor should not send acknowledging feedback for a packet |
| 916 |
that can be identified as being sequentially late (e.g., based on |
| 917 |
the sequence number of the packet), as the current state of the |
| 918 |
context will better reflect the compressor context than the |
| 919 |
content of the reordered packet. |
| 920 |
|
| 921 |
<span class="h5"><a class="selflink" id="section-6.1.2.2" href="#section-6.1.2.2">6.1.2.2</a>. Considerations for Local Repair Mechanisms</span> |
| 922 |
|
| 923 |
When decompression fails, and if reordering can be assumed to be the |
| 924 |
cause of this failure, subsequent decompressions may be attempted for |
| 925 |
sequentially late packets by going backward in the interpretation |
| 926 |
interval (as opposed to moving forward for local repair). If one of |
| 927 |
the decompression attempts is successful, the late packet may be |
| 928 |
passed on to upper layers with or without updating the decompressor |
| 929 |
context. If the subsequent decompression attempt fails, the packet |
| 930 |
should be handled according to [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>] <a href="#section-5.3.2.2.3">section 5.3.2.2.3</a>. |
| 931 |
|
| 932 |
<span class="h3"><a class="selflink" id="section-6.2" href="#section-6.2">6.2</a>. Specifying ROHC Profiles with Robustness against Reordering</span> |
| 933 |
|
| 934 |
<span class="h4"><a class="selflink" id="section-6.2.1" href="#section-6.2.1">6.2.1</a>. Profiles with Interpretation Interval Offset p = -1</span> |
| 935 |
|
| 936 |
New revisions of profiles 0x0002 (UDP) [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], 0x0004 (IP-only) [<a href="#ref-3" title=""RObust Header Compression (ROHC): A Compression Profile for IP"">3</a>], and |
| 937 |
0x0008 (UDP-Lite) [<a href="#ref-4" title=""RObust Header Compression (ROHC): Profiles for User Datagram Protocol (UDP) Lite"">4</a>] should redefine how the value of the offset p |
| 938 |
is determined, and use the same algorithm as in profile 0x0001 [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>] |
| 939 |
instead of p = -1 independently of bits(SN) (<a href="#section-5.1.1">section 5.1.1</a>). |
| 940 |
|
| 941 |
While such a change would make these updated profiles slightly less |
| 942 |
robust to packet losses, they would still be no less robust than |
| 943 |
profile 0x0001. |
| 944 |
|
| 945 |
|
| 946 |
|
| 947 |
|
| 948 |
<span class="grey">Pelletier, et al. Informational [Page 17]</span></pre> |
| 949 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span> |
| 950 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 951 |
|
| 952 |
|
| 953 |
<span class="h4"><a class="selflink" id="section-6.2.2" href="#section-6.2.2">6.2.2</a>. Modifying the Interpretation Interval Offset</span> |
| 954 |
|
| 955 |
The interpretation interval offset p could be modified for existing |
| 956 |
profiles to handle reordering while improving the compression |
| 957 |
efficiency when compared to the solution in <a href="#section-6.1.1.3">section 6.1.1.3</a>. |
| 958 |
|
| 959 |
<span class="h5"><a class="selflink" id="section-6.2.2.1" href="#section-6.2.2.1">6.2.2.1</a>. Example Profile for Handling Reordering</span> |
| 960 |
|
| 961 |
The value of the interpretation interval offset p can be adjusted to |
| 962 |
achieve a robustness against reordering similar to the effect of |
| 963 |
selecting packet types as suggested in <a href="#section-6.1.1.3">section 6.1.1.3</a>. |
| 964 |
|
| 965 |
Consider a scenario where robustness against packet losses is kept a |
| 966 |
priority, and for which of a value p=7 is deemed enough. In this |
| 967 |
case, a ratio where the positive offset is about twice as large as |
| 968 |
the negative offset can be used. This leaves a value of p = 2^k/ 3. |
| 969 |
|
| 970 |
The resulting values are shown in the following table: |
| 971 |
|
| 972 |
+-----------+--------------+----------------+ |
| 973 |
| bits (SN) | Offset p | Positive range | |
| 974 |
| k | (reordering) | (losses) | |
| 975 |
+-----------+--------------+----------------+ |
| 976 |
| 4 | 5 | 10 | |
| 977 |
| 5 | 10 | 21 | |
| 978 |
| 6 | 21 | 42 | |
| 979 |
| 7 | 42 | 85 | |
| 980 |
| 8 | 85 | 170 | |
| 981 |
| 9 | 170 | 341 | |
| 982 |
+-----------+--------------+----------------+ |
| 983 |
|
| 984 |
Using this value for p, a fair amount of reordering can be handled |
| 985 |
without having to send UOR-2 packets most of the time. The trade-off |
| 986 |
is that this is at the expense of robustness against packet losses. |
| 987 |
|
| 988 |
<span class="h5"><a class="selflink" id="section-6.2.2.2" href="#section-6.2.2.2">6.2.2.2</a>. Defining the Values of p for New Profiles</span> |
| 989 |
|
| 990 |
As described in <a href="./rfc3095">RFC 3095</a> [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>], the interpretation interval when |
| 991 |
sending k bits of SN is defined as follows: |
| 992 |
|
| 993 |
f(v_ref, k) = [v_ref - p, v_ref + (2^k - 1) - p] |
| 994 |
|
| 995 |
The negative bound (v_ref - p) limits the ability to handle |
| 996 |
reordering, and the positive bound (v_ref + (2^k - 1) - p) limits the |
| 997 |
ability to handle packet losses. |
| 998 |
|
| 999 |
Adjusting p will increase one of these ranges, while the other range |
| 1000 |
will decrease. This trade-off between the capability to handle |
| 1001 |
|
| 1002 |
|
| 1003 |
|
| 1004 |
<span class="grey">Pelletier, et al. Informational [Page 18]</span></pre> |
| 1005 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span> |
| 1006 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 1007 |
|
| 1008 |
|
| 1009 |
reordering and packet losses, including how these correlate with each |
| 1010 |
other, should be considered in a ROHC profile that is meant to handle |
| 1011 |
reordering. |
| 1012 |
|
| 1013 |
For example, if it is desirable for a profile to be as robust against |
| 1014 |
reordering (negative range) and against packet losses (positive |
| 1015 |
range), this range can be made equal by setting p near (2^k / 2). |
| 1016 |
|
| 1017 |
<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Security Considerations</span> |
| 1018 |
|
| 1019 |
This document does not include additional security risks to [<a href="#ref-1" title=""RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed"">1</a>]. In |
| 1020 |
addition, it may lower risks related to context damage in R-mode with |
| 1021 |
injected packets when sequentially late packets do not update the |
| 1022 |
context (<a href="#section-6.1.2.1">section 6.1.2.1</a>). |
| 1023 |
|
| 1024 |
<span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Acknowledgements</span> |
| 1025 |
|
| 1026 |
Thanks to the committed WG document reviewers, Carl Knutsson and Mark |
| 1027 |
West, for their review efforts. Thanks also to Aniruddha Kulkarni, |
| 1028 |
Ramin Rezaiifar, and Gorry Fairhurst for their constructive comments. |
| 1029 |
|
| 1030 |
<span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. Informative References</span> |
| 1031 |
|
| 1032 |
[<a id="ref-1">1</a>] Bormann, C., Burmeister, C., Degermark, M., Fukushima, H., |
| 1033 |
Hannu, H., Jonsson, L-E., Hakenberg, R., Koren, T., Le, K., Liu, |
| 1034 |
Z., Martensson, A., Miyazaki, A., Svanbro, K., Wiebke, T., |
| 1035 |
Yoshimura, T., and H. Zheng, "RObust Header Compression (ROHC): |
| 1036 |
Framework and four profiles: RTP, UDP, ESP, and uncompressed", |
| 1037 |
<a href="./rfc3095">RFC 3095</a>, July 2001. |
| 1038 |
|
| 1039 |
[<a id="ref-2">2</a>] Jonsson, L-E., "RObust Header Compression (ROHC): Terminology |
| 1040 |
and Channel Mapping Examples", <a href="./rfc3759">RFC 3759</a>, April 2004. |
| 1041 |
|
| 1042 |
[<a id="ref-3">3</a>] Jonsson, L-E. and G. Pelletier, "RObust Header Compression |
| 1043 |
(ROHC): A Compression Profile for IP", <a href="./rfc3843">RFC 3843</a>, June 2004. |
| 1044 |
|
| 1045 |
[<a id="ref-4">4</a>] Pelletier, G., "RObust Header Compression (ROHC): Profiles for |
| 1046 |
User Datagram Protocol (UDP) Lite", <a href="./rfc4019">RFC 4019</a>, April 2005. |
| 1047 |
|
| 1048 |
[<a id="ref-5">5</a>] Jonsson, L-E. and G. Pelletier, "RObust Header Compression |
| 1049 |
(ROHC): A Link-Layer Assisted Profile for IP/UDP/RTP", <a href="./rfc3242">RFC 3242</a>, |
| 1050 |
April 2002. |
| 1051 |
|
| 1052 |
[<a id="ref-6">6</a>] Liu, Z. and K. Le, "Zero-byte Support for Bidirectional Reliable |
| 1053 |
Mode (R-mode) in Extended Link-Layer Assisted RObust Header |
| 1054 |
Compression (ROHC) Profile", <a href="./rfc3408">RFC 3408</a>, December 2002. |
| 1055 |
|
| 1056 |
|
| 1057 |
|
| 1058 |
|
| 1059 |
|
| 1060 |
<span class="grey">Pelletier, et al. Informational [Page 19]</span></pre> |
| 1061 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span> |
| 1062 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 1063 |
|
| 1064 |
|
| 1065 |
[<a id="ref-7">7</a>] Ash, J., Goode, B., Hand, J., and R. Zhang, "Requirements for |
| 1066 |
Header Compression over MPLS", <a href="./rfc4247">RFC 4247</a>, November 2005. |
| 1067 |
|
| 1068 |
Authors' Addresses |
| 1069 |
|
| 1070 |
Ghyslain Pelletier |
| 1071 |
Ericsson AB |
| 1072 |
Box 920 |
| 1073 |
SE-971 28 Lulea, Sweden |
| 1074 |
|
| 1075 |
Phone: +46 8 404 29 43 |
| 1076 |
Fax: +46 920 996 21 |
| 1077 |
EMail: [email protected] |
| 1078 |
|
| 1079 |
|
| 1080 |
Lars-Erik Jonsson |
| 1081 |
Ericsson AB |
| 1082 |
Box 920 |
| 1083 |
SE-971 28 Lulea, Sweden |
| 1084 |
|
| 1085 |
Phone: +46 8 404 29 61 |
| 1086 |
Fax: +46 920 996 21 |
| 1087 |
EMail: [email protected] |
| 1088 |
|
| 1089 |
|
| 1090 |
Kristofer Sandlund |
| 1091 |
Ericsson AB |
| 1092 |
Box 920 |
| 1093 |
SE-971 28 Lulea, Sweden |
| 1094 |
|
| 1095 |
Phone: +46 8 404 41 58 |
| 1096 |
Fax: +46 920 996 21 |
| 1097 |
EMail: [email protected] |
| 1098 |
|
| 1099 |
|
| 1100 |
|
| 1101 |
|
| 1102 |
|
| 1103 |
|
| 1104 |
|
| 1105 |
|
| 1106 |
|
| 1107 |
|
| 1108 |
|
| 1109 |
|
| 1110 |
|
| 1111 |
|
| 1112 |
|
| 1113 |
|
| 1114 |
|
| 1115 |
|
| 1116 |
<span class="grey">Pelletier, et al. Informational [Page 20]</span></pre> |
| 1117 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span> |
| 1118 |
<span class="grey"><a href="./rfc4224">RFC 4224</a> ROHC over Reordering Channels January 2006</span> |
| 1119 |
|
| 1120 |
|
| 1121 |
Full Copyright Statement |
| 1122 |
|
| 1123 |
Copyright (C) The Internet Society (2006). |
| 1124 |
|
| 1125 |
This document is subject to the rights, licenses and restrictions |
| 1126 |
contained in <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a>, and except as set forth therein, the authors |
| 1127 |
retain all their rights. |
| 1128 |
|
| 1129 |
This document and the information contained herein are provided on an |
| 1130 |
"AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS |
| 1131 |
OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY AND THE INTERNET |
| 1132 |
ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED, |
| 1133 |
INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE |
| 1134 |
INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED |
| 1135 |
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. |
| 1136 |
|
| 1137 |
Intellectual Property |
| 1138 |
|
| 1139 |
The IETF takes no position regarding the validity or scope of any |
| 1140 |
Intellectual Property Rights or other rights that might be claimed to |
| 1141 |
pertain to the implementation or use of the technology described in |
| 1142 |
this document or the extent to which any license under such rights |
| 1143 |
might or might not be available; nor does it represent that it has |
| 1144 |
made any independent effort to identify any such rights. Information |
| 1145 |
on the procedures with respect to rights in RFC documents can be |
| 1146 |
found in <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and <a href="https://www.rfc-editor.org/bcp/bcp79">BCP 79</a>. |
| 1147 |
|
| 1148 |
Copies of IPR disclosures made to the IETF Secretariat and any |
| 1149 |
assurances of licenses to be made available, or the result of an |
| 1150 |
attempt made to obtain a general license or permission for the use of |
| 1151 |
such proprietary rights by implementers or users of this |
| 1152 |
specification can be obtained from the IETF on-line IPR repository at |
| 1153 |
<a href="http://www.ietf.org/ipr">http://www.ietf.org/ipr</a>. |
| 1154 |
|
| 1155 |
The IETF invites any interested party to bring to its attention any |
| 1156 |
copyrights, patents or patent applications, or other proprietary |
| 1157 |
rights that may cover technology that may be required to implement |
| 1158 |
this standard. Please address the information to the IETF at |
| 1159 |
[email protected]. |
| 1160 |
|
| 1161 |
Acknowledgement |
| 1162 |
|
| 1163 |
Funding for the RFC Editor function is provided by the IETF |
| 1164 |
Administrative Support Activity (IASA). |
| 1165 |
|
| 1166 |
|
| 1167 |
|
| 1168 |
|
| 1169 |
|
| 1170 |
|
| 1171 |
|
| 1172 |
Pelletier, et al. Informational [Page 21] |
| 1173 |
</pre> |