What are different policies to prevent congestion at different layers?

- Many times it happens that the demand for the resource is more than what network can offer i.e., its capacity. 

- Too much queuing occurs in the networks leading to a great loss of packets. 

- When the network is in the state of congestive collapse, its throughput drops down to zero whereas the path delay increases by a great margin. 

- The network can recover from this state by following a congestion control scheme.

- A congestion avoidance scheme enables the network to operate in an environment where the throughput is high and the delay is low. 

- In other words, these schemes prevent a computer network from falling prey to the vicious clutches of the network congestion problem. 

- Recovery mechanism is implemented through congestion and the prevention mechanism is implemented through congestion avoidance. 

- The network and the user policies are modeled for the purpose of congestion avoidance. 

- These act like a feedback control system. 

The following are defined as the key components of a general congestion avoidance scheme:

Ø  Congestion detection

Ø  Congestion feedback

Ø  Feedback selector

Ø  Signal filter

Ø  Decision function

Ø  Increase and decrease algorithms

- The problem of congestion control gets more complex when the network is using a connection-less protocol. 

- Avoiding congestion rather than simply controlling it is the main focus. 

- A congestion avoidance scheme is designed after comparing it with a number of other alternative schemes. 

- During the comparison, the algorithm with the right parameter values is selected. 

For doing so few goals have been set with which there is an associated test for verifying whether it is being met by the scheme or not:

Ø  Efficient: If the network is operating at the “knee” point, then it is said to be working efficiently.

Ø  Responsiveness: There is a continuous variation in the configuration and the traffic of the network. Therefore the point for optimal operation also varies continuously.

Ø Minimum oscillation: Only those schemes are preferred that have smaller oscillation amplitude.

Ø Convergence: The scheme should be such that it should bring the network to a point of stable operation for keeping the workload as well as the network configuration stable. The schemes that are able to satisfy this goal are called convergent schemes and the divergent schemes are rejected.

Ø Fairness: This goal aims at providing a fair share of resources to each independent user.

Ø  Robustness: This goal defines the capability of the scheme to work in any random environment. Therefore the schemes that are capable of working only for the deterministic service times are rejected.

Ø  Simplicity: Schemes are accepted in their most simple version.

Ø Low parameter sensitivity: Sensitivity of a scheme is measured with respect to its various parameter values. The scheme which is found to be too much sensitive to a particular parameter, it is rejected.

Ø Information entropy: This goal is about how the feedback information is used. The goal is to get maximum info with the minimum possible feedback.

Ø Dimensionless parameters: A parameter having the dimensions such as the mass, time and the length is taken as a network configuration or speed function. A parameter that has no dimensions has got more applicability.

Ø Configuration independence: The scheme is accepted only if it has been tested for various different configurations.

Congestion avoidance scheme has two main components:

Ø  Network policies: It consists of the following algorithms: feedback filter, feedback selector and congestion detection.

Ø  User policies: It consists of the following algorithms: increase/ decrease algorithm, decision function and signal filter.

These algorithms decide whether the network feedback has to be implemented via packet header field or as source quench messages.

What are general principles of congestion control?

- Problems such as the loss of data packets occur if the buffer of the routers overflows.

- This overflow is caused by the problem of the congestive collapse which is a consequence of the network congestion. 

- If the packets have to be re-transmitted more than once, it is an indication that the network is facing the problem of congestion. 

- Re-transmission of the packets is the treatment of only this indication but not for problem of the network congestion. 

- In the problem of congestive collapse, there are a number of sources that make attempts for sending data and that too at a quite high rate. 

- For preventing this problem of the network congestion, it requires mechanisms that are capable of throttling the sending node if in case the problem of network congestion occurs. 

- Network congestion is a real bad thing as it manifests in the network’s performance that the upper layer applications receive. 

- There are various approaches available for preventing and avoiding the problem of network congestion and thus implementing proper congestion control. 

- When the capacity of the network is exceeded by the demands for the resources and too much queuing occurs in the network causing loss of packets, congestion of packets is said to occur. 

- During this problem of network congestion, the throughput of the network might drop down to zero and there might be a high rise in the path delay. 

- Network can recover from the state of congestive collapse using a congestion control scheme. 

- A network can operate in a region where there is high throughput but low delay with the help of the congestion avoidance scheme.

- These schemes keep the network away from falling in to a state of congestive collapse. 

- There is a big confusion over congestion control and congestion avoidance. Most of us think it is the same thing but it is not. 

- Congestion control provides a recovery mechanism whereas the congestion avoidance provides a prevention mechanism. 

- Today’s technological advances in the field of networking have led to a rise in the network links’ bandwidth. 

- In the year of 1970, ARPAnet came in to existence and built using the leased telephone lines that had a 50 kbits/second bandwidth. 

- LAN (local area network) was first developed in the year of 1980 using token rings and Ethernet and offered a bandwidth of 10 mbits/ second. 

- During the same time many efforts were made for standardizing the LAN using the optical fibers providing a 100 mbits/seconds and higher bandwidth. 

- Attention to the congestion control has been increased because of the increase in the mismatching that occurs between the various links composing the network. 

- Routers, IMPs, gateways, intermediate nodes links etc. are the hot-spots for the congestion problems. 

- It is at these spots that the bandwidth of the receiver falls short for accommodating all the incoming traffic. 

- In the networks using the connection-less protocols, it is even more difficult to cope with the problems of network congestion. 

- It is comparatively easy in the networks using the connection-oriented protocols.

- This happens so because in such networks, the network resources are kept under advance reserve during setting up the connection.

- One way for controlling congestion problems is preventing the setting up of new connections if congestion is detected anywhere in the network but it will also prevent the usage of the reserved resources which is a disadvantage. 

What is the difference between congestion control and flow control?

Flow control and congestion control are similar sounding concepts and often confuse us sometimes. In this article we shall discuss about the differences between these two. 

- Computer networks use the flow control mechanism for keeping control over the data flow between two nodes in such a way that the receiver if it is slower when compared to the sender is not outrun by it. 

- The mechanism of flow control also provides ways to the receiver to maintain control over the speed with which it transmits the information.

- On the other side, the congestion control provides mechanism for the controlling the data flow under the condition of actual congestive collapse. 

- The mechanism keeps a control over the entry of data in to the network so that this traffic can be handled by the network effectively.  

- The mechanism of flow control does not let the receiving node get overwhelmed by the traffic that is being sent by another node. 

There are several reasons why this flow of data gets out of control and affects the network negatively. 

- First reason being that the receiving node might not be capable of processing the incoming data as fast as it is being sent by the sender node. 

- Based on these reasons there are various types of flow control mechanisms available. 

- However, the most common categorization is based on the fact whether the feedback is being sent to the sender or not. 

- There is another flow control mechanism called the open loop flow control mechanism. 

- In this mechanism no feedback is sent to the sender by the receiver and this perhaps the most widely used flow control mechanism. 

- Opposite of open loop flow control mechanism is the closed loop flow control. 

- In this mechanism, the receiver sends back congestion information to the sender. 

- Other commonly used flow control mechanisms are:

Ø  Network congestion

Ø  Windowing flow control

Ø  Data buffer etc.

- Congestion control offers such methods that can be used for regulating the incoming traffic in the network to such an extent where the network itself can manage all that.
- In congestion control, the network is prevented from falling in to a state of congestive collapse. 
- In such a state either little or no communication happens.
- This little communication is of no help. 
- Switching networks usually require congestion control measures than any other type of networks. 
- The congestion control is driven by the goal of keeping the number of data packets at such a level that the performance of the network would be reduced dramatically.
- Congestion control mechanism can be seen even in protocols such as UDP (user datagram protocol), TCP (transport control protocol) and other transport layer protocols. 
- TCP makes use of the exponential back off and slow start algorithms. 
- We classify the congestion control algorithms based up on the feedback that is given by the network, the performance aspect that has to be improved, and modifications that have to be made for the present network, fairness criterion that is being used and so on. 

- Congestion and flow control are two very important mechanisms used for keeping the traffic flow in order. 
- Flow control is a mechanism that stretches from one end to another i.e., between the sender and the receiver where the speed of sender is much higher than that of the receiving node. 
- Congestion control is implemented for preventing packet loss as well as delay that is caused as a side effect of the network congestion. 
- Congestion is meant for controlling the traffic of the entire whereas flow control is limited to transmission between two nodes.

How can the problem of congestion be controlled?

Networks often get trapped in the situation of what we call network congestion. For avoiding such collapses, congestion avoidance and congestion control techniques are often used by the networks nowadays. 

In this article, we discuss about how we can control the problem of network congestion using these techniques. Few very common techniques are:

1. Exponential back off (used in CSMA/ CA protocols and Ethernet.)
2. Window reduction (used in TCP)
3. Fair queuing (used in devices such as routers)
4. The implementation of the priority schemes is another way of avoiding the negative effects of this very common problem. Priority schemes let the network transmit the packets having higher priority over the others. This way only the effects of the network congestion can be alleviated for some important transmissions. Priority schemes alone cannot solve this problem.
5. Another method is the explicit allocation of the resources of the network to certain flows. This is commonly used in CFTXOPs (contention – free transmission opportunities) providing very high speed for LAN (local area networks) over the coaxial cables and phone lines that already exist.

- The main cause of the problem of network congestion is the limited capacity of the network. 

- This is to say that the network has limited. 

- The resources also include the link throughput and the router processing time. 

- Congestion control is concerned with curbing the entry of the traffic in to the telecommunications network so that the problem of congestive collapse can be avoided. 

- The over-subscription of the link capabilities is avoided and steps are taken to reduce the resources. 

- One such step is reducing the packet transmission rate. 

- Even though if it sounds similar to flow control, it is not the same thing. 

- Frank Kelly is known as the pioneer of the theory of congestion control. 

- For describing the way in which the network wide rate allocation can be optimized by the individuals by controlling their rates, he used two theories namely the convex optimization theory and the micro economics theory. 

Some optimal rate allocation methods are:

Ø  Max – min fair allocation

Ø  Kelly’s proportional fair allocation

Ways to Classify Congestion Control Algorithm

There are 4 major ways for classifying the congestion control algorithms:

1. Amount as well as type of feedback: This classification involves judging the algorithm on the basis of multi-bit or single bit explicit signals, delay, loss and so on.
2. The performance aspect taken for improvement: Includes variable rate links, short flow advantage, fairness, links that can cause loss etc.
3. Incremental deployability: Modification is the need of sender only, modification is required by receiver and the sender, modification is needed only by the router, and modification is required by all three i.e., the sender, receiver and the router.
4. Fairness criterion being used: It includes minimum potential delay, max – min, proportional and so on.

Two major components are required for preventing network congestive collapse:

1. End to end flow control mechanism: This mechanism has been designed such that it can respond well to the congestive collapse and thus behave accordingly.
2. Mechanism in routers: This mechanism is used for dropping or reordering packets under the condition of overload.

- For repeating the dropped information correct behavior of the end point is required. 

- This indeed slows down the information transmission rate. 

- If all the end points exhibit this kind of behavior, the congestion would be lifted from the network. 

- Also, all the end points would be able to share the available bandwidth fairly. - Slow start is another strategy using which it can be ensured that the router is not overwhelmed by the new connections before congestion can be detected.