Congestion is a major problem in all types of network. Now a day’s large amount of data transmission takes place every day that leads to congestion. To increase capacity of the network is not a solution. One solution for the successful data transmission can be based on the current available capacity of the network. This paper explains two algorithms which ensure that, the available queue length of all the nodes are known to each other. So based on the availability of queue space the data transmission can be done. RTT (Round Trip Time) plays a major role in understanding the current congestion status of the network. RTT helps the proposed algorithm to understand the network status and then to forward the queue length availability to all other nodes in the network. The aim of this paper is that, the queue lengths of all the nodes are known to all other nodes. The data transmission is done only when the destination node and the intermediate node have enough queue length.

Full text: IJEIR-373 Final.pdf