TCP global synchronization

TCP global synchronization

TCP global synchronization in computer networks can happen to
TCP/IP flows during periodsof congestion because each sender will reduce their transmission rate at the sametime when packet loss occurs.

Routers on the Internet normally have packet queues, to allow them to hold packets when the network is busy, rather than discarding them.

Because routers have limited resources, the size of these queues is also limited. The simplest technique and most efficient to limit queue size is known as tail drop. The queue is allowed to fill to its maximum size, and then any new packets are simply discarded, until there is space in the queue again.

This causes problems when used on TCP/IP routers handling multiple TCP streams, especially when bursty traffic is present. While the network is stable, the queue is constantly full, and there are no problems except that the full queue results in high latency. However, the introduction of a sudden burst of traffic may cause large numbers of established, steady streams to lose packets simultaneously.

TCP has automatic recovery from dropped packets, which it correctly interprets as congestion on the network. The sender reduces its sending rate for a certain amount of time, and then tries to find out if the network is no longer congested by increasing the rate again. This is known as the slow-start algorithm.

Almost all the senders will use the same time delay before increasing their rates. When these delays expire, at the same time, all the senders will send additional packets, the router queue will again overflow, more packets will be dropped, the senders will all back off for a fixed delay... ad infinitum.

This pattern of each sender decreasing and increasing transmission rates at the same time as other senders is referred to as "global synchronization" and leads to inefficient use of bandwidth, due to the large numbers of dropped packets, which must be retransmitted.

This problem has been the subject of much research. The consensus appears to be that the tail drop algorithm is the leading cause of the problem, and other queue size management algorithms such as Random Early Detection (RED) and Weighted RED will reduce the likelihood of global synchronisation, as well as keeping queue sizes down in the face of heavy load and bursty traffic.

Connectionless protocols such as UDP do not experience global synchronization becausethey ignore (or are not aware of) packet loss.

ee also

* Transmission Control Protocol (TCP)
* Network congestion avoidance

References

* cite book | author=Vegesna, Srinivas | title=IP Quality of Service, chap. 6
publisher=Cisco press | year=2001 | id=ISBN 1-57870-116-3

* cite book | author=Szigeti, Tim | title=End-to-End QoS Network Design, chap. 6
publisher=Cisco press | year=2005 | id=ISBN 1-57805-176-1

External links

* [http://ispcolumn.isoc.org/2005-06/faster.html an ISOC paper discussing the dynamics of TCP, including global synchronization]
* [http://www.isoc.org/inet97/proceedings/F3/F3_1.HTM A paper with graphs demonstrating TCP global synchronization in action and its impact when TCP coexists with UDP]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • TCP Global Synchronization — beschreibt ein periodischen Ansteigen und Abfallen des Datendurchsatzes in TCP Verbindungen. Dabei tritt dieses Verhalten nicht isoliert an einzelnen TCP Verbindungen auf, sondern synchronisiert an allen TCP Verbindungen eines Systems. Die… …   Deutsch Wikipedia

  • Список портов TCP и UDP — Эта статья содержит незавершённый перевод с английского языка. Вы можете помочь проекту, переведя её до конца. В данной статье приведён список портов TCP и UDP, ко …   Википедия

  • Network congestion — In data networking and queueing theory, network congestion occurs when a link or node is carrying so much data that its quality of service deteriorates. Typical effects include queueing delay, packet loss or the blocking of new connections. A… …   Wikipedia

  • Network congestion avoidance — is a process used in computer networks to avoid congestion.The fundamental problem is that all network resources are limited, including router processing time and link throughput. Eg.: *today s (2006) Wireless LAN effective bandwidth throughput… …   Wikipedia

  • Differentiated services — This article is about communication networks. For the design pattern for business applications, see Differentiated service (design pattern). Differentiated Services or DiffServ is a computer networking architecture that specifies a simple,… …   Wikipedia

  • Bandwidth management — is the process of measuring and controlling the communications (traffic, packets) on a network link, to avoid filling the link to capacity or overfilling the link, which would result in network congestion and poor performance of the network.… …   Wikipedia

  • Random early detection — (RED), auch bekannt als Random early discard oder Random early drop ist ein Verfahren zum aktiven Warteschlangenmanagement in der Netzwerktechnologie und damit auch ein …   Deutsch Wikipedia

  • Random early detection — (RED), also known as random early discard or random early drop is an active queue management algorithm. It is also a congestion avoidance algorithm. [cite journal | last = Floyd | first = Sally | coauthors = Jacobson, Van | title = Random Early… …   Wikipedia

  • Random early discard — Die Artikel Überlastkontrolle, Network congestion avoidance und Random early detection überschneiden sich thematisch. Hilf mit, die Artikel besser voneinander abzugrenzen oder zu vereinigen. Beteilige dich dazu an der Diskussion über diese… …   Deutsch Wikipedia

  • Random early drop — Die Artikel Überlastkontrolle, Network congestion avoidance und Random early detection überschneiden sich thematisch. Hilf mit, die Artikel besser voneinander abzugrenzen oder zu vereinigen. Beteilige dich dazu an der Diskussion über diese… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”