Congestion Avoidance: DECBIT | Computer Networks - Computer Science Engineering (CSE) PDF Download

Congestation Avoidance –DECBit
TCP repeatedly increases the load it imposes on the network in an effort to find the point at which Congestion occurs, and then it backs off from this point. Said another way, TCP needs to create losses to find the available bandwidth of the connection. An appealing alternative, but one that has not yet been widely adopted, is to predict when congestion is about to happen and then to reduce the rate at which hosts send data just before packets start being discarded. We call such a strategy congestion avoidance, to distinguish it from congestion control.

This section describes three different congestion-avoidance mechanisms. The first two take a similar approach: They put a small amount of additional functionality into the router to assist the end node in the anticipation of congestion. The third mechanism is very different from the first two: It attempts to avoid congestion purely from the end nodes.

The first mechanism was developed for use on the Digital Network Architecture (DNA),a connectionless network with a connection-oriented transport protocol. This mechanism could, therefore, also be applied to TCP and IP. This notification is implemented by setting a binary congestion bit in the packets that flow through the router; hence the name DECbit. The destination host then copies this congestion bit into the ACK it sends backto the source. Finally, the source adjusts its sending rate so as to avoid congestion.

A single congestion bit is added to the packet header. A router sets this bit in a packet if its Average queue length is greater than or equal to 1 at the time the packet arrives. This average queue length is measured over a time interval that spans the last busy+idle cycle, plus the current busy cycle. (The router is busy when it is transmitting and idle when it is not.) Figure 6.14 shows the queue length at a router as a function of time. Essentially, the router calculates the area under the curve and divides this value by the time interval to compute the average queue length. Using a queue length of 1 as the trigger for setting the congestion bit is a trade-off between significant queuing(and hence higher throughput) and increased idle time (and hence lower delay). In other words, a queue length of 1 seems to optimize the power function.

The document Congestion Avoidance: DECBIT | Computer Networks - Computer Science Engineering (CSE) is a part of the Computer Science Engineering (CSE) Course Computer Networks.
All you need of Computer Science Engineering (CSE) at this link: Computer Science Engineering (CSE)
21 videos|107 docs|66 tests

Up next

FAQs on Congestion Avoidance: DECBIT - Computer Networks - Computer Science Engineering (CSE)

1. What is congestion avoidance?
Ans. Congestion avoidance is a technique used in computer networks to prevent network congestion from occurring. It involves various algorithms and mechanisms that aim to regulate the flow of data and prevent network congestion by controlling the rate at which data is transmitted.
2. What is DECBIT congestion avoidance algorithm?
Ans. DECBIT (Decreasing Bit-rate) is a congestion avoidance algorithm used in TCP (Transmission Control Protocol) to regulate the flow of data in computer networks. It dynamically adjusts the sending rate of data based on the level of congestion in the network, aiming to prevent congestion collapse and optimize network performance.
3. How does the DECBIT algorithm work?
Ans. The DECBIT algorithm works by monitoring the round-trip time (RTT) of data packets in the network. It uses this information to estimate the level of congestion in the network. When congestion is detected, the algorithm reduces the sending rate of data by decreasing the congestion window size. This allows the network to stabilize and prevents congestion collapse.
4. What are the benefits of using the DECBIT algorithm?
Ans. The DECBIT algorithm offers several benefits in congestion avoidance. It helps to prevent network congestion and congestion collapse by dynamically adjusting the sending rate of data. This ensures optimal network performance and reduces the chances of packet loss. Additionally, DECBIT is a fair algorithm that provides equal bandwidth allocation to all competing flows, promoting fairness in network resource utilization.
5. Are there any limitations or drawbacks of the DECBIT algorithm?
Ans. While the DECBIT algorithm is effective in preventing congestion, it may lead to underutilization of available network capacity in certain scenarios. This is because DECBIT reacts to congestion by decreasing the sending rate, even if the network has enough capacity to handle higher data rates. Additionally, DECBIT relies on accurate RTT measurements, and any inaccuracies in RTT estimation can impact the efficiency of the algorithm.
21 videos|107 docs|66 tests
Download as PDF

Up next

Explore Courses for Computer Science Engineering (CSE) exam
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

Congestion Avoidance: DECBIT | Computer Networks - Computer Science Engineering (CSE)

,

Viva Questions

,

video lectures

,

Congestion Avoidance: DECBIT | Computer Networks - Computer Science Engineering (CSE)

,

Congestion Avoidance: DECBIT | Computer Networks - Computer Science Engineering (CSE)

,

shortcuts and tricks

,

Free

,

past year papers

,

Exam

,

Summary

,

Objective type Questions

,

mock tests for examination

,

Important questions

,

study material

,

MCQs

,

pdf

,

practice quizzes

,

ppt

,

Extra Questions

,

Sample Paper

,

Previous Year Questions with Solutions

,

Semester Notes

;