POZNAN SUPERCOMPUTING AND NETWORKING CENTER
Home Rude/Crude GEANT Experiments

Out of order arrival of packets can significantly degrade the performance of many TCP-based, VoIP-based and video-based applications. There is a need for a matric that can meaningfully and accurately characterize reordering.

On these pages we present simple application, which allows to compute the packet reordering metrics from RUDE/CRUDE output files and presents results as statistics and charts.

Application was developed according to definitions included in two IETF internet drafts:
- draft-ietf-ippm-reordering-05.txt
- draft-jayasumana-reorder-density-02.txt

For RUDE/CRUDE description and simple HOW-TO see Rude/Crude section.

The program calculates reordering for first 500 packets of each RUDE/CRUDE packet trace only.

If you want to try it, here is the simple rude/crude output file: RUDE/CRUDE output


* The Occupancy Treshold parameter is used only in algorithm presented in draft-jayasumana-reorder-density-02.txt.
Poznan Supercomputing & Networking Center
Bartosz Belter <bart@man.poznan.pl>
Wojbor Bogacki <wojbor@man.poznan.pl>
Michal Przybylski <michalp@man.poznan.pl>