A demonstration of the FN packet marking probability
The effectiveness of queue management mechanisms relies on how good their control decisions will help in satisfying their goals regarding congestion avoidance and control.These decisions are implemented and compelled during the design of the packet mark probability and the mark activation functions...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/2139/1/A_Demonstration_of_the_FN_Packet_Marking.pdf |
| _version_ | 1825739921367760896 |
|---|---|
| author | M. Kadhum, Mohammed Hassan, Suhaidi |
| author_facet | M. Kadhum, Mohammed Hassan, Suhaidi |
| author_sort | M. Kadhum, Mohammed |
| collection | UUM |
| description | The effectiveness of queue management mechanisms
relies on how good their control decisions will help in satisfying their goals regarding congestion avoidance and control.These decisions are implemented and compelled during the design of the packet mark probability and the mark activation functions. The design of Fast Congestion Notification (FN) drop/mark probability function enables the two control decisions, packet admissions and congestion control directing, to be made along with each other. This permits sending congestion avoidance notification as early as required even if the queue is almost empty, and preventing congestion notification even if the queue is
almost full but the arrival rate is controllable. This leads to good buffer utilization and proper congestion detection. This paper demonstrates the drop/mark probability functions that the fast FN policy would exercise for different values of optimal queue size, and also for a specific optimal queue size value. |
| first_indexed | 2024-07-04T05:18:07Z |
| format | Conference or Workshop Item |
| id | uum-2139 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T05:18:07Z |
| publishDate | 2009 |
| record_format | eprints |
| spelling | uum-21392011-02-16T09:34:11Z https://repo.uum.edu.my/id/eprint/2139/ A demonstration of the FN packet marking probability M. Kadhum, Mohammed Hassan, Suhaidi QA76 Computer software The effectiveness of queue management mechanisms relies on how good their control decisions will help in satisfying their goals regarding congestion avoidance and control.These decisions are implemented and compelled during the design of the packet mark probability and the mark activation functions. The design of Fast Congestion Notification (FN) drop/mark probability function enables the two control decisions, packet admissions and congestion control directing, to be made along with each other. This permits sending congestion avoidance notification as early as required even if the queue is almost empty, and preventing congestion notification even if the queue is almost full but the arrival rate is controllable. This leads to good buffer utilization and proper congestion detection. This paper demonstrates the drop/mark probability functions that the fast FN policy would exercise for different values of optimal queue size, and also for a specific optimal queue size value. 2009 Conference or Workshop Item PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/2139/1/A_Demonstration_of_the_FN_Packet_Marking.pdf M. Kadhum, Mohammed and Hassan, Suhaidi (2009) A demonstration of the FN packet marking probability. In: Communications and Information Technology 2009 (ISCIT 2009), 28-30 September 2009 , Icheon, South Korea. http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=05341027 |
| spellingShingle | QA76 Computer software M. Kadhum, Mohammed Hassan, Suhaidi A demonstration of the FN packet marking probability |
| title | A demonstration of the FN packet marking probability |
| title_full | A demonstration of the FN packet marking probability |
| title_fullStr | A demonstration of the FN packet marking probability |
| title_full_unstemmed | A demonstration of the FN packet marking probability |
| title_short | A demonstration of the FN packet marking probability |
| title_sort | demonstration of the fn packet marking probability |
| topic | QA76 Computer software |
| url | https://repo.uum.edu.my/id/eprint/2139/1/A_Demonstration_of_the_FN_Packet_Marking.pdf |
| work_keys_str_mv | AT mkadhummohammed ademonstrationofthefnpacketmarkingprobability AT hassansuhaidi ademonstrationofthefnpacketmarkingprobability AT mkadhummohammed demonstrationofthefnpacketmarkingprobability AT hassansuhaidi demonstrationofthefnpacketmarkingprobability |