{"draft":"draft-ietf-dccp-spec-11","doc_id":"RFC4340","title":"Datagram Congestion Control Protocol (DCCP)","authors":["E. Kohler","M. Handley","S. Floyd"],"format":["ASCII","HTML"],"page_count":"129","pub_status":"PROPOSED STANDARD","status":"PROPOSED STANDARD","source":"Datagram Congestion Control Protocol","abstract":"The Datagram Congestion Control Protocol (DCCP) is a transport\r\nprotocol that provides bidirectional unicast connections of\r\ncongestion-controlled unreliable datagrams.  DCCP is suitable for\r\napplications that transfer fairly large amounts of data and that can\r\nbenefit from control over the tradeoff between timeliness and\r\nreliability.  [STANDARDS-TRACK]","pub_date":"March 2006","keywords":["transport protocol"],"obsoletes":[],"obsoleted_by":[],"updates":[],"updated_by":["RFC5595","RFC5596","RFC6335","RFC6773"],"see_also":[],"doi":"10.17487\/RFC4340","errata_url":"https:\/\/www.rfc-editor.org\/errata\/rfc4340"}