{"draft":"draft-ietf-dccp-problem-03","doc_id":"RFC4336","title":"Problem Statement for the Datagram Congestion Control Protocol (DCCP)","authors":["S. Floyd","M. Handley","E. Kohler"],"format":["ASCII","HTML"],"page_count":"22","pub_status":"INFORMATIONAL","status":"INFORMATIONAL","source":"Datagram Congestion Control Protocol","abstract":"This document describes for the historical record the\r\nmotivation behind the Datagram Congestion Control\r\nProtocol (DCCP), an unreliable transport protocol incorporating\r\nend-to-end congestion control.  DCCP implements a\r\ncongestion-controlled, unreliable flow of datagrams for use by\r\napplications such as streaming media or on-line games.  This memo provides information for the Internet community.","pub_date":"March 2006","keywords":[],"obsoletes":[],"obsoleted_by":[],"updates":[],"updated_by":[],"see_also":[],"doi":"10.17487\/RFC4336","errata_url":null}