AQM Algorithm with Adaptive Reference Queue Threshold for Communication Networks

Zhenyu Na, Bao Peng, Liming Chen

Abstract


Nowadays, congestion in communication networks has been more intractable than ever before due to the explosive growth of network scale and multimedia traffic. Active queue management (AQM) algorithms had been proposed to alleviate congestion to improve quality of service (QoS), but existing algorithms often suffer from some flaws in one aspect or another. In this paper, a novel AQM algorithm with adaptive reference queue threshold (ARTAQM) is proposed of which the main innovative contributions are recounted as follows. First, traffic is predicted to calculate the packet loss ratio (PLR) and the traffic rate based on traffic prediction algorithm. Second, by means of periodical measurements, a weighted PLR is obtained to dynamically adjust packet dropping probability in ARTAQM algorithm. Third, ARTAQM algorithm runs in both coarse and fine granularities. In coarse granularity, the mismatch of the predicted traffic rate and link capacity can adjusts the reference queue length in every period, while in fine granularity, reference queue remains fixed and the  instantaneous queue is adjusted packet by packet in one period. Simulation results indicate that ARTAQM algorithm not only maintains stable queue and fast response speed, but has lower PLR and higher link utilization as well.

 

DOI: http://dx.doi.org/10.11591/telkomnika.v10i5.1274 


Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics