RFC4336 · Problem Statement for the Datagram Congestion Control Protocol (DCCP)

{
  "id": "RFC4336",
  "number": 4336,
  "title_en": "Problem Statement for the Datagram Congestion Control Protocol (DCCP)",
  "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 for the historical record the motivation behind the Datagram Congestion Control Protocol (DCCP), an unreliable transport protocol incorporating end-to-end congestion control. DCCP implements a congestion-controlled, unreliable flow of datagrams for use by applications such as streaming media or on-line games. This memo provides information for the Internet community.",
  "authors": [
    "S. Floyd",
    "M. Handley",
    "E. Kohler"
  ],
  "organizations": [],
  "publication_date": "2006-03-01",
  "current_status": "INFORMATIONAL",
  "current_status_ru": "Информационный",
  "publication_status": "INFORMATIONAL",
  "publication_status_ru": "Информационный",
  "lifecycle": "informational",
  "lifecycle_ru": "Справочный",
  "stream": "IETF",
  "stream_ru": "IETF",
  "area": "tsv",
  "area_ru": "Транспорт",
  "working_group": "dccp",
  "source_draft": "draft-ietf-dccp-problem-03",
  "page_count": 22,
  "doi": "10.17487/RFC4336",
  "keywords": [],
  "formats": [
    "TXT",
    "HTML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc4336/",
    "html": "https://www.rfc-editor.org/rfc/rfc4336.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc4336.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc4336/"
  }
}