In computer networking, the Datagram Congestion Control Protocol is a message-oriented transport layerprotocol. DCCP implements reliable connection setup, teardown, Explicit Congestion Notification, congestion control, and feature negotiation. The IETF published DCCP as, a proposed standard, in March 2006. provides an introduction. DCCP provides a way to gain access to congestion-control mechanisms without having to implement them at the application layer. It allows for flow-based semantics like in Transmission Control Protocol, but does not provide reliable in-order delivery. Sequenced delivery within multiple streams as in the Stream Control Transmission Protocol is not available in DCCP. A DCCP connection contains acknowledgmenttraffic as well as data traffic. Acknowledgments inform a sender whether its packets have arrived, and whether they were marked by Explicit Congestion Notification. Acknowledgements are transmitted as reliably as the congestion control mechanism in use requires, possibly completely reliably. DCCP is useful for applications with timing constraints on the delivery of data. Such applications include streaming media, multiplayer online games and Internet telephony. In such applications, old messages quickly become useless, so that getting new messages is preferred to resending lost messages. such applications have often either settled for TCP or used User Datagram Protocol and implemented their own congestion-control mechanisms, or have no congestion control at all. While being useful for these applications, DCCP can also serve as a general congestion-control mechanism for UDP-based applications, by adding, as needed, mechanisms for reliable or in-order delivery on top of UDP/DCCP. In this context, DCCP allows the use of different, but generally TCP-friendly congestion-control mechanisms. DCCP has the option for very long sequence numbers corresponding to a packet ID, rather than a byte ID as in TCP. The long length of the sequence numbers aims to guard against "some blind attacks, such as the injection of DCCP-Resets into the connection".
implementation is optimized for portability, but has had no changes since June 2008.
purpose of this implementation is to provide a standardized, portable NAT-friendly framework for peer-to-peer communications with flexible congestion control, depending on application.
Packet Structure
The DCCP generic header takes different forms depending on the value of X, the Extended Sequence Numbers bit. If X is one, the Sequence Number field is 48 bits long, and the generic header takes 16 bytes, as follows. If X is zero, only the low 24 bits of the Sequence Number are transmitted, and the generic header is 12 bytes long. ;Source port :Identifies the sending port ;Destination port :Identifies the receiving port ;Data Offset: : The offset from the start of the packet's DCCP header to the start of its application data area, in 32-bit words. ;CCVal :Used by the HC-Sender CCID ;Checksum Coverage : Checksum Coverage determines the parts of the packet that are covered by the Checksum field. ;Checksum : The Internet checksum of the packet's DCCP header, a network-layer pseudoheader, and, depending on Checksum Coverage, all, some, or none of the application data ;Reserved : Senders MUST set this field to all zeroes on generated packets, and receivers MUST ignore its value ;Type : The Type field specifies the type of the packet ;Extended Sequence Numbers : Set to one to indicate the use of an extended generic header with 48-bit Sequence and Acknowledgement Numbers ;Sequence Number : Identifies the packet uniquely in the sequence of all packets the source sent on this connection
Protocol Specifications
RFC 4340 — Datagram Congestion Control Protocol
RFC 5595 — The Datagram Congestion Control Protocol Service Codes
RFC 5596 — DCCP Simultaneous-Open Technique to Facilitate NAT/Middlebox Traversal
