
	Where results make sense

Topic: Datagram Congestion Control Protocol

Related Topics

User datagram protocol

Stream Control Transmission Protocol

Transport layer

Address Resolution Protocol

Simple Network Management Protocol

Network layer

Session Initiation Protocol

Data link layer

Internet Protocol

Network Time Protocol

Simple Mail Transfer Protocol

Token ring

Request for Comments

Node (networking)

IPX

In the News (Tue 17 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	TCP IP Transmission Control Protocol Internet Protocol
		RFC 2581, TCP Congestion Control, one of the most important TCP related RFCs in recent years, describes updated algorithms to be used in order to avoid undue congestion.
		Venturi Transport Protocol (VTP) is a patented proprietary protocol that is designed to replace TCP transparently in order to overcome perceived inefficiencies related to wireless data transport.
		The TCP congestion avoidance algorithm works very well for ad-hoc environments where it is not known who will be sending data, but if the environment is predictable a timing based protocol such as ATM can avoid the overhead of the retransmits that TCP needs.
	www.solveforce.com /tcp_ip_transmission_control_protocol_internet_protocol.html (4196 words)

	RFC 4342 - Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP-Friendly Rate Control ...
		DCCP uses Congestion Control Identifiers, or CCIDs, to specify the congestion control mechanism in use on a half-connection.
		Congestion Control on Data Packets CCID 3 uses the congestion control mechanisms of TFRC [RFC3448].
		Congestion Control on Acknowledgements The rate and timing for generating acknowledgements is determined by the TFRC algorithm ([RFC3448], Section 6).
	rfc.sunsite.dk /rfc/rfc4342.html (10149 words)

	LWN: Linux gets DCCP
		TCP hides congestion control from user space entirely; it is handled by the protocol, with the system administrator having some say over which algorithms are used.
		A congestion window is used which can vary rapidly depending on net conditions; this algorithm will be quick to take advantage of available bandwidth, and equally quick to slow things down when congestion is detected.
		A control connection for an online game, instead, may be best served by getting packets through as quickly as possible; applications using this sort of connection may opt for the traditional TCP congestion control mechanism.
	lwn.net /Articles/149756 (1809 words)

	RFC 4341 - Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 2: TCP-like Congestion Control
		Congestion Control on Data Packets CCID 2's congestion control mechanisms are based on those for SACK- based TCP [RFC3517], since the Ack Vector provides all the information that might be transmitted in SACK options.
		CCID 2's reverse-path congestion control does not try to be TCP friendly; it just tries to avoid congestion collapse, and to be somewhat better than TCP is in the presence of a high packet loss or mark rate on the reverse path.
		Because the congestion control mechanism for acknowledgement traffic is roughly TCP friendly, and therefore the non-data sending rate and the data sending rate both grow as 1/sqrt(x) for x the packet drop rate, we have fD/D = sqrt(p)/sqrt(p(1 + 1/f)), so f^2 = 1/(1 + 1/f).
	www.packetizer.com /rfc/rfc4341 (5993 words)

	RFC 4336 - Problem Statement for the Datagram Congestion Control Protocol (DCCP). S. Floyd, M. Handley, E. Kohler.
		RFC 4336 Problem Statement for DCCP March 2006 usually able to adjust their transmission rate based on congestion feedback, they do have constraints on how this adaptation can be performed so that it has minimal impact on the quality of the session.
		One advantage of providing end-to-end congestion control in an unreliable transport protocol is that it could be used easily by a wide range of the applications that currently use UDP, with minimal changes to the application itself.
		RFC 4336 Problem Statement for DCCP March 2006 Although there is a legitimate need for a transport protocol for such short-lived reliable flows of such request/response applications, we believe that the overlap with the requirements of DCCP is almost non-existent and that DCCP should not be designed to meet the needs of these request/response applications.
	rfc.sunsite.dk /rfc/rfc4336.html (6457 words)

	Datagram Congestion Control Protocol (dccp) Charter
		of an unreliable packet flow and (2) congestion control of that packet
		RTP and the Datagram Congestion Control Protocol (DCCP) (39080 bytes)
		Datagram Congestion Control Protocol (DCCP) (RFC 4340) (318830 bytes)
	www.ietf.org /html.charters/dccp-charter.html (684 words)

	DomainsAreFree - Definition of User Datagram Protocol
		The User Datagram Protocol (UDP) is a minimal message-oriented transport layer protocol that is currently documented in IETF RFC 768.
		Lacking any congestion avoidance and control mechanisms, network-based mechanisms are required to minimize potential congestion collapse effects of uncontrolled, high rate UDP traffic loads.
		The Datagram Congestion Control Protocol (DCCP) is being designed as a partial solution to this potential problem by adding end host congestion control behavior to high-rate UDP streams such as streaming media.
	www.domainsarefree.com /glossary/User_Datagram_Protocol.html (505 words)

	[No title]
		Congestion Control for Unreliable Transfer We aim to bring easy-to-use congestion control mechanisms to applications that generate large or long-lived flows of unreliable datagrams, such as RealAudio, Internet telephony, and multiplayer games.
		Informational [Page 5] RFC 4336 Problem Statement for DCCP March 2006 usually able to adjust their transmission rate based on congestion feedback, they do have constraints on how this adaptation can be performed so that it has minimal impact on the quality of the session.
		We note that any new transport protocol could also use a Congestion Manager approach to share congestion state between flows using the same congestion control algorithm, if this were deemed to be desirable.
	www.rfc-editor.org /rfc/rfc4336.txt (6447 words)

	[No title]
		DCCP A is the "feature location" for all features F/A, and the "feature remote" for all features F/B. Round-Trip Times DCCP round-trip time measurements are performed by congestion control mechanisms; different mechanisms may measure round-trip time in different ways, or not measure it at all.
		Congestion Control Mechanisms DCCP connections are congestion controlled, but unlike in TCP, DCCP applications have a choice of congestion control mechanism.
		DCCP is a congestion control protocol, not a flow control protocol.
	www.rfc-editor.org /rfc/rfc4340.txt (8287 words)

	Datagram Congestion Control Protocol (dccp) Charter
		DCCP is in a TCP mode, it has a lot of features, it is a connection protocol, not really a 'datagram' protocol.
		DCCP is not a next generation congestion control.
		A lot is to do with congestion control, and this takes up a big part of the TCP specs too.
	www3.ietf.org /proceedings/03jul/225.htm (2445 words)

	RFC 4336 (Site not responding. Last check: )
		We do not claim that a transport protocol such as DCCP would always be implemented in the kernel, and do not attempt to evaluate the relative difficulty of modifying code inside the kernel vs. outside the kernel in any case.
		It would avoid the application writer needing to implement the control part of the congestion control mechanism, but it is unclear how easily multiple congestion control algorithms (such as receiver- based TFRC) can be supported, given that the form of congestion feedback usually needs to be closely coupled to the congestion control algorithm being used.
		Providing Congestion Control at the Transport Layer The concerns from the discussions above have convinced us that the best way to provide congestion control to applications that currently use UDP is to provide congestion control at the transport layer, in a transport protocol used as an alternative to UDP.
	www.faqs.org /rfcs/rfc4336.html (6287 words)

	[No title] (Site not responding. Last check: )
		DCCP should be able to make use of CM where desired by the application, but we do not see any benefit in making the deployment of DCCP contingent on the deployment of CM itself.
		DCCP A is the "feature location" for all features F/A, and the "feature remote" for all features F/B. Round-Trip Times DCCP round-trip time measurements are performed by congestion control mechanisms; different mechanisms may measure round-trip time in different ways, or not measure it at all.
		DCCP is a congestion control protocol, not a flow control protocol.
	www.faqs.org /rfc/rfc4340.txt (8287 words)

	Roxen Community: RFC 4336 Problem Statement for the Datagram Congestion Control Protocol (DCCP) (Informational) (Site not responding. Last check: )
		A key disadvantage of providing congestion control above UDP is that it places an unnecessary burden on the application-level designer, who might be just as happy to use the congestion control provided by a lower layer.
		Instead of providing congestion control above UDP, a second possibility would be to provide congestion control for unreliable applications at a layer below UDP, with applications using UDP as their transport protocol.
		Although there is a legitimate need for a transport protocol for such short-lived reliable flows of such request/response applications, we believe that the overlap with the requirements of DCCP is almost non-existent and that DCCP should not be designed to meet the needs of these request/response applications.
	community.roxen.com /developers/idocs/rfc/rfc4336.html (6261 words)

	Datagram Congestion Control Protocol (dccp) Charter
		The Datagram Control Protocol working group is chartered to develop and standardize the Datagram Congestion Control Protocol (DCCP).
		Within the constraints of providing these core functions, DCCP aims to be a general purpose protocol, minimizing the overhead of packet header size or end-node processing as much as possible.
		Therefore, DCCP is as simple as possible, and as far as reasonably possible, it should avoid providing higher-level transport functionality.
	www.ietf.org /proceedings/02nov/214.htm (1879 words)

	DCCP, Datagram Congestion Control Protocol
		The offset from the start of the packet's DCCP header to the start of the application data area in 32-bit words.
		The receiver MUST ignore packets whose offset is smaller than the minimum-sized header for the given Type or larger than the DCCP packet itself.
		This always includes the DCCP header and options, but some or all of the application data may be excluded.
	www.networksorcery.com /enp/protocol/dccp.htm (336 words)

	Datagram Congestion Control Protocol (dccp) Internet Drafts (Site not responding. Last check: )
		The Datagram Congestion Control Protocol (DCCP) is a newly defined transport protocol that provides desirable services for real-time applications.
		TFRC is a congestion control mechanism for unicast flows operating in a best- effort Internet environment.
		Datagram Congestion Control Protocol (DCCP) (RFC 4340) (318830 bytes)
	bgp.potaroo.net /ietf/html/ids-wg-dccp.html (902 words)

	DCCP [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.
		Abstract: DCCP, the Datagram Congestion Control Protocol, is a new transport protocol in the TCP/UDP family that provides a congestion-controlled flow of unreliable datagrams.
	www.read.cs.ucla.edu /dccp (549 words)

	The User Datagram Protocol (UDP)
		The User Datagram Protocol (UDP) is a transport layer protocol defined for use with the IP network layer protocol.
		Like for other transport protocols, the UDP header and data are not processed by Intermediate Systems (IS) in the network, and are delivered to the final destination in the same form as originally transmitted.
		Valid data are passed to the appropriate session layer protocol identified by the source and destination port numbers (i.e.
	www.erg.abdn.ac.uk /users/gorry/course/inet-pages/udp.html (764 words)

	Index Buchstabe D :: netzikon :: Netzwerklexikon
		Das Datagram Congestion Control Protocol (DCCP) ist ein minimalistisches Protokoll für den Transp...
		Das DICT Protocol ist ein Netzwerkprotokoll, für den Zugriff auf Wörterbuch-Server (Dictionary Se...
		Das Dynamic Trunking Protocol (DTP) ist ein Netzwerkprotokoll, zur Konfiguration von Trunks.
	www.netzikon.net /lexikon/d (858 words)

	SourceForge.net: Datagram Congestion Control Protocol
		The project's goal is to implement DCCP in the Linux kernel.
		DCCP (Datagram Congestion Control Protocol) is an unreliable, congestion-controlled transport protocol providing a flow of datagrams with a feature negotiation mechanism built-in.
		SourceForge.net is introducing a new feature that will let you buy or sell services for Open Source projects right from the site.
	sourceforge.net /projects/dccp (121 words)

	TCP
		TCP Congestion Control with Appropriate Byte Counting (ABC)
		Session Description Protocol (SDP) Bandwidth Modifiers for RTP Control Protocol (RTCP) Bandwidth
		Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP-Friendly Rate Control (TFRC)
	rfc.archivesat.com /category-17.htm (526 words)

	IANA Matrix
		Profile for DCCP Congestion Control ID 2: TCP-like Congestion Control Parameters - Feature Numbers
		Profile for DCCP Congestion Control ID 3: TFRC Congestion Control Parameters - Feature Numbers
		Labels beginning with X are reserved for private use All others: Standards Track RFC or an IESG-approved experimental protocol
	www.iana.org /numbers.html (2070 words)

Try your search on: Qwika (all wikis)