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. 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. This memo provides information for the Internet community.
IETF · RFCОфициальная английская аннотация
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. 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. This memo provides information for the Internet community.
{
"id": "RFC5236",
"number": 5236,
"title_en": "Improved Packet Reordering Metrics",
"title_ru": "",
"summary_ru": "",
"purpose_ru": "",
"use_ru": "",
"full_translation_path": "",
"full_translation_checked_at": "",
"full_translation_source_sha256": "",
"architect_note_ru": "",
"topics_ru": [],
"translation_state": "not_prepared",
"verification_level": "not_prepared",
"verification_level_ru": "Русская выжимка не подготовлена",
"verification_note_ru": "",
"abstract_en": "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. 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. This memo provides information for the Internet community.",
"authors": [
"A. Jayasumana",
"N. Piratla",
"T. Banka",
"A. Bare",
"R. Whitner"
],
"organizations": [],
"publication_date": "2008-06-01",
"current_status": "INFORMATIONAL",
"current_status_ru": "Информационный",
"publication_status": "INFORMATIONAL",
"publication_status_ru": "Информационный",
"lifecycle": "informational",
"lifecycle_ru": "Справочный",
"stream": "INDEPENDENT",
"stream_ru": "Независимый поток",
"area": "",
"area_ru": "",
"working_group": "",
"source_draft": "draft-jayasumana-reorder-density-08",
"page_count": 26,
"doi": "10.17487/RFC5236",
"keywords": [
"reorder density",
"rd",
"reorder buffer-occupancy density",
"rbd"
],
"formats": [
"TXT",
"HTML"
],
"relations": {
"obsoletes": [],
"obsoleted_by": [],
"updates": [],
"updated_by": [],
"is_also": [],
"see_also": []
},
"links": {
"info": "https://www.rfc-editor.org/info/rfc5236/",
"html": "https://www.rfc-editor.org/rfc/rfc5236.html",
"txt": "https://www.rfc-editor.org/rfc/rfc5236.txt",
"datatracker": "https://datatracker.ietf.org/doc/rfc5236/"
}
}