Active Queue Management in RED Considering Critical Point on Target Queue

2021 ◽  
Vol 21 (03) ◽  
Author(s):  
Soamdeep Singha ◽  
Biswapati Jana ◽  
Niranjan Kumar Mandal

The basic philosophy behind RED is to prevent congestion. When the average queue length exceeds the minimum threshold, packets are randomly dropped, or the explicit congestion notification bit is marked. Since network requirements differ significantly, it is not an optimal approach to establish RED parameters with constant value. There is a new algorithm we are proposing called Critical Point on Target Queue (AQM-RED-CPTQ), provide greater congestion management over the network while also preserving the value of RED. To overcome the problem in RED without changing queue weight parameter, we have proposed few models to control the congestion by introducing range parameter with probability and control mechanism which will belong between minimum and maximum threshold. The current queue size is controlled together with average queue size. A new range variable has been introduced to improve the performance of priority queue of existing RED based algorithm which improves the overall performance of networks. For each packet, minimum and maximum threshold has been updated and dropped with probability (Pa) for a special condition. Instead of multiplicative increase and decrease the maximum probability, the scheme uses additive-increase and multiplicative-decrease. Once the AVG queue length is close to the minimum threshold value, our approach automatically sets queue parameter according to queue conditions and handles queuing delay and improve throughput. The simulated results proof that our approaches are better than RED in terms of throughput, end to end delay, packet delivery ratio and goodput.

2018 ◽  
Vol 19 (2) ◽  
pp. 80-89
Author(s):  
Rosminazuin Ab. Rahim ◽  
Abdallah Awad ◽  
Aisha Hassan Abdalla Hashim ◽  
ALIZA AINI MD RALIB

ABSTRACT: The current de-facto routing protocol over Low Power and Lossy Networks (LLN) developed by the IETF Working Group (6LOWPAN), is named as Routing Protocol for Low Power and Lossy networks (RPL). RPL in the network layer faces throughput  challenges due to the potential  large networks, number of nodes, and that  multiple  coexisting applications  will  be  running  in  the  same physical layer.  In this study, a node metric for RPL protocol based on the node’s Queue Backlogs is introduced, which leads to a better throughput performance while maintaining the delay and the ability to use with different network applications. This metric depends on the length of Packet Queue of the nodes with the consideration of other link and node metrics, like ETX or energy usage, leading to better load balancing in the network. To implement and evaluate the proposed metric compared to other RPL metrics, ContikiOS and COOJA simulator are used. Extensive simulations have been carried out in a systematic way resulting in a detailed analysis of the introduced metric namely W-metric, expected transmission count (ETX) and objective function zero (OF0) that uses hop-count as a routing metric. The analysis and comparison are based on five performance parameters, which are throughput, packet delivery ratio (PDR), latency, average queue length, and power consumption. Simulation results show that the introduced W-metric has a good performance compared to other RPL metrics with regards to performance parameters mentioned above. At the same time, the results show that its latency performance is comparable with other RPL routing metrics. In a sample simulation of 500 seconds with 25 nodes and with nodes sending packets periodically to the network root at a rate of 1 packet per 4 seconds, W-metric showed a very efficient throughput of 5.16 kbps, an increase of 8.2% compared to ETX. Results showed that it has a packet delivery ratio of 93.3%, which is higher compared to 83.3% for ETX and 74.2% for OF0. Average queue length of 0.48 packet shows improvement of 15.8% better than ETX. In addition, it exhibits an energy consumption of 5.16 mW which is 2.1% less than ETX. Overall, W-metric appears to be a promising alternative to ETX and OF0 as it selects routes that are more efficient by working on load balancing of the network and by considering the link characteristics. ABSTRAK: Protokol penghalaan de-facto semasa ke atas Rangkaian Kekuatan Rendah dan Lossy yang dibangunkan oleh Kumpulan Kerja IETF (6LOWPAN), dinamakan Protokol Penghalaan untuk Kekuatan Rendah dan Rugi (RPL). RPL dalam lapisan rangkaian menghadapi cabaran throughput berikutan jangkaan rangkaian besar, bilangan nod dan aplikasi berganda bersama akan diproses dalam lapisan fizikal yang sama. Dalam kajian ini, satu metrik nod untuk protokol RPL berdasarkan pada Backend Queue node diperkenalkan, yang membawa kepada prestasi yang lebih baik sambil mengekalkan kelewatan dan keupayaan untuk digunakan dengan aplikasi rangkaian yang berbeza. Metrik ini bergantung pada panjang Packet Queue dari node dengan pertimbangan metrik lain dan nodus lain, seperti ETX atau penggunaan tenaga, yang mengarah kepada keseimbangan beban yang lebih baik dalam rangkaian. Untuk melaksanakan dan menilai metrik yang dicadangkan berbanding metrik RPL lain, ContikiOS dan COOJA simulator telah digunakan. Simulasi meluas telah dijalankan dengan cara yang sistematik yang menghasilkan analisis terperinci mengenai metrik yang diperkenalkan iaitu W-metrik, kiraan penghantaran dijangkakan (ETX) dan fungsi objektif sifar (OF0) yang menggunakan kiraan hop sebagai metrik penghalaan. Analisis dan perbandingan adalah  berdasarkan lima parameter prestasi, iaitu throughput, nisbah penghantaran paket (PDR), latency, panjang panjang antrian, dan penggunaan kuasa. Hasil simulasi menunjukkan bahawa W-metrik yang diperkenalkan mempunyai prestasi yang lebih baik berbanding dengan metrik RPL lain berkaitan dengan parameter prestasi yang dinyatakan di atas. Pada masa yang sama, hasil menunjukkan bahawa prestasi latency W-metrik adalah setanding dengan metrik penghalaan RPL yang lain. Dalam simulasi sampel 500 saat dengan 25 nod dan dengan nod yang menghantar paket secara berkala ke akar rangkaian pada kadar 1 paket setiap 4 saat, W-metrik menunjukkan keluaran yang sangat efisien iaitu 5.16 kbps, peningkatan sebanyak 8.2% berbanding ETX. Keputusan menunjukkan bahawa ia mempunyai nisbah penghantaran paket 93.3%, yang lebih tinggi berbanding 83.3% untuk ETX dan 74.2% untuk OF0. Purata panjang giliran 0.48 packet menunjukkan peningkatan 15.8% lebih baik daripada ETX. Di samping itu, ia mempamerkan penggunaan tenaga sebanyak 5.16 mW iaitu 2.1% kurang daripada ETX. Secara keseluruhan, W-metrik nampaknya menjadi alternatif yang berpotensi menggantikan ETX dan OF0 kerana ia memilih laluan yang lebih cekap dengan bekerja pada keseimbangan beban rangkaian dan dengan mempertimbangkan ciri-ciri pautan.


2011 ◽  
Vol 403-408 ◽  
pp. 3946-3952
Author(s):  
K. Chitra ◽  
G. Padmavathi

Routers in Internet face the problem of congestion due to the increased use of Internet. AQM algorithm is a solution to the problem of congestion control in the Internet routers. As data traffic is bursty in routers, burstiness must be handled without comprising the high link utilization and low queuing delay. Congested link causes many problems such as large delay, unfairness among flows, underutilization of the link and packet drops in burst. There are various existing algorithms that have been evolved over the past few years to solve these problems of congestion in routers. RED based algorithms only use queue length as congestion indicator to indicate congestion. In this paper, we propose an AQM scheme that considers only the advantages of these queue length based and uses the flow information and satisfies the QOS requirements of the network. This proposed scheme aims to provide good service under unresponsive load and shields the responsive flows from unresponsive flows to offer a good QOS to all users.


2010 ◽  
Vol 2010 ◽  
pp. 1-14 ◽  
Author(s):  
Jianyong Chen ◽  
Cunying Hu ◽  
Zhen Ji

In order to achieve high throughput and low average delay in computer network, it is necessary to stabilize the queue length and avoid oscillation or chaos phenomenon. In this paper, based on Adaptive Random Early Detection (ARED), an improved algorithm is proposed, which dynamically changes the range of maximum drop probabilitypmaxaccording to different network scenarios and adjustspmaxto limit average queue sizeqavein a steady range. Moreover, exponential averaging weightwis adjusted based on linear stability condition to stabilizeqave. A number of simulations show that the improved ARED algorithm can effectively stabilize the queue length and perform better than other algorithms in terms of stability and chaos control.


2008 ◽  
Vol 18 (08) ◽  
pp. 2449-2459 ◽  
Author(s):  
J. H. C. NGA ◽  
H. H. C. IU ◽  
B. W. K. LING ◽  
H. K. LAM

This paper studies the bifurcation and chaos phenomena in average queue length in a developed Transmission Control Protocol (TCP) model with Random Early Detection (RED) mechanism. Bifurcation and chaos phenomena are nonlinear behavior in network systems that lead to degradation of the network performance. The TCP/RED model used is a model validated previously. In our study, only the average queue size [Formula: see text] is considered, and the results are based on analytical model rather than actual measurements. The instabilities in the model are studied numerically using the conventional nonlinear bifurcation analysis. Extending from this bifurcation analysis, a modified RED algorithm is derived to prevent the observed bifurcation and chaos regardless of the selected parameters. Our modification is for the simple scenario of a single RED router carrying only TCP traffic. The algorithm neither compromises the throughput nor the average queuing delay of the system.


Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 2077
Author(s):  
Mahmoud Baklizi

The current problem of packets generation and transformation around the world is router congestion, which then leads to a decline in the network performance in term of queuing delay (D) and packet loss (PL). The existing active queue management (AQM) algorithms do not optimize the network performance because these algorithms use static techniques for detecting and reacting to congestion at the router buffer. In this paper, a weight queue active queue management (WQDAQM) based on dynamic monitoring and reacting is proposed. Queue weight and the thresholds are dynamically adjusted based on the traffic load. WQDAQM controls the queue within the router buffer by stabilizing the queue weight between two thresholds dynamically. The WQDAQM algorithm is simulated and compared with the existing active queue management algorithms. The results reveal that the proposed method demonstrates better performance in terms mean queue length, D, PL, and dropping probability, compared to gentle random early detection (GRED), dynamic GRED, and stabilized dynamic GRED in both heavy or no-congestion cases. In detail, in a heavy congestion status, the proposed algorithm overperformed dynamic GRED (DGRED) by 13.3%, GRED by 19.2%, stabilized dynamic GRED (SDGRED) by 6.7% in term of mean queue length (mql). In terms of D in a heavy congestion status, the proposed algorithm overperformed DGRED by 13.3%, GRED by 19.3%, SDGRED by 6.3%. As for PL, the proposed algorithm overperformed DGRED by 15.5%, SDGRED by 19.8%, GRED by 86.3% in term of PL.


Author(s):  
Zeyad A. Karam

One of the most debated issues nowadays is the quality of computer network service. The best internet service must provide a fast processing of the traffic. Each router has a queue of packets that provides a buffer space, where the packets wait for processing. Transmission Control Protocol (TCP) is a packets congestion control theory. Active Queue Management (AQM) is a mechanisms proposed to employ at gateways to improve the performance of TCP congestion control. AQM mechanisms aim to provide high link utilization with low loss rate and low queuing delay while reacting to load changes quickly. Random Early Detection (RED) is an extensively studied AQM algorithm that can detect congestion by dropping packets randomly with certain probability that serves as the function of the average queue size. In this work, hybrids Fuzzy Logic Controllers (FLC) are proposed to measure the router queue size directly by use them as a congestion controllers. A multiple hybrid fuzzy controllers are proposed, where (Proportional Integral Derivative controller (PID) -like FLC-Particle Swarm Optimization (PSO) Based, Proportional Derivative (PD)-like FLC with conventional I-PSO Based and PID tuned by Fuzzy Logic-PSO Based), which is provided to regulate the queue length, round trip time and packet loss. The Particle Swarmed Optimization (PSO) algorithm is used for tuning the gains of hybrid fuzzy logic controller which helps in reducing the error of the queue size. This is achieved through minimizing the rise time, peak time, settling time and overshoot of the AQM response. The empirical results revealed a high-performance improvement regarding the proposed method in comparison to previous works of other researchers.


2015 ◽  
Vol 32 (06) ◽  
pp. 1550042 ◽  
Author(s):  
Ning Zhao ◽  
Zhaotong Lian ◽  
Kan Wu

In this paper, we study a MAP/PH/1 queue with two classes of customers and discretionary priority. There are two stages of service for the low-priority customer. The server adopts the preemptive priority discipline at the first stage and adopts the nonpreemptive priority discipline at the second stage. Such a queuing system can be modeled into a quasi-birth-and-death (QBD) process. But there is no general solution for this QBD process since the generator matrix has a block structure with an infinite number of blocks and each block has infinite dimensions. We present an approach to derive the bound for the high-priority queue length. It guarantees that the probabilities of ignored states are within a given error bound, so that the system can be modeled into a QBD process where the block elements of the generator matrix have finite dimensions. The sojourn time distributions of both high and low priority customers are obtained. Some managerial insights are given after comparing the discretionary priority rule with the preemptive and nonpreemptive disciplines numerically.


2017 ◽  
Vol 2 (11) ◽  
pp. 23-30 ◽  
Author(s):  
Uguta Henry Preye ◽  
Onyejegbu Laeticia Nneka

Network congestion is a major problem in all network environments as such it calls for ways to manage this problem. In this paper, we propose a Fuzzy Regulator Effective Random Early Detection (FRERED) system, which is an intelligent fuzzy logic based controller technique for early stage congestion detection, at the router buffer in the networks. The proposed technique extends the Fuzzy-Based system in the Fuzzy Hybrid ERED algorithm by considering the delay variable in its inference system to ease the problem of parameter initialization and parameter dependency. Unlike the Fuzzy-Based controller in the existing Fuzzy Hybrid ERED system which uses two parameter settings in its inference system that is, the queue size and average queue length in computing the dropping probability of packets. The proposed technique uses the queue size, average queue length and the delay approximation as input variables in computing the packet drop probability. The applied fuzzy logic system yields an output that denotes a packet dropping probability, which in turn controls and prevents congestion in early stage. This was achieved after simulating the proposed technique and the existing Fuzzy-Based controller using Matlab. The results obtained shows that this approach results in less packet drops for about the same link utilization as the existing Fuzzy-Based controller. Therefore, this technique, generally, controls network congestion and improves network performance. The methodology used to achieve this is the object oriented methodology and JAVA programming language was used to develop the system.


Sign in / Sign up

Export Citation Format

Share Document