⌕ Поиск по атласу

IETF · RFC · RFC6937

RFC6937 · Proportional Rate Reduction for TCP

Proportional Rate Reduction for TCP

This document describes an experimental Proportional Rate Reduction (PRR) algorithm as an alternative to the widely deployed Fast Recovery and Rate-Halving algorithms. These algorithms determine the amount of data sent by TCP during loss recovery. PRR minimizes excess window adjustments, and the actual window size at the end of recovery will be as close as possible to the ssthresh, as determined by the congestion control algorithm.

Официальная английская аннотация

This document describes an experimental Proportional Rate Reduction (PRR) algorithm as an alternative to the widely deployed Fast Recovery and Rate-Halving algorithms. These algorithms determine the amount of data sent by TCP during loss recovery. PRR minimizes excess window adjustments, and the actual window size at the end of recovery will be as close as possible to the ssthresh, as determined by the congestion control algorithm.

Связи документа

obsoleted_by: RFC9937

Официальный источник · 2013-05-01

Полные импортированные сведения карточки
{
  "id": "RFC6937",
  "number": 6937,
  "title_en": "Proportional Rate Reduction for TCP",
  "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 describes an experimental Proportional Rate Reduction (PRR) algorithm as an alternative to the widely deployed Fast Recovery and Rate-Halving algorithms. These algorithms determine the amount of data sent by TCP during loss recovery. PRR minimizes excess window adjustments, and the actual window size at the end of recovery will be as close as possible to the ssthresh, as determined by the congestion control algorithm.",
  "authors": [
    "M. Mathis",
    "N. Dukkipati",
    "Y. Cheng"
  ],
  "organizations": [],
  "publication_date": "2013-05-01",
  "current_status": "EXPERIMENTAL",
  "current_status_ru": "Экспериментальный",
  "publication_status": "EXPERIMENTAL",
  "publication_status_ru": "Экспериментальный",
  "lifecycle": "superseded",
  "lifecycle_ru": "Заменён",
  "stream": "IETF",
  "stream_ru": "IETF",
  "area": "wit",
  "area_ru": "Веб и транспорт Интернета",
  "working_group": "tcpm",
  "source_draft": "draft-ietf-tcpm-proportional-rate-reduction-04",
  "page_count": 16,
  "doi": "10.17487/RFC6937",
  "keywords": [
    "TCP loss recovery",
    "packet conservation",
    "self clock"
  ],
  "formats": [
    "TXT",
    "HTML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [
      "RFC9937"
    ],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc6937/",
    "html": "https://www.rfc-editor.org/rfc/rfc6937.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc6937.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc6937/"
  }
}