Name: draft-jayasumana-reorder-density-03
Title: Reorder Density and Reorder Buffer-occupancy Density - Metrics for Packet Reordering Measurements
State: Active
Authors: Anura Jayasumana, Nischal Piratla, Abhijit Bare, Tarun Banka
Group: Individual Submissions (none)
Date: 2004-07-21
Out of order arrival of packets is a common occurrence on Internet, and it
will be more widespread as the link speeds increase. Percentage packet
reordering is vague and unclear. A good reorder metric will capture the
occurrence and characteristics of reordering comprehensively, and have
broader utility than merely distinguishing among different reordered
sequences. Two metrics for packet reordering are presented, namely, Reorder
Density (RD) and Reorder Buffer-occupancy Density (RBD). A threshold is
used to clearly define when a packet is considered lost, to upper 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. 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.
[sh-index] Back to list of manuals
|
| |
