|
|
|
|
|
|
|
|
|
|
| Last Update: May 26, 2010
|
|
|
|
|
|
|
|
|
|
|
| | |
RFC4336
03/2006
(22 p.)
pdf(2p)
|
S. Floyd
M. Handley
E. Kohler |
|
Problem Statement for the Datagram Congestion Control Protocol (DCCP) |
|
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.
|
|
|
| |
| List |
Status: | Informational |
|
|
|
|
|
|
|
|
| | |
RFC4340
03/2006
(129 p.)
pdf(2p)
|
E. Kohler
M. Handley
S. Floyd |
|
Datagram Congestion Control Protocol (DCCP) |
|
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.
|
|
|
| |
| List |
Status: | Proposed Standard |
|
|
|
|
|
|
|
|
| | |
RFC4341
03/2006
(20 p.)
pdf(2p)
|
S. Floyd
E. Kohler |
|
Profile for Datagram Congestion Control Protocol (DCCP)
Congestion Control ID 2: TCP-like Congestion Control |
|
This document contains the profile for Congestion Control Identifier
2 (CCID 2), TCP-like Congestion Control, in the Datagram Congestion
Control Protocol (DCCP). CCID 2 should be used by senders who would
like to take advantage of the available bandwidth in an environment
with rapidly changing conditions, and who are able to adapt to the
abrupt changes in the congestion window typical of TCP's Additive
Increase Multiplicative Decrease (AIMD) congestion control.
|
|
|
| |
| List |
Status: | Proposed Standard |
|
|
|
|
|
|
|
|
|
|
| |
| List |
Status: | Proposed Standard |
|
|
|
|
|
|
|
|
| | |
RFC4828
04/2007
(46 p.)
pdf(2p)
|
S. Floyd
E. Kohler |
|
TCP Friendly Rate Control (TFRC): The Small-Packet (SP) Variant |
This document proposes a mechanism for further experimentation, but
not for widespread deployment at this time in the global Internet.
TCP-Friendly Rate Control (TFRC) is a congestion control mechanism
for unicast flows operating in a best-effort Internet environment
(RFC 3448). TFRC was intended for applications that use a fixed
packet size, and was designed to be reasonably fair when competing
for bandwidth with TCP connections using the same packet size. This
document proposes TFRC-SP, a Small-Packet (SP) variant of TFRC, that
is designed for applications that send small packets. The design
goal for TFRC-SP is to achieve the same bandwidth in bps (bits per
second) as a TCP flow using packets of up to 1500 bytes. TFRC-SP
enforces a minimum interval of 10 ms between data packets to prevent
a single flow from sending small packets arbitrarily frequently.
Flows using TFRC-SP compete reasonably fairly with large-packet TCP
and TFRC flows in environments where large-packet flows and small-packet
flows experience similar packet drop rates. However, in
environments where small-packet flows experience lower packet drop
rates than large-packet flows (e.g., with Drop-Tail queues in units
of bytes), TFRC-SP can receive considerably more than its share of
the bandwidth.
|
|
|
|
|
|
|
|
|
|
|
| | |
RFC5238
05/2008
(10 p.)
pdf(2p)
|
T. Phelan |
|
Datagram Transport Layer Security (DTLS) over the Datagram
Congestion Control Protocol (DCCP) |
|
This document specifies the use of Datagram Transport Layer Security
(DTLS) over the Datagram Congestion Control Protocol (DCCP). DTLS
provides communications privacy for applications that use datagram
transport protocols and allows client/server applications to
communicate in a way that is designed to prevent eavesdropping and
detect tampering or message forgery. DCCP is a transport protocol
that provides a congestion-controlled unreliable datagram service.
|
|
|
| |
| List |
Status: | Proposed Standard |
|
|
|
|
|
|
|
|
| | |
RFC5348
09/2008
(58 p.)
pdf(2p)
|
S. Floyd
M. Handley
J. Padhye
J. Widmer |
|
TCP Friendly Rate Control (TFRC): Protocol Specification |
|
This document specifies TCP Friendly Rate Control (TFRC). TFRC is a
congestion control mechanism for unicast flows operating in a best-
effort Internet environment. It is reasonably fair when competing
for bandwidth with TCP flows, but has a much lower variation of
throughput over time compared with TCP, making it more suitable for
applications such as streaming media where a relatively smooth
sending rate is of importance.
|
|
|
| |
| List |
Status: | Proposed Standard |
|
|
|
|
|
|
|
|
| | |
RFC5595
09/2009
(19 p.)
pdf(2p)
|
G. Fairhurst |
|
The Datagram Congestion Control Protocol (DCCP) Service Codes |
|
This document describes the usage of Service Codes by the Datagram
Congestion Control Protocol, RFC 4340. It motivates the setting of a
Service Code by applications. Service Codes provide a method to
identify the intended service/application to process a DCCP
connection request. This provides improved flexibility in the use
and assignment of port numbers for connection multiplexing. The use
of a DCCP Service Code can also enable more explicit coordination of
services with middleboxes (e.g., network address translators and
firewalls).
|
|
|
| |
| List |
Status: | Proposed Standard |
|
|
|
|
|
|
|
|
| | |
RFC5596
09/2009
(25 p.)
pdf(2p)
|
G. Fairhurst |
|
Datagram Congestion Control Protocol (DCCP)
Simultaneous-Open Technique to Facilitate NAT/Middlebox Traversal |
|
This document specifies an update to the Datagram Congestion Control
Protocol (DCCP), a connection-oriented and datagram-based transport
protocol. The update adds support for the DCCP-Listen packet. This
assists DCCP applications to communicate through middleboxes (e.g., a
Network Address Port Translator or a DCCP server behind a firewall),
where peering endpoints need to initiate communication in a near-simultaneous
manner to establish necessary middlebox state.
|
|
|
| |
| List |
Status: | Proposed Standard |
|
|
|
|
|
|
|
|
| | |
RFC5622
08/2009
(19 p.)
pdf(2p)
|
S. Floyd
E. Kohler |
|
Profile for Datagram Congestion Control Protocol (DCCP)
Congestion ID 4: TCP-Friendly Rate Control for Small Packets (TFRC-SP) |
|
This document specifies a profile for Congestion Control Identifier
4, the small-packet variant of TCP-Friendly Rate Control (TFRC), in
the Datagram Congestion Control Protocol (DCCP). CCID 4 is for
experimental use, and uses TFRC-SP (RFC 4828), a variant of TFRC
designed for applications that send small packets. CCID 4 is
considered experimental because TFRC-SP is itself experimental, and
is not proposed for widespread deployment in the global Internet at
this time. The goal for TFRC-SP is to achieve roughly the same
bandwidth in bits per second (bps) as a TCP flow using packets of up
to 1500 bytes but experiencing the same level of congestion. CCID 4
is for use for senders that send small packets and would like a TCP-friendly
sending rate, possibly with Explicit Congestion Notification
(ECN), while minimizing abrupt rate changes.
|
|
|
|
|
|
|
|
|
|
|
| | |
RFC5634
08/2009
(22 p.)
pdf(2p)
|
G. Fairhurst
A. Sathiaseelan |
|
Quick-Start for the Datagram Congestion Control Protocol (DCCP) |
|
This document specifies the use of the Quick-Start mechanism by the
Datagram Congestion Control Protocol (DCCP). DCCP is a transport
protocol that allows the transmission of congestion-controlled,
unreliable datagrams. DCCP is intended for applications such as
streaming media, Internet telephony, and online games. In DCCP, an
application has a choice of congestion control mechanisms, each
specified by a Congestion Control Identifier (CCID). This document
specifies general procedures applicable to all DCCP CCIDs and
specific procedures for the use of Quick-Start with DCCP CCID 2, CCID
3, and CCID 4. Quick-Start enables a DCCP sender to cooperate with
Quick-Start routers along the end-to-end path to determine an allowed
sending rate at the start of a connection and, at times, in the
middle of a DCCP connection (e.g., after an idle or application-limited
period). The present specification is provided for use in
controlled environments, and not as a mechanism that would be
intended or appropriate for ubiquitous deployment in the global
Internet.
|
|
|
|
|
|
|
|
|
|
|
| | |
RFC5762
04/2010
(16 p.)
pdf(2p)
|
C. Perkins |
|
RTP and the Datagram Congestion Control Protocol (DCCP) |
|
The Real-time Transport Protocol (RTP) is a widely used transport for
real-time multimedia on IP networks. The Datagram Congestion Control
Protocol (DCCP) is a transport protocol that provides desirable
services for real-time applications. This memo specifies a mapping
of RTP onto DCCP, along with associated signalling, such that real-time
applications can make use of the services provided by DCCP.
|
|
|
| |
| List |
Status: | Proposed Standard |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
