Comparative Study On Various Congestion Avoidance Algorithms
| dc.contributor.author | Abubakar, S | |
| dc.contributor.author | Bharath, A. C | |
| dc.contributor.author | Jayaprakash, B.R | |
| dc.contributor.author | Nandan, Acharya | |
| dc.date.accessioned | 2015-12-17T11:36:08Z | |
| dc.date.available | 2015-12-17T11:36:08Z | |
| dc.date.issued | 2015-12-17T11:36:08Z | |
| dc.description.abstract | Congestion is an important issue that can arise in packet switched network. Congestion is a situation in Communication Networks in which too many packets are present in a part of the subnet, performance degrades. Congestion in a network may occur when the load on the network (i.e. the number of packets sent to the network) is greater than the capacity of the network (i.e. the number of packets a network can handle.)In other words when too much traffic is offered, congestion sets in and performance degrades sharply. In this project we have done comparative study on various congestion avoidance algorithms, where congestion can be controlled by avoiding that to happen in the network. The parameters we considered for analysing the algorithms are efficiency, packet drop rate, throughput ,average queue size and delay. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/5384 | |
| dc.language.iso | en | en_US |
| dc.subject | Comparative Study On Various Congestion Avoidance Algorithms | en_US |
| dc.subject | Abubakar S | en_US |
| dc.subject | Bharath A.C | en_US |
| dc.subject | Jayaprakash | en_US |
| dc.subject | Nandan Acharya | en_US |
| dc.title | Comparative Study On Various Congestion Avoidance Algorithms | en_US |
| dc.type | Thesis | en_US |