To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Packet-loss probability versus queue nodes capacities in dynamic random early drop algorithm |
|
Author |
Jafar Ababneh |
| Citation |
Vol. 20 No. 6 pp. 119-124 |
|
Abstract |
This This paper comprises an exploration of the significance of alterations to queue node packet capacity in terms of congestion algorithm functioning. In respect of both the management and forecasting of congestion and the selection of the ideal packet number, the dynamic random early drop (DRED) algorithm plays a critical role. In order to perform an evaluation of the impact of diverse packet capacities, a packet-loss probability (Ploss,j ) performance measurement was conducted. In addition, the tractability and efficacy of different queue node capacities were also investigated. Subsequently, a comparative analysis was made of these diverse capacities in order to appraise performance levels. This analysis revealed that the performance of the third queue node surpassed the second in terms of its effectiveness, whereas the second queue outclassed the first node when an equivalent metric was applied. |
|
Keywords |
Packet-loss probability, congestion control, DRED, network management and control, packet capacities, queuing network. |
|
URL |
