<pre>Network Working Group                                      A. Jayasumana
Request for Comments: 5236                     Colorado State University
Category: Informational                                       N. Piratla
                                                   Deutsche Telekom Labs
                                                                T. Banka
                                               Colorado State University
                                                                 A. Bare
                                                              R. Whitner
                                              Agilent Technologies, Inc.
                                                               June 2008


                   <span class="h1">Improved Packet Reordering Metrics</span>

Status of This Memo

   This memo provides information for the Internet community.  It does
   not specify an Internet standard of any kind.  Distribution of this
   memo is unlimited.

IESG Note

   The content of this RFC was at one time considered by the IETF, and
   therefore it may resemble a current IETF work in progress or a
   published IETF work.  The IETF standard for reordering metrics is <a href="./rfc4737">RFC</a>
   <a href="./rfc4737">4737</a>.  The metrics in this document were not adopted for inclusion in
   <a href="./rfc4737">RFC 4737</a>.  This RFC is not a candidate for any level of Internet
   Standard.  The IETF disclaims any knowledge of the fitness of this
   RFC for any purpose and in particular notes that the decision to
   publish is not based on IETF review for such things as security,
   congestion control, or inappropriate interaction with deployed
   protocols.  The RFC Editor has chosen to publish this document at its
   discretion.  Readers of this RFC should exercise caution in
   evaluating its value for implementation and deployment.  See <a href="./rfc3932">RFC 3932</a>
   for more information.

Abstract

   This document presents two improved metrics for packet reordering,
   namely, Reorder Density (RD) and Reorder Buffer-occupancy Density
   (RBD).  A threshold is used to clearly define when a packet is
   considered lost, to bound computational complexity at O(N), and to
   keep the memory requirement for evaluation independent of N, where N
   is the length of the packet sequence.  RD is a comprehensive metric
   that captures the characteristics of reordering, while RBD evaluates
   the sequences from the point of view of recovery from reordering.





<span class="grey">Jayasumana, et al.           Informational                      [Page 1]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   These metrics are simple to compute yet comprehensive in their
   characterization of packet reordering.  The measures are robust and
   orthogonal to packet loss and duplication.

Table of Contents

   <a href="#section-1">1</a>. Introduction and Motivation .....................................<a href="#page-3">3</a>
   <a href="#section-2">2</a>. Attributes of Packet Reordering Metrics .........................<a href="#page-4">4</a>
   <a href="#section-3">3</a>. Reorder Density and Reorder Buffer-Occupancy Density ............<a href="#page-7">7</a>
      <a href="#section-3.1">3.1</a>. Receive Index (RI) .........................................<a href="#page-8">8</a>
      <a href="#section-3.2">3.2</a>. Out-of-Order Packet ........................................<a href="#page-9">9</a>
      <a href="#section-3.3">3.3</a>. Displacement (D) ...........................................<a href="#page-9">9</a>
      <a href="#section-3.4">3.4</a>. Displacement Threshold (DT) ................................<a href="#page-9">9</a>
      <a href="#section-3.5">3.5</a>. Displacement Frequency (FD) ...............................<a href="#page-10">10</a>
      <a href="#section-3.6">3.6</a>. Reorder Density (RD) ......................................<a href="#page-10">10</a>
      <a href="#section-3.7">3.7</a>. Expected Packet (E) .......................................<a href="#page-10">10</a>
      <a href="#section-3.8">3.8</a>. Buffer Occupancy (B) ......................................<a href="#page-10">10</a>
      <a href="#section-3.9">3.9</a>. Buffer-Occupancy Threshold (BT) ...........................<a href="#page-11">11</a>
      <a href="#section-3.10">3.10</a>. Buffer-Occupancy Frequency (FB) ..........................<a href="#page-11">11</a>
      <a href="#section-3.11">3.11</a>. Reorder Buffer-Occupancy Density (RBD) ...................<a href="#page-11">11</a>
   <a href="#section-4">4</a>. Representation of Packet Reordering and Reorder Density ........<a href="#page-11">11</a>
   <a href="#section-5">5</a>. Selection of DT ................................................<a href="#page-12">12</a>
   <a href="#section-6">6</a>. Detection of Lost and Duplicate Packets ........................<a href="#page-13">13</a>
   <a href="#section-7">7</a>. Algorithms to Evaluate RD and RBD ..............................<a href="#page-14">14</a>
      <a href="#section-7.1">7.1</a>. Algorithm for RD ..........................................<a href="#page-14">14</a>
      <a href="#section-7.2">7.2</a>. Algorithm for RBD .........................................<a href="#page-16">16</a>
   <a href="#section-8">8</a>. Examples .......................................................<a href="#page-17">17</a>
   <a href="#section-9">9</a>. Characteristics Derivable from RD and RBD ......................<a href="#page-21">21</a>
   <a href="#section-10">10</a>. Comparison with Other Metrics .................................<a href="#page-22">22</a>
   <a href="#section-11">11</a>. Security Considerations .......................................<a href="#page-22">22</a>
   <a href="#section-12">12</a>. References ....................................................<a href="#page-22">22</a>
      <a href="#section-12.1">12.1</a>. Normative References .....................................<a href="#page-22">22</a>
      <a href="#section-12.2">12.2</a>. Informative References ...................................<a href="#page-22">22</a>
   <a href="#section-13">13</a>. Contributors ..................................................<a href="#page-24">24</a>

















<span class="grey">Jayasumana, et al.           Informational                      [Page 2]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>.  Introduction and Motivation</span>

   Packet reordering is a phenomenon that occurs in Internet Protocol
   (IP) networks.  Major causes of packet reordering include, but are
   not limited to, packet striping at layers 2 and 3 [<a href="#ref-Ben99" title="&quot;Packet Reordering is Not Pathological Network Behavior,&quot;">Ben99</a>] [<a href="#ref-Jai03" title="&quot;Measurement and Classification of Out-of- sequence Packets in Tier-1 IP Backbone,&quot;">Jai03</a>],
   priority scheduling (e.g., Diffserv), and route fluttering [<a href="#ref-Pax97" title="&quot;Measurements and Analysis of End-to-End Internet Dynamics,&quot;">Pax97</a>]
   [<a href="#ref-Boh03" title="&quot;TCP-PR: TCP for Persistent Packet Reordering,&quot;">Boh03</a>].  Reordering leads to degradation of the performance of many
   applications [<a href="#ref-Ben99" title="&quot;Packet Reordering is Not Pathological Network Behavior,&quot;">Ben99</a>] [<a href="#ref-Bla02" title="&quot;On Making TCP More Robust to Packet Reordering,&quot;">Bla02</a>] [<a href="#ref-Lao02" title="&quot;The Effect of Packet Reordering in a Backbone Link on Application Throughput,&quot;">Lao02</a>].  Increased link speeds [<a href="#ref-Bar04" title="&quot;Measurement and Analysis of Packet Reordering Using Reorder Density,&quot;">Bar04</a>],
   increased parallelism within routers and switches, Quality-of-Service
   (QoS) support, and load balancing among links all point to increased
   packet reordering in future networks.

   Effective metrics for reordering are required to measure and quantify
   reordering.  A good metric or a set of metrics capturing the nature
   of reordering can be expected to provide insight into the reordering
   phenomenon in networks.  It may be possible to use such metrics to
   predict the effects of reordering on applications that are sensitive
   to packet reordering, and perhaps even to compensate for reordering.
   A metric for reordered packets may also help evaluate network
   protocols and implementations with respect to their impact on packet
   reordering.

   The percentage of out-of-order packets is often used as a metric for
   characterizing reordering.  However, this metric is vague and lacking
   in detail.  Further, there is no uniform definition for the degree of
   reordering of an arrived packet [<a href="#ref-Ban02" title="&quot;Metrics for Degree of Reordering in Packet Sequences&quot;">Ban02</a>] [<a href="#ref-Pi05a" title="&quot;A Theoretical Foundation, Metrics and Modeling of Packet Reordering and Methodology of Delay Modeling using Inter-packet Gaps,&quot;">Pi05a</a>].  For example,
   consider the two packet sequences (1, 3, 4, 2, 5) and (1, 4, 3, 2,
   5).  It is possible to interpret the reordering of packets in these
   sequences differently.  For example,

   (i)   Packets 2, 3, and 4 are out of order in both cases.

   (ii)  Only packet 2 is out of order in the first sequence, while
         packets 2 and 3 are out of order in the second.

   (iii) Packets 3 and 4 are out of order in both the sequences.

   (iv)  Packets 2, 3, and 4 are out of order in the first sequence,
         while packets 4 and 2 are out of order in the second sequence.

   In essence, the percentage of out-of-order packets as a metric of
   reordering is subject to interpretation and cannot capture the
   reordering unambiguously and hence, accurately.

   Other metrics attempt to overcome this ambiguity by defining only the
   late packets or only the early packets as being reordered.  However,
   measuring reordering based only on late or only on early packets is
   not always effective.  Consider, for example, the sequence (1, 20, 2,



<span class="grey">Jayasumana, et al.           Informational                      [Page 3]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   3, ..., 19, 21, 22, ...); the only anomaly is that packet 20 is
   delivered immediately after packet 1.  A metric based only on
   lateness will indicate a high degree of reordering, even though in
   this example it is a single packet arriving ahead of others.
   Similarly, a metric based only on earliness does not accurately
   capture reordering caused by a late arriving packet.  A complete
   reorder metric must account for both earliness and lateness, and it
   must be able to differentiate between the two.  The inability to
   capture both the earliness and the lateness precludes a metric from
   being useful for estimating end-to-end reordering based on reordering
   in constituent subnets.

   The sensitivity to packet reordering can vary significantly from one
   application to the other.  Consider again the packet sequence (1, 3,
   4, 2, 5).  If buffers are available to store packets 3 and 4 while
   waiting for packet 2, an application can recover from reordering.
   However, with certain real-time applications, the out-of-order
   arrival of packet 2 may render it useless.  While one can argue that
   a good packet reordering measurement scheme should capture
   application-specific effects, a counter argument can also be made
   that packet reordering should be measured strictly with respect to
   the order of delivery, independent of the application.

   Many different packet reordering metrics have been suggested.  For
   example, the standards-track document <a href="./rfc4737">RFC 4737</a> [<a href="./rfc4737" title="&quot;Packet Reordering Metrics&quot;">RFC4737</a>] defines 11
   metrics for packet reordering, including lateness-based percentage
   metrics, reordering extent metrics, and N-reordering.

   <a href="#section-2">Section 2</a> of this document discusses the desirable attributes of any
   packet reordering metric.  <a href="#section-3">Section 3</a> introduces two additional packet
   reorder metrics: Reorder Density (RD) and Reorder Buffer-occupancy
   Density (RBD), which we claim are superior to the others [<a href="#ref-Pi07" title="&quot;Metrics for Packet Reordering - A Comparative Analysis,&quot;">Pi07</a>].  In
   particular, RD possesses all the desirable attributes, while other
   metrics fall significantly short in several of these attributes.  RBD
   is unique in measuring reordering in terms of the system resources
   needed for recovery from packet reordering.  Both RD and RBD have a
   computation complexity O(N), where N is the length of the packet
   sequence, and they can therefore be used for real-time online
   monitoring.

<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>.  Attributes of Packet Reordering Metrics</span>

   The first and foremost requirement of a packet reordering metric is
   its ability to capture the amount and extent of reordering in a
   sequence of packets.  The fact that a measure varies with reordering
   of packets in a stream does not make it a good metric.  In [<a href="#ref-Ben99" title="&quot;Packet Reordering is Not Pathological Network Behavior,&quot;">Ben99</a>],
   the authors have identified desirable features of a reordering
   metric.  This list encloses the foremost requirements stated above:



<span class="grey">Jayasumana, et al.           Informational                      [Page 4]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   simplicity, low sensitivity to packet loss, ability to combine
   reorder measures from two networks, minimal value for in-order data,
   and independence of data size.  These features are explained below in
   detail, along with additional desired features.  Note, the ability to
   combine reorder measures from two networks is added to broaden
   applicability, and data size independence is discussed under
   evaluation complexity.  However, data size independence could also
   refer to the final measure, as in percentage reordering or even a
   normalized representation.

   a) Simplicity

      An ideal metric is one that is simple to understand and evaluate,
      and yet informative, i.e., able to provide a complete picture of
      reordering.  Percentage of packets reordered is the simplest
      singleton metric; but the ambiguity in its definition, as
      discussed earlier, and its failure to carry the extent of
      reordering make it less informative.  On the other hand, keeping
      track of the displacements of each and every packet without
      compressing the data will contain all the information about
      reordering, but it is not simple to evaluate or use.

      A simpler metric may be preferred in some cases even though it
      does not capture reordering completely, while other cases may
      demand a more complex, yet complete metric.

      In striving to strike a balance, the lateness-based metrics
      consider only the late packets as reordered, and earliness-based
      metrics only the early packets as reordered.  However, a metric
      based only on earliness or only on lateness captures only a part
      of the information associated with reordering.  In contrast, a
      metric capturing both early and late arrivals provides a complete
      picture of reordering in a sequence.

   b) Low Sensitivity to Packet Loss and Duplication

      A reorder metric should treat only an out-of-order packet as
      reordered, i.e., if a packet is lost during transit, then this
      should not result in its following packets, which arrive in order,
      being classified as out of order.  Consider the sequence (1, 3, 4,
      5, 6).  If packet 2 has been lost, the sequence should not be
      considered to contain any out-of-order packets.  Similarly, if
      multiple copies of a packet (duplicates) are delivered, this must








<span class="grey">Jayasumana, et al.           Informational                      [Page 5]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


      not result in a packet being classified as out of order, as long
      as one copy arrives in the proper position.  For example, sequence
      (1, 2, 3, 2, 4, 5) has no reordering.  The lost and duplicate
      packet counts may be tracked using metrics specifically intended
      to measure those, e.g., percentage of lost packets, and percentage
      of duplicate packets.

   c) Low Evaluation Complexity

      Memory and time complexities associated with evaluating a metric
      play a vital role in implementation and real-time measurements.
      Spatial/memory complexity corresponds to the amount of buffers
      required for the overall measurement process, whereas
      time/computation complexity refers to the number of computation
      steps involved in computing the amount of reordering in a
      sequence.  On-the-fly evaluation of the metric for large streams
      of packets requires the computational complexity to be O(N), where
      N denotes the number of received packets, used for the reordering
      measure.  This allows the metric to be updated in constant-time as
      each packet arrives.  In the absence of a threshold defining
      losses or the number of sequence numbers to buffer for detection
      of duplicates, the worst-case complexity of loss and duplication
      detection will increase with N.  The rate of increase will depend,
      among other things, on the value of N and the implementation of
      the duplicate detection scheme.

   d) Robustness

      Reorder measurements should be robust against different network
      phenomena and peculiarities in measurement or sequences such as a
      very late arrival of a duplicate packet, or even a rogue packet
      due to an error or sequence number wraparound.  The impact due to
      an event associated with a single or a small number of packets
      should have a sense of proportionality on the reorder measure.
      Consider, for example, the arrival sequence: (1, 5430, 2, 3, 4, 5,
      ...) where packet 5430 appears to be very early; it may be due to
      either sequence rollover in test streams or some unknown reason.

   e) Broad Applicability

      A framework for IP performance metrics [<a href="./rfc2330" title="&quot;Framework for IP Performance Metrics&quot;">RFC2330</a>] states: "The
      metrics must aid users and providers in understanding the
      performance they experience or provide".

      Rather than being a mere value or a set of values that changes
      with the reordering of packets in a stream, a reorder metric
      should be useful for a variety of purposes.  An application or a
      transport protocol implementation, for example, may be able to use



<span class="grey">Jayasumana, et al.           Informational                      [Page 6]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


      the reordering information to allocate resources to recover from
      reordering.  A metric may be useful for TCP flow control, buffer
      resource allocation for recovery from reordering and/or network
      diagnosis.

      The ability to combine the reorder metrics of constituent subnets
      to measure the end-to-end reordering would be an extremely useful
      property.  In the absence of this property, no amount of
      individual network measurements, short of measuring the reordering
      for the pair of endpoints of interest, would be useful in
      predicting the end-to-end reordering.

      The ability to provide different types of information based on
      monitoring or diagnostic needs also broadens the applicability of
      a metric.  Examples of applicable information for reordering may
      include parameters such as the percentage of reordered packets
      that resulted in fast retransmissions in TCP, or the percentage of
      utilization of the reorder recovery buffer.

<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>.  Reorder Density and Reorder Buffer-Occupancy Density</span>

   In this memo, we define two discrete density functions, Reorder
   Density (RD) and Reorder Buffer-occupancy Density (RBD), that capture
   the nature of reordering in a packet stream.  These two metrics can
   be used individually or collectively to characterize the reordering
   in a packet stream.  Also presented are algorithms for real-time
   evaluation of these metrics for an incoming packet stream.

   RD is defined as the distribution of displacements of packets from
   their original positions, normalized with respect to the number of
   packets.  An early packet corresponds to a negative displacement and
   a late packet to a positive displacement.  A threshold on
   displacement is used to keep the computation within bounds.  The
   choice of threshold value depends on the measurement uses and
   constraints, such as whether duplicate packets are accounted for when
   evaluating these displacements (discussed in <a href="#section-5">Section 5</a>).

   The ability of RD to capture the nature and properties of reordering
   in a comprehensive manner has been demonstrated in [<a href="#ref-Pi05a" title="&quot;A Theoretical Foundation, Metrics and Modeling of Packet Reordering and Methodology of Delay Modeling using Inter-packet Gaps,&quot;">Pi05a</a>], [<a href="#ref-Pi05b" title="&quot;RD: A Formal, Comprehensive Metric for Packet Reordering,&quot;">Pi05b</a>],
   [<a href="#ref-Pi05c" title="&quot;On Reorder Density and its Application to Characterization of Packet Reordering,&quot;">Pi05c</a>], and [<a href="#ref-Pi07" title="&quot;Metrics for Packet Reordering - A Comparative Analysis,&quot;">Pi07</a>].  The RD observed at the output port of a subnet
   when the input is an in-order packet stream can be viewed as a
   "reorder response" of a network, a concept somewhat similar to the
   "system response" or "impulse response" used in traditional system
   theory.  For a subnet under stationary conditions, RD is the
   probability density of the packet displacement.  RD measured on
   individual subnets can be combined, using the convolution operation,
   to predict the end-to-end reorder characteristics of the network
   formed by the cascade of subnets under a fairly broad set of



<span class="grey">Jayasumana, et al.           Informational                      [Page 7]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   conditions [<a href="#ref-Pi05b" title="&quot;RD: A Formal, Comprehensive Metric for Packet Reordering,&quot;">Pi05b</a>].  RD also shows significant promise as a tool for
   analytical modeling of reordering, as demonstrated with a load-
   balancing scenario in [<a href="#ref-Pi06" title="&quot;Reordering of Packets due to Multipath Forwarding - An Analysis,&quot;">Pi06</a>].  Use of a threshold to define the
   condition under which a packet is considered lost makes the metric
   robust, efficient, and adaptable for different network and stream
   characteristics.

   RBD is the normalized histogram of the occupancy of a hypothetical
   buffer that would allow the recovery from out-of-order delivery of
   packets.  If an arriving packet is early, it is added to a
   hypothetical buffer until it can be released in order [<a href="#ref-Ban02" title="&quot;Metrics for Degree of Reordering in Packet Sequences&quot;">Ban02</a>].  The
   occupancy of this buffer, after each arrival, is used as the measure
   of reordering.  A threshold, used to declare a packet as lost, keeps
   the complexity of computation within bounds.  The threshold may be
   selected based on application requirements in situations where the
   late arrival of a packet makes it useless, e.g., a real-time
   application.  In [<a href="#ref-Ban02" title="&quot;Metrics for Degree of Reordering in Packet Sequences&quot;">Ban02</a>], this metric was called RD and buffer
   occupancy was known as displacement.

   RD and RBD are simple, yet useful, metrics for measurement and
   evaluation of reordering.  These metrics are robust against many
   peculiarities, such as those discussed previously, and have a
   computational complexity of O(N), where N is the received sequence
   size.  RD is orthogonal to loss and duplication, whereas RBD is
   orthogonal to duplication.

   A detailed comparison of these and other proposed metrics for
   reordering is presented in [<a href="#ref-Pi07" title="&quot;Metrics for Packet Reordering - A Comparative Analysis,&quot;">Pi07</a>].

   The following terms are used to formally define RD, RBD, and the
   measurement algorithms.  The wraparound of sequence numbers is not
   addressed in this document explicitly, but with the use of modulo-N
   arithmetic, all claims made here remain valid in the presence of
   wraparound.

<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>.  Receive Index (RI)</span>

   Consider a sequence of packets (1, 2, ..., N) transmitted over a
   network.  A receive index RI (1, 2, ...), is a value assigned to a
   packet as it arrives at its destination, according to the order of
   arrival.  A receive index is not assigned to duplicate packets, and
   the receive index value skips the value corresponding to a lost
   packet.  (The detection of loss and duplication for this purpose is
   described in <a href="#section-6">Section 6</a>.)  In the absence of reordering, the sequence
   number of the packet and the receive index are the same for each
   packet.





<span class="grey">Jayasumana, et al.           Informational                      [Page 8]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   RI is used to compute earliness and lateness of an arriving packet.
   Below are two examples of received sequences with receive index
   values for a sequence of 5 packets (1, 2, 3, 4, 5) arriving out of
   order:

   Example 1:
   Arrived sequence:    2   1   4   5    3
   receive index:       1   2   3   4    5

   Example 2:
   Arrived sequence:    1   4   3   5    3
   receive index:       1   3   4   5    -

   In Example 1, there is no loss or duplication.  In Example 2, the
   packet with sequence number 2 is lost.  Thus, 2 is not assigned as an
   RI.  Packet 3 is duplicated; thus, the second copy is not assigned an
   RI.

<span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a>.  Out-of-Order Packet</span>

   When the sequence number of a packet is not equal to the RI assigned
   to it, it is considered to be an out-of-order packet.  Duplicates for
   which an RI is not defined are ignored.

<span class="h3"><a class="selflink" id="section-3.3" href="#section-3.3">3.3</a>.  Displacement (D)</span>

   Displacement (D) of a packet is defined as the difference between RI
   and the sequence number of the packet, i.e., the displacement of
   packet i is RI[i] - i.  Thus, a negative displacement indicates the
   earliness of a packet and a positive displacement the lateness.  In
   example 3 below, an arrived sequence with displacements of each
   packet is illustrated.

   Example 3:
   Arrived sequence:    1   4   3   5   3   8   7   6
   receive index:       1   3   4   5   -   6   7   8
   Displacement:        0  -1   1   0   -  -2   0   2

<span class="h3"><a class="selflink" id="section-3.4" href="#section-3.4">3.4</a>.  Displacement Threshold (DT)</span>

   The displacement threshold is a threshold on the displacement of
   packets that allows the metric to classify a packet as lost or
   duplicate.  Determining when to classify a packet as lost is
   difficult because there is no point in time at which a packet can
   definitely be classified as lost; the packet may still arrive after
   some arbitrarily long delay.  However, from a practical point of
   view, a packet may be classified as lost if it has not arrived within
   a certain administratively defined displacement threshold, DT.



<span class="grey">Jayasumana, et al.           Informational                      [Page 9]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   Similarly, to identify a duplicate packet, it is theoretically
   necessary to keep track of all the arrived (or missing) packets.
   Again, however, from a practical point of view, missing packets
   within a certain window of sequence numbers suffice.  Thus, DT is
   used as a practical means for declaring a packet as lost or
   duplicated.  DT makes the metric more robust, keeps the computational
   complexity for long sequences within O(N), and keeps storage
   requirements independent of N.

   If the DT selected is too small, reordered packets might be
   classified as lost.  A large DT will increase both the size of memory
   required to keep track of sequence numbers and the length of
   computation time required to evaluate the metric.  Indeed, it is
   possible to use two different thresholds for the two cases.  The
   selection of DT is further discussed in <a href="#section-5">Section 5</a>.

<span class="h3"><a class="selflink" id="section-3.5" href="#section-3.5">3.5</a>.  Displacement Frequency (FD)</span>

   Displacement Frequency FD[k] is the number of arrived packets having
   a displacement of k, where k takes values from -DT to DT.

<span class="h3"><a class="selflink" id="section-3.6" href="#section-3.6">3.6</a>.  Reorder Density (RD)</span>

   RD is defined as the distribution of the Displacement Frequencies
   FD[k], normalized with respect to N', where N' is the length of the
   received sequence, ignoring lost and duplicate packets.  N' is equal
   to the sum(FD[k]) for k in [-DT, DT].

<span class="h3"><a class="selflink" id="section-3.7" href="#section-3.7">3.7</a>.  Expected Packet (E)</span>

   A packet with sequence number E is expected if E is the largest
   number such that all the packets with sequence numbers less than E
   have already arrived or have been determined to be lost.

<span class="h3"><a class="selflink" id="section-3.8" href="#section-3.8">3.8</a>.  Buffer Occupancy (B)</span>

   An arrived packet with a sequence number greater than that of an
   expected packet is considered to be stored in a hypothetical buffer
   sufficiently long to permit recovery from reordering.  At any packet
   arrival instant, the buffer occupancy is equal to the number of
   out-of-order packets in the buffer, including the newly arrived
   packet.  One buffer location is assumed for each packet, although it
   is possible to extend the concept to the case where the number of
   bytes is used for buffer occupancy.  For example, consider the







<span class="grey">Jayasumana, et al.           Informational                     [Page 10]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   sequence of packets (1, 2, 4, 5, 3) with expected order (1, 2, 3, 4,
   5).  When packet 4 arrives, the buffer occupancy is 1 because packet
   4 arrived early.  Similarly, the buffer occupancy becomes 2 when
   packet 5 arrives.  When packet 3 arrives, recovery from reordering
   occurs and the buffer occupancy reduces to zero.

<span class="h3"><a class="selflink" id="section-3.9" href="#section-3.9">3.9</a>.  Buffer-Occupancy Threshold (BT)</span>

   Buffer-occupancy threshold is a threshold on the maximum size of the
   hypothetical buffer that is used for recovery from reordering.  As
   with the case of DT for RD, BT is used for loss and duplication
   classification for Reorder Buffer-occupancy Density (RBD) computation
   (see <a href="#section-3.11">Section 3.11</a>).  BT provides robustness and limits the
   computational complexity of RBD.

<span class="h3"><a class="selflink" id="section-3.10" href="#section-3.10">3.10</a>.  Buffer-Occupancy Frequency (FB)</span>

   At the arrival of each packet, the buffer occupancy may take any
   value, k, ranging from 0 to BT.  The buffer occupancy frequency FB[k]
   is the number of arrival instances after which the occupancy takes
   the value of k.

<span class="h3"><a class="selflink" id="section-3.11" href="#section-3.11">3.11</a>.  Reorder Buffer-Occupancy Density (RBD)</span>

   Reorder buffer-occupancy density is the buffer occupancy frequencies
   normalized by the total number of non-duplicate packets, i.e.,
   RBD[k] = FB[k]/N' where N' is the length of the received sequence,
   ignoring excessively delayed (deemed lost) and duplicate packets.  N'
   is also the sum(FB[k]) for all k such that k belongs to [0, BT].

<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>.  Representation of Packet Reordering and Reorder Density</span>

   Consider a sequence of packets (1, 2, ..., N).  Let the RI assigned
   to packet m be "the sequence number m plus an offset dm", i.e.,

            RI = m + dm; D  = dm

   A reorder event of packet m is represented by r(m, dm).  When dm is
   not equal to zero, a reorder event is said to have occurred.  A
   packet is late if dm &gt; 0 and early if dm &lt; 0.  Thus, packet
   reordering of a sequence of packets is completely represented by the
   union of reorder events, R, referred to as the reorder set:

            R = {r(m,dm)| dm not equal to 0 for all m}

   If there is no reordering in a packet sequence, then R is the null
   set.




<span class="grey">Jayasumana, et al.           Informational                     [Page 11]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   Examples 4 and 5 illustrate the reorder set:

   Example 4. No losses or duplicates

   Arrived Sequence     1       2       3       5       4       6
   receive index (RI)   1       2       3       4       5       6
   Displacement (D)     0       0       0      -1       1       0
   R = {(4,1), (5,-1)}

   Example 5. Packet 4 is lost and 2 is duplicated

   Arrived Sequence     1       2       5       3       6       2
   receive index (RI)   1       2       3       5       6       -
   Displacement (D)     0       0       -2      2       0       -
   R = {(3, 2), (5, -2)}

   RD is defined as the discrete density of the frequency of packets
   with respect to their displacements, i.e., the lateness and earliness
   from the original position.  Let S[k] denote the set of reorder
   events in R with displacement equal to k.  That is:

            S[k]= {r(m, dm)| dm = k}

   Let |S[k]| be the cardinality of set S[k].  Thus, RD[k] is defined as
   |S[k]| normalized with respect to the total number of received
   packets (N').  Note that N' does not include duplicate or lost
   packets.

            RD[k]  = |S[k]| / N' for k not equal to zero

   RD[0] corresponds to the packets for which RI is the same as the
   sequence number:

            RD[0] = 1 - sum(|S[k]| / N')

   As defined previously, FD[k] is the measure that keeps track of
   |S[k]|.

<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>.  Selection of DT</span>

   Although assigning a threshold for determining lost and duplicate
   packets might appear to introduce error into the reorder metrics, in
   practice this need not be the case.  Applications, protocols, and the
   network itself operate within finite resource constraints that
   introduce practical limits beyond which the choice of certain values
   becomes irrelevant.  If the operational nature of an application is
   such that a DT can be defined, then using DT in the computation of
   reorder metrics will not invalidate nor limit the effectiveness of



<span class="grey">Jayasumana, et al.           Informational                     [Page 12]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   the metrics, i.e., increasing DT does not provide any benefit.  In
   the case of TCP, the maximum transmit and receive window sizes impose
   a natural limit on the useful value of DT.  Sequence number
   wraparound may provide a useful upper bound for DT in some instances.

   If there are no operational constraints imposed by factors as
   described above, or if one is purely interested in a more complete
   picture of reordering, then DT can be made as large as required.  If
   DT is equal to the length of the packet sequence (worst case
   scenario), a complete picture of reordering is seen.  Any metric that
   does not rely on a threshold to declare a packet as lost implicitly
   makes one of two assumptions: a) A missing packet is not considered
   lost until the end of the sequence, or b) the packet is considered
   lost until it arrives.  The former corresponds to the case where DT
   is set to the length of the sequence.  The latter leads to many
   problems related to complexity and robustness.

<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>.  Detection of Lost and Duplicate Packets</span>

   In RD, a packet is considered lost if it is late beyond DT.
   Non-duplicate arriving packets do not have a copy in the buffer and
   do not have a sequence number less (earlier) than E.  In RBD, a
   packet is considered lost if the buffer is filled to its threshold
   BT.  A packet is considered a duplicate when the sequence number is
   less than the expected packet, or if the sequence number is already
   in the buffer.

   Since RI skips the sequence number of a lost packet, the question
   arises as to how to assign an RI to subsequent packets that arrive
   before it is known that the packet is lost.  This problem arises only
   when reorder metrics are calculated in real-time for an incoming
   sequence, and not with offline computations.  This concern can be
   handled in one of two ways:

   a) Go-back Method:  RD is computed as packets arrive.  When a packet
   is deemed lost, RI values are corrected and displacements are
   recomputed.  The Go-back Method is only invoked when a packet is lost
   and recomputing RD involves at most DT packets.

   b) Stay-back Method:  RD evaluation lags the arriving packets so that
   the correct RI and E values can be assigned to each packet as it
   arrives.  Here, RI is assigned to a packet only once, and the value
   assigned is guaranteed to be correct.  In the worst case, the
   computation lags the arriving packet by DT.  The lag associated with
   the Stay-back Method is incurred only when a packet is missing.






<span class="grey">Jayasumana, et al.           Informational                     [Page 13]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   Another issue related to a metric and its implementation is the
   robustness against peculiarities that may occur in a sequence as
   discussed in <a href="#section-2">Section 2</a>.  Consider, for example, the arrival sequence
   (1, 5430, 2, 3, 4, 5, ...).  With RD, a sense of proportionality is
   easily maintained using the concept of threshold (DT), which limits
   the effects a rogue packet can have on the measurement results.  In
   this example, when the displacement is greater than DT, rogue packet
   5430 is discarded.  In this way the impact due to the rogue packet is
   limited, at most, to DT packets, thus imposing a limit on the amount
   of error it can cause in the results.  Note also that a threshold
   different from DT can be used for the same purpose.  For example, a
   pre-specified threshold that limits the time a packet remains in the
   buffer can make RBD robust against rogue packets.

<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>.  Algorithms to Evaluate RD and RBD</span>

   The algorithms to compute RD and RBD are given below.  These
   algorithms are applicable for online computation of an incoming
   packet stream and provide an up-to-date metric for the packet stream
   read so far.  For simplicity, the sequence numbers are considered to
   start from 1 and continue in increments of 1.  Only the Stay-back
   Method of loss detection is presented here; hence, the RD values lag
   by a maximum of DT.  The algorithm for the Go-back Method is given in
   [<a href="#ref-Bar04" title="&quot;Measurement and Analysis of Packet Reordering Using Reorder Density,&quot;">Bar04</a>].  Perl scripts for these algorithms are posted in [<a href="#ref-Per04" title=" http://www.cnrl.colostate.edu/packet_reorder.html">Per04</a>].

<span class="h3"><a class="selflink" id="section-7.1" href="#section-7.1">7.1</a>.  Algorithm for RD</span>

   Variables used:
   -------------------------------------------------------------------
    RI: receive index.
    S: Arrival under consideration for lateness/earliness computation.
    D: Lateness or earliness of the packet being processed: dm for m.
    FD[-DT..DT]: Frequency of lateness and earliness.
    window[1..DT+1]: List of incoming sequence numbers; FIFO buffer.
    buffer[1..DT]: Array to hold sequence numbers of early arrivals.
    window[] and buffer[] are empty at the beginning.
   ===================================================================

   Step 1. Initialize:

      Store first unique DT+1 sequence numbers in arriving order into
      window; RI = 1;

   Step 2. Repeat (until window is empty):

      If (window or buffer contains sequence number RI)
      {
         Move sequence number out of window to S # window is FIFO



<span class="grey">Jayasumana, et al.           Informational                     [Page 14]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


         D = RI - S; # compute displacement

         If (absolute(D) &lt;= DT) # Apply threshold
         {
            FD[D]++; # Update frequency

            If (buffer contains sequence number RI)
               Delete RI from buffer;

            If (D &lt; 0) # Early Arrival
               add S to empty slot in buffer;
            RI++; # Update RI value
         }

         Else # Displacement beyond threshold.
         {
            Discard S;
            # Note, an early arrival in window is moved to buffer if
            # its displacement is less or equal to DT.  Therefore, the
            # contents in buffer will have only possible RIs.  Thus,
            # clearing an RI as it is consumed prevents memory leaks
            # in buffer
         }
         # Get next incoming non-duplicate sequence number, if any.
         newS = get_next_arrival(); # subroutine called*
         if (newS != null)
         {
              add newS to window;
         }
         if (window is empty) go to step 3;
      }
      Else # RI not found.  Get next RI value.
      {
         # Next RI is the minimum among window and buffer contents.
         m = minimum (minimum (window), minimum (buffer));
         If (RI &lt; m)
            RI = m;
         Else
            RI++;
      }

   Step 3. Normalize FD to get RD;

   # Get a new sequence number from packet stream, if any
   subroutine get_next_arrival()
   {
        do   # get non-duplicate next arrival
        {



<span class="grey">Jayasumana, et al.           Informational                     [Page 15]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


              newS = new sequence from arriving stream;
              if (newS == null) # End of packet stream
                 return null;
        } while (newS &lt; RI or newS in buffer or newS in window);

        return newS;
   }

<span class="h3"><a class="selflink" id="section-7.2" href="#section-7.2">7.2</a>.  Algorithm for RBD</span>

   Variables used:
   ---------------------------------------------------------------------
   # E : Next expected sequence number.
   # S : Sequence number of the packet just arrived.
   # B : Current buffer occupancy.
   # BT: Buffer Occupancy threshold.
   # FB[i]: Frequency of buffer occupancy i  (0 &lt;= i &lt;= BT).
   # in_buffer(N) : True if the packet with sequence number N is
     already stored in the buffer.
   =====================================================================

   1.  Initialize E = 1, B = 0 and FB[i] = 0 for all values of i.

   2.  Do the following for each arrived packet.

          If (in_buffer(S) || S &lt; E) /*Do nothing*/;
          /* Case a: S is a duplicate or excessively delayed packet.
          Discard the packet.*/
          Else
          {

             If (S == E)
             /* Case b: Expected packet has arrived.*/
             {
                E = E + 1;
                While (in_buffer(E))
                {
                   B = B - 1; /* Free buffer occupied by E.*/
                   E = E + 1; /* Expect next packet.*/
                }
                FB[B] = FB[B] + 1; /*Update frequency for buffer
                occupancy B.*/
             } /* End of If (S == E)*/

             ElseIf (S &gt; E)
             /* Case c: Arrived packet has a sequence number higher
                than expected.*/
             {



<span class="grey">Jayasumana, et al.           Informational                     [Page 16]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


                If (B &lt; BT)
                /* Store the arrived packet in a buffer.*/
                   B = B + 1;
                Else
                /* Expected packet is delayed beyond the BT.
                Treat it as lost.*/
                {
                   Repeat
                   {
                      E = E + 1;
                   }
                   Until (in_buffer(E) || E == S);

                   While (in_buffer(E) || E == S)
                   {
                      if (E != S) B = B - 1;
                      E = E + 1;
                   }
                 }
                 FB[B] = FB[B] + 1; /*Update frequency for buffer
                 occupancy B.*/
             } /* End of ElseIf (S &gt; E)*/

          }

   3. Normalize FB[i] to obtain RBD[i], for all values of i using

                            FB[i]
      RBD[i] = ----------------------------------
                  Sum(FB[j] for 0 &lt;= j &lt;= BT)

<span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>.  Examples</span>

   a. Scenario with no packet loss

   Consider the sequence of packets (1, 4, 2, 5, 3, 6, 7, 8) with DT =
   BT = 4.

   Tables 1 and 2 show the computational steps when the RD algorithm is
   applied to the above sequence.











<span class="grey">Jayasumana, et al.           Informational                     [Page 17]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   ------------------------------------------------------
   Table 1: Late/Early-packet Frequency computation steps
   ------------------------------------------------------
   S         1     4     2     5     3     6   7    8
   RI        1     2     3     4     5     6   7    8
   D         0    -2     1    -1     2     0   0    0
   FD[D]     1     1     1     1     1     2   3    4
   ------------------------------------------------------
   (S, RI,D and FD[D] as described in <a href="#section-7.1">Section 7.1</a>)
   ------------------------------------------------------

   The last row (FD[D]) represents the current frequency of occurrence
   of the displacement D, e.g., column 3 indicates FD[1] = 1 while
   column 4 indicates FD[-1] = 1.  The final set of values for RD are
   shown in Table 2.

   -------------------------------------------------
   Table 2: Reorder Density (RD)
   -------------------------------------------------
     D       -2       -1      0     1       2
   FD[D]      1        1      4     1       1
   RD[D]     0.125   0.125   0.5   0.125   0.125
   -------------------------------------------------
   (D,FD[D] and RD[D] as described in <a href="#section-7.1">Section 7.1</a>)
   -------------------------------------------------

   Tables 3 and 4 illustrate the computational steps for RBD for the
   same example.

   ------------------------------------------------------------
   Table 3: Buffer occupancy frequencies (FB) computation steps
   ------------------------------------------------------------
   S         1     4     2     5     3     6     7     8
   E         1     2     2     3     3     6     7     8
   B         0     1     1     2     0     0     0     0
   FB[B]     1     1     2     1     2     3     4     5
   ------------------------------------------------------------
   (E,S,B and FB[B] as described in <a href="#section-7.2">Section 7.2</a>)
   ------------------------------------------------------------












<span class="grey">Jayasumana, et al.           Informational                     [Page 18]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   ------------------------------------------------------------
   Table 4: Reorder Buffer-occupancy Density
   ------------------------------------------------------------
   B           0        1     2
   FB[B]       5        2     1
   RBD[B]     0.625   0.25  0.125
   ------------------------------------------------------------
   (B,FB[B] and RBD[B] as discussed in <a href="#section-7.2">Section 7.2</a>)
   ------------------------------------------------------------

   Graphical representations of the densities are as follows:


                ^                            ^
                |                            |
                |                            _
    ^       0.5 _                   ^ 0.625 | |
    |          | |                  |       | |
               | |                          | |
   RD[D]       | |                RBD[B]    | | - o.25
          _  _ | | _  _ 0.125               | || | - 0.125
         | || || || || |                    | || || |
        --+--+--+--+--+--+--&gt;             ---+--+--+--
         -2 -1  0  1  2                      0  1  2
                D  --&gt;                        B --&gt;

   b. Scenario with packet loss

   Consider a sequence of 6 packets (1, 2, 4, 5, 6, 7) with DT = BT = 3.
   Table 5 shows the computational steps when the RD algorithm is
   applied to the above sequence to obtain FD[D].

   ------------------------------------------------------
   Table 5: Late/Early-packet Frequency computation steps
   ------------------------------------------------------
   S         1     2     4     5     6     7
   RI        1     2     4     5     6     7
   D         0     0     0     0     0     0
   FD[D]     1     2     3     4     5     6
   ------------------------------------------------------
   (S,RI,D and FD[D] as described in <a href="#section-7.1">Section 7.1</a>)
   ------------------------------------------------------









<span class="grey">Jayasumana, et al.           Informational                     [Page 19]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   Table 6 illustrates the FB[B] for the above arrival sequence.

   -------------------------------------------------
   Table 6: Buffer occupancy computation steps
   -------------------------------------------------
   S        1     2     4     5     6     7
   E        1     2     3     3     3     7
   B        0     0     1     2     3     0
   FB[B]    1     2     1     1     1     3
   -------------------------------------------------
   (E,S,B and FB[B] as described in <a href="#section-7.2">Section 7.2</a>)
   -------------------------------------------------

   Graphical representations of RD and RBD for the above sequence are as
   follows.

                ^                        ^
                |                        |
          1.0   _                        |
      ^        | |                ^      |
      |        | |                | 0.5  _
               | |                      | |
    RD[D]      | |               RBD[B] | | _  _  _ 0.167
               | |                      | || || || |
           --+--+--+--&gt;                --+--+--+--+--&gt;
            -1  0  1                     0  1  2  3
                D  --&gt;                      B --&gt;

   c. Scenario with duplicate packets

   Consider a sequence of 6 packets (1, 3, 2, 3, 4, 5) with DT = 2.
   Table 7 shows the computational steps when the RD algorithm is
   applied to the above sequence to obtain FD[D].

   ------------------------------------------------------
   Table 7: Late/Early-packet Frequency computation steps
   ------------------------------------------------------
   S         1     3     2     3     4     5
   RI        1     2     3     -     4     5
   D         0    -1     1     -     0     0
   FD[D]     1     1     1     -     2     3
   ------------------------------------------------------
   (S, RI,D and FD[D] as described in <a href="#section-7.1">Section 7.1</a>)
   ------------------------------------------------------







<span class="grey">Jayasumana, et al.           Informational                     [Page 20]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   Table 8 illustrates the FB[B] for the above arrival sequence.

   ------------------------------------------------------
   Table 8: Buffer Occupancy Frequency computation steps
   ------------------------------------------------------
   S     1     3     2     3     4     5
   E     1     2     2     -     4     5
   B     0     1     0     -     0     0
   FB[B] 1     1     2     -     3     4
   ------------------------------------------------------
   (E,S,B and FB[B] as described in <a href="#section-7.2">Section 7.2</a>)
   ------------------------------------------------------

   Graphical representations of RD and RBD for the above sequence are as
   follows:


                 ^                            ^
                 |                            |
     ^           |                   ^   0.8  _
     |       0.6 _                   |       | |
                | |                          | |
    RD[D]       | |                RBD[B]    | |
          0.2 _ | | _ 0.2                    | | _ 0.2
             | || || |                       | || |
         --+--+--+--+--+--+--&gt;             ---+--+--+--
          -2 -1  0  1  2                      0  1  2
                 D  --&gt;                        B --&gt;

<span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>.  Characteristics Derivable from RD and RBD</span>

   Additional information may be extracted from RD and RBD depending on
   the specific applications.  For example, in the case of resource
   allocation at a node to recover from reordering, the mean and
   variance of buffer occupancy can be derived from RBD.  For example:

   Mean occupancy of recovery buffer =  sum(i*RBD[i] for 0 &lt;= i &lt;= BT)

   The basic definition of RBD may be modified to count the buffer
   occupancy in bytes as opposed to packets when the actual buffer space
   is more important.  Another alternative is to use time to update the
   buffer occupancy compared to updating it at every arrival instant.

   The parameters that can be extracted from RD include the percentage
   of late (or early) packets, mean displacement of packets, and mean
   displacement of late (or early) packets [<a href="#ref-Ye06" title="&quot;On Monitoring of End-to-End Packet Reordering over the Internet,&quot;">Ye06</a>].  For example, the
   fraction of packets that arrive after three or more of their
   successors according to the order of transmission is given by Sum



<span class="grey">Jayasumana, et al.           Informational                     [Page 21]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   [RD[i] for 3&lt;=i&lt;=DT].  RD also allows for extraction of parameters
   such as entropy of the reordered sequence, a measure of disorder in
   the sequence [<a href="#ref-Ye06" title="&quot;On Monitoring of End-to-End Packet Reordering over the Internet,&quot;">Ye06</a>].  Due to the probability mass function nature of
   RD, it is also a convenient measure for theoretical modeling and
   analysis of reordering, e.g., see [<a href="#ref-Pi06" title="&quot;Reordering of Packets due to Multipath Forwarding - An Analysis,&quot;">Pi06</a>].

<span class="h2"><a class="selflink" id="section-10" href="#section-10">10</a>.  Comparison with Other Metrics</span>

   RD and RBD are compared to other metrics of [<a href="./rfc4737" title="&quot;Packet Reordering Metrics&quot;">RFC4737</a>] in [<a href="#ref-Pi07" title="&quot;Metrics for Packet Reordering - A Comparative Analysis,&quot;">Pi07</a>].

<span class="h2"><a class="selflink" id="section-11" href="#section-11">11</a>.  Security Considerations</span>

   The security considerations listed in [<a href="./rfc4737" title="&quot;Packet Reordering Metrics&quot;">RFC4737</a>], [<a href="./rfc3763" title="&quot;One-way Active Measurement Protocol (OWAMP) Requirements&quot;">RFC3763</a>], and
   [<a href="./rfc4656" title="&quot;A One-way Active Measurement Protocol (OWAMP)&quot;">RFC4656</a>] are extensive and directly applicable to the usage of these
   metrics; thus, they should be consulted for additional details.

<span class="h2"><a class="selflink" id="section-12" href="#section-12">12</a>.  References</span>

<span class="h3"><a class="selflink" id="section-12.1" href="#section-12.1">12.1</a>.  Normative References</span>


   [<a id="ref-RFC2330">RFC2330</a>]  Paxson, V., Almes, G., Mahdavi, J., and M. Mathis,
              "Framework for IP Performance Metrics", <a href="./rfc2330">RFC 2330</a>, May
              1998.

   [<a id="ref-Pi07">Pi07</a>]     N. M. Piratla and A. P. Jayasumana, "Metrics for Packet
              Reordering - A Comparative Analysis," International
              Journal of Communication Systems (IJCS), Vol. 21/1, 2008,
              pp: 99-113.

<span class="h3"><a class="selflink" id="section-12.2" href="#section-12.2">12.2</a>.  Informative References</span>


   [<a id="ref-Ben99">Ben99</a>]    J. C. R. Bennett, C. Partridge and N. Shectman, "Packet
              Reordering is Not Pathological Network Behavior," IEEE/ACM
              Trans. on Networking , Dec. 1999, pp.789-798.

   [<a id="ref-Jai03">Jai03</a>]    S. Jaiswal, G. Iannaccone, C. Diot, J. Kurose and D.
              Towsley, "Measurement and Classification of Out-of-
              sequence Packets in Tier-1 IP Backbone," Proc. IEEE
              INFOCOM, Mar.  2003, pp. 1199-1209.

   [<a id="ref-Pax97">Pax97</a>]    V.Paxson, "Measurements and Analysis of End-to-End
              Internet Dynamics," Ph.D. Dissertation, U.C. Berkeley,
              1997, <a href="ftp://ftp.ee.lbl.gov/papers/vp-thesis/dis.ps.gz">ftp://ftp.ee.lbl.gov/papers/vp-thesis/dis.ps.gz</a>.






<span class="grey">Jayasumana, et al.           Informational                     [Page 22]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-23" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   [<a id="ref-Boh03">Boh03</a>]    S. Bohacek, J. Hespanha, J. Lee, C. Lim and K.Obraczka,
              "TCP-PR: TCP for Persistent Packet Reordering," Proc. of
              the IEEE 23rdICDCS, May 2003, pp.222-231.

   [<a id="ref-Bla02">Bla02</a>]    E. Blanton and M. Allman, "On Making TCP More Robust to
              Packet Reordering," ACM Computer Comm. Review, 32(1), Jan.
              2002, pp.20-30.

   [<a id="ref-Lao02">Lao02</a>]    M. Laor and L. Gendel, "The Effect of Packet Reordering in
              a Backbone Link on Application Throughput," IEEE Network,
              Sep./Oct. 2002, pp.28-36.

   [<a id="ref-Bar04">Bar04</a>]    A. A. Bare, "Measurement and Analysis of Packet Reordering
              Using Reorder Density," Masters Thesis, Department of
              Computer Science, Colorado State University, Fort Collins,
              Colorado, Fall 2004.

   [<a id="ref-Ban02">Ban02</a>]    T. Banka, A. A. Bare, A. P. Jayasumana, "Metrics for
              Degree of Reordering in Packet Sequences", Proc. 27th IEEE
              Conference on Local Computer Networks, Tampa, FL, Nov.
              2002, pp. 332-342.

   [<a id="ref-Pi05a">Pi05a</a>]    N. M. Piratla, "A Theoretical Foundation, Metrics and
              Modeling of Packet Reordering and Methodology of Delay
              Modeling using Inter-packet Gaps," Ph.D. Dissertation,
              Department of Electrical and Computer Engineering,
              Colorado State University, Fort Collins, CO, Fall 2005.

   [<a id="ref-Pi05b">Pi05b</a>]    N. M. Piratla, A. P. Jayasumana and A. A. Bare, "RD: A
              Formal, Comprehensive Metric for Packet Reordering," Proc.
              5th International IFIP-TC6 Networking Conference
              (Networking 2005), Waterloo, Canada, May 2-6, 2005, LNCS
              3462, pp: 78-89.

   [<a id="ref-Pi06">Pi06</a>]     N. M. Piratla and A. P. Jayasumana, "Reordering of Packets
              due to Multipath Forwarding - An Analysis," Proc. IEE
              Intl.  Conf. Communications ICC 2006, Istanbul, Turkey,
              Jun. 2006, pp:829-834.

   [<a id="ref-Per04">Per04</a>]    Perl Scripts for RLED and RBD,
              <a href="http://www.cnrl.colostate.edu/packet_reorder.html">http://www.cnrl.colostate.edu/packet_reorder.html</a>, Last
              modified on Jul. 18, 2004.

   [<a id="ref-Ye06">Ye06</a>]     B. Ye, A. P. Jayasumana and N. Piratla, "On Monitoring of
              End-to-End Packet Reordering over the Internet," Proc.
              Int.  Conf. on Networking and Services (ICNS'06), Santa
              Clara, CA, July 2006.




<span class="grey">Jayasumana, et al.           Informational                     [Page 23]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-24" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


   [<a id="ref-RFC4737">RFC4737</a>]  Morton, A., Ciavattone, L., Ramachandran, G., Shalunov,
              S., and J. Perser, "Packet Reordering Metrics", <a href="./rfc4737">RFC 4737</a>,
              November 2006.

   [<a id="ref-RFC3763">RFC3763</a>]  Shalunov, S. and B. Teitelbaum, "One-way Active
              Measurement Protocol (OWAMP) Requirements", <a href="./rfc3763">RFC 3763</a>,
              April 2004.

   [<a id="ref-RFC4656">RFC4656</a>]  Shalunov, S., Teitelbaum, B., Karp, A., Boote, J., and M.
              Zekauskas, "A One-way Active Measurement Protocol
              (OWAMP)", <a href="./rfc4656">RFC 4656</a>, September 2006.

   [<a id="ref-Pi05c">Pi05c</a>]    N. M. Piratla, A. P. Jayasumana and T. Banka, "On Reorder
              Density and its Application to Characterization of Packet
              Reordering," Proc. 30th IEEE Local Computer Networks
              Conference (LCN 2005), Sydney, Australia, Nov. 2005,
              pp:156-165.

<span class="h2"><a class="selflink" id="section-13" href="#section-13">13</a>.  Contributors</span>

   Jerry McCollom
   Hewlett Packard, 3404 East Harmony Road
   Fort Collins, CO 80528, USA

   EMail: jerry_mccollom@hp.com


























<span class="grey">Jayasumana, et al.           Informational                     [Page 24]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-25" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


Authors' Addresses

   Anura P. Jayasumana
   Computer Networking Research Laboratory
   Department of Electrical and Computer Engineering
   1373 Colorado State University,
   Fort Collins, CO 80523, USA

   EMail: Anura.Jayasumana@colostate.edu


   Nischal M. Piratla
   Deutsche Telekom Laboratories
   Ernst-Reuter-Platz 7
   D-10587 Berlin, Germany

   EMail: Nischal.Piratla@telekom.de


   Tarun Banka
   Computer Networking Research Laboratory
   Department of Electrical and Computer Engineering
   1373 Colorado State University
   Fort Collins, CO 80523, USA

   EMail: Tarun.Banka@colostate.edu


   Abhijit A. Bare
   Agilent Technologies, Inc.
   900 South Taft Ave.
   Loveland, CO 80537, USA

   EMail: abhijit_bare@agilent.com


   Rick Whitner
   Agilent Technologies, Inc.
   900 South Taft Ave.
   Loveland, CO 80537, USA

   EMail: rick_whitner@agilent.com









<span class="grey">Jayasumana, et al.           Informational                     [Page 25]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-26" ></span>
<span class="grey"><a href="./rfc5236">RFC 5236</a>           Improved Packet Reordering Metrics          June 2008</span>


Full Copyright Statement

   Copyright (C) The IETF Trust (2008).

   This document is subject to the rights, licenses and restrictions
   contained in <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and at <a href="http://www.rfc-editor.org/copyright.html">http://www.rfc-editor.org/copyright.html</a>,
   and except as set forth therein, the authors retain all their rights.

   This document and the information contained herein are provided on an
   "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS
   OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND
   THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS
   OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF
   THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
   WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.

Intellectual Property

   The IETF takes no position regarding the validity or scope of any
   Intellectual Property Rights or other rights that might be claimed to
   pertain to the implementation or use of the technology described in
   this document or the extent to which any license under such rights
   might or might not be available; nor does it represent that it has
   made any independent effort to identify any such rights.  Information
   on the procedures with respect to rights in RFC documents can be
   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>.

   Copies of IPR disclosures made to the IETF Secretariat and any
   assurances of licenses to be made available, or the result of an
   attempt made to obtain a general license or permission for the use of
   such proprietary rights by implementers or users of this
   specification can be obtained from the IETF on-line IPR repository at
   <a href="http://www.ietf.org/ipr">http://www.ietf.org/ipr</a>.

   The IETF invites any interested party to bring to its attention any
   copyrights, patents or patent applications, or other proprietary
   rights that may cover technology that may be required to implement
   this standard.  Please address the information to the IETF at
   ietf-ipr@ietf.org.












Jayasumana, et al.           Informational                     [Page 26]
</pre>