{
  "number": 4340,
  "title": "Datagram Congestion Control Protocol (DCCP)",
  "authors": [
    "E. Kohler",
    "M. Handley",
    "S. Floyd"
  ],
  "published": "2006-03",
  "status": "Proposed Standard",
  "stream": "IETF",
  "area": "tsv",
  "working_group": "dccp",
  "pages": 129,
  "formats": [
    "TXT",
    "HTML"
  ],
  "abstract": "The Datagram Congestion Control Protocol (DCCP) is a transport protocol that provides bidirectional unicast connections of congestion-controlled unreliable datagrams. DCCP is suitable for applications that transfer fairly large amounts of data and that can benefit from control over the tradeoff between timeliness and reliability. [STANDARDS-TRACK]",
  "keywords": [
    "transport protocol"
  ],
  "draft": "draft-ietf-dccp-spec-13",
  "doi": "10.17487/RFC4340",
  "errata_url": "https://www.rfc-editor.org/errata/rfc4340",
  "updated_by": [
    "RFC5595",
    "RFC5596",
    "RFC6335",
    "RFC6773"
  ],
  "urls": {
    "html": "https://rfc.dk/rfc4340/",
    "text": "https://rfc.dk/rfc4340.txt",
    "rfc_editor": "https://www.rfc-editor.org/rfc/rfc4340",
    "datatracker": "https://datatracker.ietf.org/doc/rfc4340/"
  },
  "text_modified": "2006-03-28T17:41:32Z"
}