SlideShare a Scribd company logo
1 of 12
Congestion Control
TCP Congestion Control
 The idea of TCP congestion control is for each source to determine how
much capacity is available in the network, so that it knows how many
packets it can safely have in transit.
– Once a given source has this many packets in transit, it uses the arrival of an
ACK as a signal that one of its packets has left the network, and that it is
therefore safe to insert a new packet into the network without adding to the
level of congestion.
– By using ACKs to pace the transmission of packets, TCP is said to be self-
clocking.
Additive Increase/Multiplicative Decrease:
– TCP maintains a new state variable for each connection, called
CongestionWindow, which is used by the source to limit how much data it
is allowed to have in transit at a given time.
– The congestion window is congestion control’s counterpart to flow control’s
advertised window.
TCP Congestion Control
– TCP is modified such that the maximum number of bytes of
unacknowledged data allowed is now the minimum of the congestion
window and the advertised window.
MaxWindow = MIN(CongestionWindow, AdvertisedWindow)
EffectiveWindow = MaxWindow − (LastByteSent − LastByteAcked)
– That is, MaxWindow replaces AdvertisedWindow in the calculation of
EffectiveWindow.
– Thus, a TCP source is allowed to send no faster than the slowest
component—the network or the destination host—can accommodate.
– The problem, of course, is how TCP comes to learn an appropriate value for
CongestionWindow.
– Unlike the AdvertisedWindow, which is sent by the receiving side of the
connection, there is no one to send a suitable CongestionWindow to the
sending side of TCP.
TCP Congestion Control
 The answer is that the TCP source sets the CongestionWindow based on the
level of congestion it perceives to exist in the network.
 This involves decreasing the congestion window when the level of congestion
goes up and increasing the congestion window when the level of congestion
goes down. Taken together, the mechanism is commonly called additive
increase/multiplicative decrease (AIMD)
– How does the source determine that the network is congested and that it
should decrease the congestion window?
 Based on the observation that the main reason packets are not delivered, and a
timeout results, is that a packet was dropped due to congestion. It is rare that a
packet is dropped because of an error during transmission.
 Therefore, TCP interprets timeouts as a sign of congestion and reduces the rate
at which it is transmitting.
 Specifically, each time a timeout occurs, the source sets CongestionWindow to
half of its previous value. This halving of the CongestionWindow for each
timeout corresponds to the “multiplicative decrease” part of AIMD.
 For example, suppose the CongestionWindow is currently set to 16 packets. If a
loss is detected, CongestionWindow is set to 8.
 Additional losses cause CongestionWindow to be reduced to 4, then 2, and
finally to 1 packet.
TCP Congestion Control
 CongestionWindow is not allowed to fall below the size of a single packet, i.e.,
maximum segment size (MSS).
– Increase the congestion window to take advantage of newly available
capacity in the network.
– This is the “additive increase” part of AIMD, and it works as follows.
 Every time the source successfully sends a CongestionWindow’s worth of
packets—that is, each packet sent out during the last RTT has been ACKed—it
adds the equivalent of 1 packet to CongestionWindow.
TCP Congestion Control
– TCP does not wait for an entire window’s worth of ACKs to add 1 packet’s
worth to the congestion window, but instead increments CongestionWindow
by a little for each ACK that arrives.
– Specifically, the congestion window is incremented as follows each time an
ACK arrives:
• Increment = MSS × (MSS/CongestionWindow)
• CongestionWindow+= Increment
• That is, rather than incrementing CongestionWindow by an entire MSS bytes
each RTT, we increment it by a fraction of MSS every time an ACK is received.
• Assuming that each ACK acknowledges the receipt of MSS bytes, then that
fraction is MSS/CongestionWindow.
TCP Congestion Control
Slow Start
 Additive Increase / Multiplicative Decrease is only suitable for source,
that is operating close to the available capacity of the network, but it
takes too long to ramp up a connection when it is starting from scratch.
 slow start, that is used to increase the congestion window rapidly from a
cold start.
 Slow start effectively increases the congestion window exponentially,
rather than linearly.
– the source starts out by setting CongestionWindow to one packet.
– When the ACK for this packet arrives, TCP adds 1 to CongestionWindow
and then sends two packets.
– Upon receiving the corresponding two ACKs, TCP increments
CongestionWindow by 2—one for each ACK—and next sends four packets.
– The end result is that TCP effectively doubles the number of packets it has
in transit every RTT.
TCP Congestion Control
TCP Congestion Control
Two different situations in which slow start runs,
 The first is at the very beginning of a connection, at which time the source
has no idea how many packets it is going to be able to have in transit at a
given time.
− In this situation, slow start continues to double CongestionWindow each RTT
until there is a loss, at which time a timeout causes multiplicative decrease to
divide CongestionWindow by 2.
 The second situation in which slow start is used is a bit more subtle; it
occurs when the connection goes dead while waiting for a timeout to occur.
− the source then uses slow start to restart the flow of data.
 Specifically, the source has a current (and useful) value of
CongestionWindow; this is the value of CongestionWindow that
existed prior to the last packet loss, divided by 2 as a result of the
loss.
 This value used as the “target” congestion window also called as
CongestionThreshold.
TCP Congestion Control
 Slow start is used to rapidly increase the sending rate up to this
value, and then additive increase is used beyond this point.
i.e., assume congestion window size is x at the time of timeout
 A time out happens, causing the congestion window to be divided by 2,
dropping the CongestionWindow size x to x/2 and CongestionThreshold
is set to this amount (x/2).
 CongestionWindow is reset to one packet, as the sender enters slow start.
 Slow start increases the congestion window exponentially until it reaches
CongestionThreshold .
 CongestionWindow then grows linearly (i.e., it uses additive increase)
TCP Congestion Control
Fast Retrasnmit and Fast Recovery
– The idea of fast retransmit is straightforward. Every time a data packet
arrives at the receiving side, the receiver responds with an acknowledgment,
even if this sequence number has already been acknowledged.
– Thus, when a packet arrives out of order— that is, TCP cannot yet
acknowledge the data the packet contains because earlier data has not yet
arrived—TCP resends the same acknowledgment it sent the last time.
– This second transmission of the same acknowledgment is called a duplicate
ACK.
– When the sending side sees a duplicate ACK, it knows that the other side
must have received a packet out of order, which suggests that an earlier
packet might have been lost.
– Since it is also possible that the earlier packet has only been delayed rather
than lost, the sender waits until it sees some number of duplicate ACKs and
then retransmits the missing packet. In practice, TCP waits until it has seen
three duplicate ACKs before retransmitting the packet.
TCP Congestion Control
– When the fast retransmit mechanism signals congestion, rather than drop the
congestion window all the way back to one packet and run slow start, it is
possible to use the ACKs that are still in the pipe to clock the sending of
packets.
– This mechanism, which is called fast recovery, effectively removes the slow
start phase that happens between when fast retransmit detects a lost packet
and additive increase begins.

More Related Content

What's hot

Destination Sequenced Distance Vector Routing (DSDV)
Destination Sequenced Distance Vector Routing (DSDV)Destination Sequenced Distance Vector Routing (DSDV)
Destination Sequenced Distance Vector Routing (DSDV)ArunChokkalingam
 
Internet control message protocol
Internet control message protocolInternet control message protocol
Internet control message protocolasimnawaz54
 
Network Layer,Computer Networks
Network Layer,Computer NetworksNetwork Layer,Computer Networks
Network Layer,Computer Networksguesta81d4b
 
QOS (Quality of Services) - Computer Networks
 QOS (Quality of Services) - Computer Networks QOS (Quality of Services) - Computer Networks
QOS (Quality of Services) - Computer NetworksIIIT Manipur
 
Selective repeat protocol
Selective repeat protocolSelective repeat protocol
Selective repeat protocolManusha Dilan
 
User datagram protocol (udp)
User datagram protocol (udp)User datagram protocol (udp)
User datagram protocol (udp)Ramola Dhande
 
Multiple access control protocol
Multiple access control protocol Multiple access control protocol
Multiple access control protocol meenamunesh
 
IEEE 802.11 Architecture and Services
IEEE 802.11 Architecture and ServicesIEEE 802.11 Architecture and Services
IEEE 802.11 Architecture and ServicesSayed Chhattan Shah
 
Packet radio protocol
Packet radio protocolPacket radio protocol
Packet radio protocolPriya Kaushal
 
Tcp Udp Icmp And The Transport Layer
Tcp Udp Icmp And The Transport LayerTcp Udp Icmp And The Transport Layer
Tcp Udp Icmp And The Transport Layertmavroidis
 
Routing algorithm
Routing algorithmRouting algorithm
Routing algorithmBushra M
 

What's hot (20)

Tcp
TcpTcp
Tcp
 
Mobile IP
Mobile IPMobile IP
Mobile IP
 
Destination Sequenced Distance Vector Routing (DSDV)
Destination Sequenced Distance Vector Routing (DSDV)Destination Sequenced Distance Vector Routing (DSDV)
Destination Sequenced Distance Vector Routing (DSDV)
 
Internet control message protocol
Internet control message protocolInternet control message protocol
Internet control message protocol
 
Link state routing protocol
Link state routing protocolLink state routing protocol
Link state routing protocol
 
Network Layer,Computer Networks
Network Layer,Computer NetworksNetwork Layer,Computer Networks
Network Layer,Computer Networks
 
QOS (Quality of Services) - Computer Networks
 QOS (Quality of Services) - Computer Networks QOS (Quality of Services) - Computer Networks
QOS (Quality of Services) - Computer Networks
 
Distance vector routing
Distance vector routingDistance vector routing
Distance vector routing
 
Quality of Service
Quality of ServiceQuality of Service
Quality of Service
 
Data link layer
Data link layer Data link layer
Data link layer
 
Selective repeat protocol
Selective repeat protocolSelective repeat protocol
Selective repeat protocol
 
Transport layer protocols : Simple Protocol , Stop and Wait Protocol , Go-Bac...
Transport layer protocols : Simple Protocol , Stop and Wait Protocol , Go-Bac...Transport layer protocols : Simple Protocol , Stop and Wait Protocol , Go-Bac...
Transport layer protocols : Simple Protocol , Stop and Wait Protocol , Go-Bac...
 
User datagram protocol (udp)
User datagram protocol (udp)User datagram protocol (udp)
User datagram protocol (udp)
 
Multiple access control protocol
Multiple access control protocol Multiple access control protocol
Multiple access control protocol
 
IEEE 802.11 Architecture and Services
IEEE 802.11 Architecture and ServicesIEEE 802.11 Architecture and Services
IEEE 802.11 Architecture and Services
 
Packet radio protocol
Packet radio protocolPacket radio protocol
Packet radio protocol
 
CoAP - Web Protocol for IoT
CoAP - Web Protocol for IoTCoAP - Web Protocol for IoT
CoAP - Web Protocol for IoT
 
Tcp Udp Icmp And The Transport Layer
Tcp Udp Icmp And The Transport LayerTcp Udp Icmp And The Transport Layer
Tcp Udp Icmp And The Transport Layer
 
Routing algorithm
Routing algorithmRouting algorithm
Routing algorithm
 
Transport layer protocol
Transport layer protocolTransport layer protocol
Transport layer protocol
 

Viewers also liked

Java Input Output and File Handling
Java Input Output and File HandlingJava Input Output and File Handling
Java Input Output and File HandlingSunil OS
 
basics of file handling
basics of file handlingbasics of file handling
basics of file handlingpinkpreet_kaur
 
14 file handling
14 file handling14 file handling
14 file handlingAPU
 
Routing Protocols and Concepts - Chapter 1
Routing Protocols and Concepts - Chapter 1Routing Protocols and Concepts - Chapter 1
Routing Protocols and Concepts - Chapter 1CAVC
 
Java Course 8: I/O, Files and Streams
Java Course 8: I/O, Files and StreamsJava Course 8: I/O, Files and Streams
Java Course 8: I/O, Files and StreamsAnton Keks
 

Viewers also liked (7)

Socket System Calls
Socket System CallsSocket System Calls
Socket System Calls
 
Java Input Output and File Handling
Java Input Output and File HandlingJava Input Output and File Handling
Java Input Output and File Handling
 
basics of file handling
basics of file handlingbasics of file handling
basics of file handling
 
14 file handling
14 file handling14 file handling
14 file handling
 
Routing Protocols and Concepts - Chapter 1
Routing Protocols and Concepts - Chapter 1Routing Protocols and Concepts - Chapter 1
Routing Protocols and Concepts - Chapter 1
 
Java Course 8: I/O, Files and Streams
Java Course 8: I/O, Files and StreamsJava Course 8: I/O, Files and Streams
Java Course 8: I/O, Files and Streams
 
Socket programming
Socket programmingSocket programming
Socket programming
 

Similar to Congestion control in TCP

Tcp Congestion Avoidance
Tcp Congestion AvoidanceTcp Congestion Avoidance
Tcp Congestion AvoidanceRam Dutt Shukla
 
Comparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
Comparison of TCP congestion control mechanisms Tahoe, Newreno and VegasComparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
Comparison of TCP congestion control mechanisms Tahoe, Newreno and VegasIOSR Journals
 
Comparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
Comparison of TCP congestion control mechanisms Tahoe, Newreno and VegasComparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
Comparison of TCP congestion control mechanisms Tahoe, Newreno and VegasIOSR Journals
 
Mobile Transpot Layer
Mobile Transpot LayerMobile Transpot Layer
Mobile Transpot LayerMaulik Patel
 
Congestion avoidance in TCP
Congestion avoidance in TCPCongestion avoidance in TCP
Congestion avoidance in TCPselvakumar_b1985
 
tcp congestion .pptx
tcp congestion .pptxtcp congestion .pptx
tcp congestion .pptxECE01AJAYS
 
Lecture 19 22. transport protocol for ad-hoc
Lecture 19 22. transport protocol for ad-hoc Lecture 19 22. transport protocol for ad-hoc
Lecture 19 22. transport protocol for ad-hoc Chandra Meena
 
NetWork Design Question2.) How does TCP prevent Congestion Dicuss.pdf
NetWork Design Question2.) How does TCP prevent Congestion Dicuss.pdfNetWork Design Question2.) How does TCP prevent Congestion Dicuss.pdf
NetWork Design Question2.) How does TCP prevent Congestion Dicuss.pdfoptokunal1
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
 
Tcp performance simulationsusingns2
Tcp performance simulationsusingns2Tcp performance simulationsusingns2
Tcp performance simulationsusingns2Justin Frankel
 
High Performance Networking with Advanced TCP
High Performance Networking with Advanced TCPHigh Performance Networking with Advanced TCP
High Performance Networking with Advanced TCPDilum Bandara
 
TCP Theory
TCP TheoryTCP Theory
TCP Theorysoohyunc
 
Ch 18 intro to network layer - section 3
Ch 18   intro to network layer - section 3Ch 18   intro to network layer - section 3
Ch 18 intro to network layer - section 3Hossam El-Deen Osama
 
Analytical Research of TCP Variants in Terms of Maximum Throughput
Analytical Research of TCP Variants in Terms of Maximum ThroughputAnalytical Research of TCP Variants in Terms of Maximum Throughput
Analytical Research of TCP Variants in Terms of Maximum ThroughputIJLT EMAS
 

Similar to Congestion control in TCP (20)

Congestion Control
Congestion ControlCongestion Control
Congestion Control
 
Tcp Congestion Avoidance
Tcp Congestion AvoidanceTcp Congestion Avoidance
Tcp Congestion Avoidance
 
Comparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
Comparison of TCP congestion control mechanisms Tahoe, Newreno and VegasComparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
Comparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
 
Comparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
Comparison of TCP congestion control mechanisms Tahoe, Newreno and VegasComparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
Comparison of TCP congestion control mechanisms Tahoe, Newreno and Vegas
 
Tcp congestion avoidance
Tcp congestion avoidanceTcp congestion avoidance
Tcp congestion avoidance
 
Mobile Transpot Layer
Mobile Transpot LayerMobile Transpot Layer
Mobile Transpot Layer
 
Congestion avoidance in TCP
Congestion avoidance in TCPCongestion avoidance in TCP
Congestion avoidance in TCP
 
tcp congestion .pptx
tcp congestion .pptxtcp congestion .pptx
tcp congestion .pptx
 
Lecture 19 22. transport protocol for ad-hoc
Lecture 19 22. transport protocol for ad-hoc Lecture 19 22. transport protocol for ad-hoc
Lecture 19 22. transport protocol for ad-hoc
 
Congestion control
Congestion controlCongestion control
Congestion control
 
NetWork Design Question2.) How does TCP prevent Congestion Dicuss.pdf
NetWork Design Question2.) How does TCP prevent Congestion Dicuss.pdfNetWork Design Question2.) How does TCP prevent Congestion Dicuss.pdf
NetWork Design Question2.) How does TCP prevent Congestion Dicuss.pdf
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
 
Congestion control avoidance
Congestion control avoidanceCongestion control avoidance
Congestion control avoidance
 
Tcp performance simulationsusingns2
Tcp performance simulationsusingns2Tcp performance simulationsusingns2
Tcp performance simulationsusingns2
 
High Performance Networking with Advanced TCP
High Performance Networking with Advanced TCPHigh Performance Networking with Advanced TCP
High Performance Networking with Advanced TCP
 
TCP Theory
TCP TheoryTCP Theory
TCP Theory
 
TCP_Congestion_Control.ppt
TCP_Congestion_Control.pptTCP_Congestion_Control.ppt
TCP_Congestion_Control.ppt
 
Ch 18 intro to network layer - section 3
Ch 18   intro to network layer - section 3Ch 18   intro to network layer - section 3
Ch 18 intro to network layer - section 3
 
Analysis of TCP variants
Analysis of TCP variantsAnalysis of TCP variants
Analysis of TCP variants
 
Analytical Research of TCP Variants in Terms of Maximum Throughput
Analytical Research of TCP Variants in Terms of Maximum ThroughputAnalytical Research of TCP Variants in Terms of Maximum Throughput
Analytical Research of TCP Variants in Terms of Maximum Throughput
 

More from selvakumar_b1985 (20)

Triggering transmission
Triggering transmissionTriggering transmission
Triggering transmission
 
Token ring
Token ringToken ring
Token ring
 
Subnetting
SubnettingSubnetting
Subnetting
 
Email Security
Email SecurityEmail Security
Email Security
 
RIP - Routing Information Protocol
RIP - Routing Information ProtocolRIP - Routing Information Protocol
RIP - Routing Information Protocol
 
Physical Mediums
Physical MediumsPhysical Mediums
Physical Mediums
 
OSPF - Routing Protocol
OSPF - Routing ProtocolOSPF - Routing Protocol
OSPF - Routing Protocol
 
Layering and Architecture
Layering and ArchitectureLayering and Architecture
Layering and Architecture
 
Issues in Data Link Layer
Issues in Data Link LayerIssues in Data Link Layer
Issues in Data Link Layer
 
Internetworking - IP
Internetworking - IPInternetworking - IP
Internetworking - IP
 
ICMP
ICMPICMP
ICMP
 
Hybrid Channel Access Link
Hybrid Channel Access LinkHybrid Channel Access Link
Hybrid Channel Access Link
 
Hypertext Transfer Protocol
Hypertext Transfer ProtocolHypertext Transfer Protocol
Hypertext Transfer Protocol
 
Addressing Scheme IPv4
Addressing Scheme IPv4Addressing Scheme IPv4
Addressing Scheme IPv4
 
File Transfer Protocol
File Transfer ProtocolFile Transfer Protocol
File Transfer Protocol
 
Framing Protocols
Framing ProtocolsFraming Protocols
Framing Protocols
 
Flow Control
Flow ControlFlow Control
Flow Control
 
FDDI
FDDIFDDI
FDDI
 
Ethernet
EthernetEthernet
Ethernet
 
Error control
Error controlError control
Error control
 

Recently uploaded

Double rodded leveling 1 pdf activity 01
Double rodded leveling 1 pdf activity 01Double rodded leveling 1 pdf activity 01
Double rodded leveling 1 pdf activity 01KreezheaRecto
 
Unit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdfUnit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdfRagavanV2
 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Christo Ananth
 
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...roncy bisnoi
 
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756dollysharma2066
 
Bhosari ( Call Girls ) Pune 6297143586 Hot Model With Sexy Bhabi Ready For ...
Bhosari ( Call Girls ) Pune  6297143586  Hot Model With Sexy Bhabi Ready For ...Bhosari ( Call Girls ) Pune  6297143586  Hot Model With Sexy Bhabi Ready For ...
Bhosari ( Call Girls ) Pune 6297143586 Hot Model With Sexy Bhabi Ready For ...tanu pandey
 
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete RecordCCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete RecordAsst.prof M.Gokilavani
 
chapter 5.pptx: drainage and irrigation engineering
chapter 5.pptx: drainage and irrigation engineeringchapter 5.pptx: drainage and irrigation engineering
chapter 5.pptx: drainage and irrigation engineeringmulugeta48
 
PVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELL
PVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELLPVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELL
PVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELLManishPatel169454
 
BSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptx
BSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptxBSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptx
BSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptxfenichawla
 
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...ranjana rawat
 
University management System project report..pdf
University management System project report..pdfUniversity management System project report..pdf
University management System project report..pdfKamal Acharya
 
Generative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPTGenerative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPTbhaskargani46
 
Double Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torqueDouble Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torqueBhangaleSonal
 
ONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdf
ONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdfONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdf
ONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdfKamal Acharya
 
Unleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leapUnleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leapRishantSharmaFr
 
Call Girls Wakad Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Wakad Call Me 7737669865 Budget Friendly No Advance BookingCall Girls Wakad Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Wakad Call Me 7737669865 Budget Friendly No Advance Bookingroncy bisnoi
 

Recently uploaded (20)

Double rodded leveling 1 pdf activity 01
Double rodded leveling 1 pdf activity 01Double rodded leveling 1 pdf activity 01
Double rodded leveling 1 pdf activity 01
 
Unit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdfUnit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdf
 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
 
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
 
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
 
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
 
Bhosari ( Call Girls ) Pune 6297143586 Hot Model With Sexy Bhabi Ready For ...
Bhosari ( Call Girls ) Pune  6297143586  Hot Model With Sexy Bhabi Ready For ...Bhosari ( Call Girls ) Pune  6297143586  Hot Model With Sexy Bhabi Ready For ...
Bhosari ( Call Girls ) Pune 6297143586 Hot Model With Sexy Bhabi Ready For ...
 
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort ServiceCall Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
 
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete RecordCCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
 
chapter 5.pptx: drainage and irrigation engineering
chapter 5.pptx: drainage and irrigation engineeringchapter 5.pptx: drainage and irrigation engineering
chapter 5.pptx: drainage and irrigation engineering
 
PVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELL
PVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELLPVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELL
PVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELL
 
BSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptx
BSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptxBSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptx
BSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptx
 
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
 
University management System project report..pdf
University management System project report..pdfUniversity management System project report..pdf
University management System project report..pdf
 
Generative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPTGenerative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPT
 
Double Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torqueDouble Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torque
 
ONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdf
ONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdfONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdf
ONLINE FOOD ORDER SYSTEM PROJECT REPORT.pdf
 
Unleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leapUnleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leap
 
Roadmap to Membership of RICS - Pathways and Routes
Roadmap to Membership of RICS - Pathways and RoutesRoadmap to Membership of RICS - Pathways and Routes
Roadmap to Membership of RICS - Pathways and Routes
 
Call Girls Wakad Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Wakad Call Me 7737669865 Budget Friendly No Advance BookingCall Girls Wakad Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Wakad Call Me 7737669865 Budget Friendly No Advance Booking
 

Congestion control in TCP

  • 2. TCP Congestion Control  The idea of TCP congestion control is for each source to determine how much capacity is available in the network, so that it knows how many packets it can safely have in transit. – Once a given source has this many packets in transit, it uses the arrival of an ACK as a signal that one of its packets has left the network, and that it is therefore safe to insert a new packet into the network without adding to the level of congestion. – By using ACKs to pace the transmission of packets, TCP is said to be self- clocking. Additive Increase/Multiplicative Decrease: – TCP maintains a new state variable for each connection, called CongestionWindow, which is used by the source to limit how much data it is allowed to have in transit at a given time. – The congestion window is congestion control’s counterpart to flow control’s advertised window.
  • 3. TCP Congestion Control – TCP is modified such that the maximum number of bytes of unacknowledged data allowed is now the minimum of the congestion window and the advertised window. MaxWindow = MIN(CongestionWindow, AdvertisedWindow) EffectiveWindow = MaxWindow − (LastByteSent − LastByteAcked) – That is, MaxWindow replaces AdvertisedWindow in the calculation of EffectiveWindow. – Thus, a TCP source is allowed to send no faster than the slowest component—the network or the destination host—can accommodate. – The problem, of course, is how TCP comes to learn an appropriate value for CongestionWindow. – Unlike the AdvertisedWindow, which is sent by the receiving side of the connection, there is no one to send a suitable CongestionWindow to the sending side of TCP.
  • 4. TCP Congestion Control  The answer is that the TCP source sets the CongestionWindow based on the level of congestion it perceives to exist in the network.  This involves decreasing the congestion window when the level of congestion goes up and increasing the congestion window when the level of congestion goes down. Taken together, the mechanism is commonly called additive increase/multiplicative decrease (AIMD) – How does the source determine that the network is congested and that it should decrease the congestion window?  Based on the observation that the main reason packets are not delivered, and a timeout results, is that a packet was dropped due to congestion. It is rare that a packet is dropped because of an error during transmission.  Therefore, TCP interprets timeouts as a sign of congestion and reduces the rate at which it is transmitting.  Specifically, each time a timeout occurs, the source sets CongestionWindow to half of its previous value. This halving of the CongestionWindow for each timeout corresponds to the “multiplicative decrease” part of AIMD.  For example, suppose the CongestionWindow is currently set to 16 packets. If a loss is detected, CongestionWindow is set to 8.  Additional losses cause CongestionWindow to be reduced to 4, then 2, and finally to 1 packet.
  • 5. TCP Congestion Control  CongestionWindow is not allowed to fall below the size of a single packet, i.e., maximum segment size (MSS). – Increase the congestion window to take advantage of newly available capacity in the network. – This is the “additive increase” part of AIMD, and it works as follows.  Every time the source successfully sends a CongestionWindow’s worth of packets—that is, each packet sent out during the last RTT has been ACKed—it adds the equivalent of 1 packet to CongestionWindow.
  • 6. TCP Congestion Control – TCP does not wait for an entire window’s worth of ACKs to add 1 packet’s worth to the congestion window, but instead increments CongestionWindow by a little for each ACK that arrives. – Specifically, the congestion window is incremented as follows each time an ACK arrives: • Increment = MSS × (MSS/CongestionWindow) • CongestionWindow+= Increment • That is, rather than incrementing CongestionWindow by an entire MSS bytes each RTT, we increment it by a fraction of MSS every time an ACK is received. • Assuming that each ACK acknowledges the receipt of MSS bytes, then that fraction is MSS/CongestionWindow.
  • 7. TCP Congestion Control Slow Start  Additive Increase / Multiplicative Decrease is only suitable for source, that is operating close to the available capacity of the network, but it takes too long to ramp up a connection when it is starting from scratch.  slow start, that is used to increase the congestion window rapidly from a cold start.  Slow start effectively increases the congestion window exponentially, rather than linearly. – the source starts out by setting CongestionWindow to one packet. – When the ACK for this packet arrives, TCP adds 1 to CongestionWindow and then sends two packets. – Upon receiving the corresponding two ACKs, TCP increments CongestionWindow by 2—one for each ACK—and next sends four packets. – The end result is that TCP effectively doubles the number of packets it has in transit every RTT.
  • 9. TCP Congestion Control Two different situations in which slow start runs,  The first is at the very beginning of a connection, at which time the source has no idea how many packets it is going to be able to have in transit at a given time. − In this situation, slow start continues to double CongestionWindow each RTT until there is a loss, at which time a timeout causes multiplicative decrease to divide CongestionWindow by 2.  The second situation in which slow start is used is a bit more subtle; it occurs when the connection goes dead while waiting for a timeout to occur. − the source then uses slow start to restart the flow of data.  Specifically, the source has a current (and useful) value of CongestionWindow; this is the value of CongestionWindow that existed prior to the last packet loss, divided by 2 as a result of the loss.  This value used as the “target” congestion window also called as CongestionThreshold.
  • 10. TCP Congestion Control  Slow start is used to rapidly increase the sending rate up to this value, and then additive increase is used beyond this point. i.e., assume congestion window size is x at the time of timeout  A time out happens, causing the congestion window to be divided by 2, dropping the CongestionWindow size x to x/2 and CongestionThreshold is set to this amount (x/2).  CongestionWindow is reset to one packet, as the sender enters slow start.  Slow start increases the congestion window exponentially until it reaches CongestionThreshold .  CongestionWindow then grows linearly (i.e., it uses additive increase)
  • 11. TCP Congestion Control Fast Retrasnmit and Fast Recovery – The idea of fast retransmit is straightforward. Every time a data packet arrives at the receiving side, the receiver responds with an acknowledgment, even if this sequence number has already been acknowledged. – Thus, when a packet arrives out of order— that is, TCP cannot yet acknowledge the data the packet contains because earlier data has not yet arrived—TCP resends the same acknowledgment it sent the last time. – This second transmission of the same acknowledgment is called a duplicate ACK. – When the sending side sees a duplicate ACK, it knows that the other side must have received a packet out of order, which suggests that an earlier packet might have been lost. – Since it is also possible that the earlier packet has only been delayed rather than lost, the sender waits until it sees some number of duplicate ACKs and then retransmits the missing packet. In practice, TCP waits until it has seen three duplicate ACKs before retransmitting the packet.
  • 12. TCP Congestion Control – When the fast retransmit mechanism signals congestion, rather than drop the congestion window all the way back to one packet and run slow start, it is possible to use the ACKs that are still in the pipe to clock the sending of packets. – This mechanism, which is called fast recovery, effectively removes the slow start phase that happens between when fast retransmit detects a lost packet and additive increase begins.