A quantitative analysis and performance study of fast congestion notification (FN) mechanism
Congestion in computer network happens when the number of transmission requests exceeds the transmission capacity at a certain network point (called a bottle-neck resource) at a specific time. Congestion usually causes buffers overflow and packets loss. The purpose of congestion management is to mai...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book Section |
| Language: | English |
| Published: |
IEEE Computer Society
2009
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/2141/1/A_Quantitative_Analysis_and_Performance_Study_of.pdf http://repo.uum.edu.my/2141/ http://ieeexplore.ieee.org/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Congestion in computer network happens when the number of transmission requests exceeds the transmission capacity at a certain network point (called a bottle-neck resource) at a specific time. Congestion usually causes buffers overflow and packets loss. The purpose of congestion management is to maintain a balance between the transmission requests and the transmission capacity so that the bottle-neck resources operate on an optimal level, and the sources are offered service in a way that assures fairness. Fast Congestion
Notification (FN) is one of the proactive queue management
mechanisms that limits the queuing delay and achieves the
maximum link utilization possible with minimum packet drops.
In this paper we present a detailed performance comparison of the Linear FN algorithm to RED based on the results obtained through simulations. The paper shows how FN can be tuned for different window size (Ws) and periods of time constant (T) to achieve higher link utilization; reduce the queuing delay, and lower packet drop ratio. |
|---|