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

IETF · RFC · RFC3517

RFC3517 · A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP

A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP

This document presents a conservative loss recovery algorithm for TCP that is based on the use of the selective acknowledgment (SACK) TCP option. The algorithm presented in this document conforms to the spirit of the current congestion control specification (RFC 2581), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. [STANDARDS-TRACK]

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

This document presents a conservative loss recovery algorithm for TCP that is based on the use of the selective acknowledgment (SACK) TCP option. The algorithm presented in this document conforms to the spirit of the current congestion control specification (RFC 2581), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. [STANDARDS-TRACK]

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

obsoleted_by: RFC6675

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

Полные импортированные сведения карточки
{
  "id": "RFC3517",
  "number": 3517,
  "title_en": "A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm 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 presents a conservative loss recovery algorithm for TCP that is based on the use of the selective acknowledgment (SACK) TCP option. The algorithm presented in this document conforms to the spirit of the current congestion control specification (RFC 2581), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. [STANDARDS-TRACK]",
  "authors": [
    "E. Blanton",
    "M. Allman",
    "K. Fall",
    "L. Wang"
  ],
  "organizations": [],
  "publication_date": "2003-04-01",
  "current_status": "PROPOSED STANDARD",
  "current_status_ru": "Предлагаемый стандарт",
  "publication_status": "PROPOSED STANDARD",
  "publication_status_ru": "Предлагаемый стандарт",
  "lifecycle": "superseded",
  "lifecycle_ru": "Заменён",
  "stream": "IETF",
  "stream_ru": "IETF",
  "area": "wit",
  "area_ru": "Веб и транспорт Интернета",
  "working_group": "tsvwg",
  "source_draft": "draft-allman-tcp-sack-13",
  "page_count": 13,
  "doi": "10.17487/RFC3517",
  "keywords": [
    "TCP",
    "transmission control protocol",
    "retransmission",
    "congestion control"
  ],
  "formats": [
    "TXT",
    "HTML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [
      "RFC6675"
    ],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc3517/",
    "html": "https://www.rfc-editor.org/rfc/rfc3517.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc3517.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc3517/"
  }
}