scholarly journals Modeling and Performance Analysis of Dynamic Random Early Detection (DRED) Gateway for Congestion Avoidance

10.28945/2920 ◽  
2005 ◽  
Author(s):  
A. A. Akintola ◽  
G. A. Aderounmu ◽  
L. A. Akanbi ◽  
M. O. Adigun
Keyword(s):  
Performance Analysis ◽  
Early Detection ◽  
Early Response ◽  
Congestion Avoidance ◽  
The Internet ◽  
Random Early Detection ◽  
Queue Size ◽  
Global Synchronization ◽  
Improved Performance ◽  
And Performance

One of the most prominent congestion avoidance schemes in the Internet architecture is the Random Early Detection (RED) algorithm. Several modifications and enhancements have been made to the original RED so as to make it more responsive to congestion avoidance at the gateways. In this paper, we introduced the Dynamic Random Early Detection (DRED) model, which uses a newly introduced parameter i.e. warning line. A robust and efficacious technique to measure the burstiness of incoming traffic has been developed and tested. This involves the estimation of the average queue size, avg, which is dynamically adjusted hence the name of our scheme. The empirical results obtained from the simulations show that our DRED scheme responds early enough to the increased number of packets at the gateway. Also, the maximum drop probability of packets show improved performance over the original RED. It was concluded that our scheme demonstrated superiority by avoiding global synchronization and there is great reduction in the fluctuations of the actual queue size. Also, its early response avoids buffer overflow at the gateways when the queue is near full.

scholarly journals SYMBOLIC DYNAMICAL MODEL OF AVERAGE QUEUE SIZE OF RANDOM EARLY DETECTION ALGORITHM

2010 ◽  
Vol 20 (05) ◽  
pp. 1415-1437 ◽  
Author(s):  
CHARLOTTE YUK-FAN HO ◽  
BINGO WING-KUEN LING ◽  
HERBERT H. C. IU
Keyword(s):  
Fixed Point ◽  
Early Detection ◽  
Initial Conditions ◽  
Detection Algorithm ◽  
Dynamical Model ◽  
Random Early Detection ◽  
Queue Size ◽  
System Parameters ◽  
Internet Networks

In this paper, a symbolic dynamical model of the average queue size of the random early detection (RED) algorithm is proposed. The conditions for both the system parameters and the initial conditions that the average queue size of the RED algorithm would converge to a fixed point are derived. These results are useful for network engineers to design both the system parameters and the initial conditions so that internet networks can achieve a good performance.

scholarly journals Active Queue Management (AQM) Performance Analysis Based On Controled Delay (CoDel) Against Bufferbloat On Real-Time Aplication

2017 ◽  
Vol 2 (1) ◽  
pp. 119
Author(s):  
Muhammad Noer Iskandar
Keyword(s):  
Performance Analysis ◽  
Early Detection ◽  
Real Time ◽  
Video Streaming ◽  
Packet Loss ◽  
Active Queue Management ◽  
Queue Management ◽  
Random Early Detection

<span><em>Bufferbloat </em><span>merupakan salah satu kondisi buffer dengan ukuran besar yang cenderung<br /><span>selalu penuh dan menyebabkan antrian panjang didalam buffer, jika hal ini terjadi secara<br /><span>terus-menerus maka dapat menyebabkan jeda transmisi yang tinggi. <span><em>Bufferbloat </em><span>sering<br /><span>terjadi pada aplikasi berbasis real-time. <span><em>Active Queue Management </em><span>(AQM) merupakan<br /><span>salah satu cara untuk menangani terjadinya <span><em>bufferbloat., </em><span>AQM umumnya menggunakan<br /><span>algoritma Drop Tail untuk menangani kondisi antrian panjang dalam buffer router di<br /><span>jaringan. Namun demikian, performansi AQM berbasis Drop Tail kurang dapat<br /><span>diandalkan karena jeda transmisi dalam keadaan <span><em>bufferbloat </em><span>masih tinggi. Telah banyak<br /><span>studi dilakukan untuk menangani <span><em>bufferbloat</em><span>, seperti Drop Tail, Random Early Detection<br /><span>(RED) dan Controlled Delay (CoDel). Dari riset yang telah dilakukan tersebut masih sulit<br /><span>ditemukan performasi algoritma terbaik dalam menangani <span><em>bufferbloat</em><span>. Untuk hal tersebut,<br /><span>paper ini menyajikan studi performansi penanganan bufferbloat menggunakan ketiga<br /><span>algoritma diatas. Dalam studi ini, video streaming digunakan sebagai <span><em>traffic </em><span>uji untuk<br /><span>menentukan performansi algoritma terbaik dalam mengatasi <span><em>bufferbloat</em><span>. Sedangkan<br /><span>metriks uji yang digunakan dalam riset ini adalah <span><em>latency</em><span>, <span><em>throughput </em><span>dan <span><em>packet-loss</em><span>.<br /><span>Analisa hasil pengujian mengambil 3 hasil terbaik dalam setiap percobaan. Hasil<br /><span>pengujian menunjukan performansi algoritma CoDel jauh lebih baik dalam menangani<br /><span><em>latency </em><span>yang tinggi pada kondisi bufferbloat dibandingkan RED dan Drop Tail. Namun<br /><span>untuk <span><em>packet-loss </em><span>dan <span><em>throughput </em><span>performansi RED dan Drop Tail masih unggul<br /><span>dibanding algoritma CoDel</span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span><br /></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span>

A Framework to Enhance Security in Nemo Environment Using AAA Mechanisms

2018 ◽  
Vol 6 (8) ◽  
pp. 400
Author(s):  
Isac Gnanaraj J ◽  
Sriram .
Keyword(s):  
Performance Analysis ◽  
Task Force ◽  
Research Work ◽  
Mobile Network ◽  
Mobile Node ◽  
The Internet ◽  
Network Mobility ◽  
Emerging Trends ◽  
Mobile Router ◽  
And Performance

One of emerging trends in the mobile network era is Network Mobility (NEMO). It was standardized by the Internet Engineering Task Force (IETF) and gained attention of the researchers because of research opportunities that it provides. Though it was developed based on MIPv6, there are few spots that must be analyzed and rectified, especially in the security aspects. According to the literatures, NEMO lacks in providing a robust Authentication, Authorization and Accounting (AAA) services to its users. AAA operations must be performed for all the players of the mobile network, because a hacker may reside at any place and try to access the mobile network by hiding behind valid or genuine nodes’ addresses. This research work aims to provide an AAA framework for NEMO by comprising three different mechanisms which are developed for Local Mobile Node (LMN), Visiting Mobile Node (VMN) and Mobile Router (MR). Simulation and performance analysis are done.

scholarly journals An Improved ARED Algorithm for Congestion Control of Network Transmission

2010 ◽  
Vol 2010 ◽  
pp. 1-14 ◽  
Author(s):  
Jianyong Chen ◽  
Cunying Hu ◽  
Zhen Ji
Keyword(s):  
Early Detection ◽  
Stability Condition ◽  
Queue Length ◽  
Chaos Control ◽  
Computer Network ◽  
Random Early Detection ◽  
Queue Size ◽  
Average Delay ◽  
Network Transmission ◽  
Better Than

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.

scholarly journals Internet congestion control: From stochastic to dynamical models

2021 ◽  
pp. 2140009
Author(s):  
José M. Amigó ◽  
Angel Giménez ◽  
Oscar Martínez-Bonastre ◽  
José Valero
Keyword(s):  
Early Detection ◽  
Global Stability ◽  
Nonlinear Models ◽  
The Internet ◽  
Random Early Detection ◽  
Data Traffic ◽  
Data Packets ◽  
Complex Processes ◽  
Management Algorithm ◽  
Stability Robustness

Since its inception, control of data congestion on the Internet has been based on stochastic models. One of the first such models was Random Early Detection. Later, this model was reformulated as a dynamical system, with the average queue sizes at a router’s buffer being the states. Recently, the dynamical model has been generalized to improve global stability. In this paper we review the original stochastic model and both nonlinear models of Random Early Detection with a two-fold objective: (i) illustrate how a random model can be “smoothed out” to a deterministic one through data aggregation and (ii) how this translation can shed light into complex processes such as the Internet data traffic. Furthermore, this paper contains new materials concerning the occurrence of chaos, bifurcation diagrams, Lyapunov exponents and global stability robustness with respect to control parameters. The results reviewed and reported here are expected to help design an active queue management algorithm in real conditions, that is, when system parameters such as the number of users and the round-trip time of the data packets change over time. The topic also illustrates the much-needed synergy of a theoretical approach, practical intuition and numerical simulations in engineering.

scholarly journals Proposal of Study on Performance Analysis of OSPFV3 and EIGRP Applications in IPV6

2021 ◽  
pp. 14-24
Author(s):  
Richard Essah ◽  
Darpan Anand
Keyword(s):  
Remote Sensing ◽  
Performance Analysis ◽  
Computer Networks ◽  
Routing Protocols ◽  
The Internet ◽  
Internet Protocols ◽  
Sensitive Areas ◽  
Ipv6 Network ◽  
The Difference ◽  
And Performance

The internet protocols are increasingly imposed in recent times, there is a need to propose a study on the performance analysis on OSPFV3 and EIGRP in IPV6 application. IP is currently involved in sensitive areas of internet protocols, remote sensing, telepresence, computer networks and so on. The IP exists in two versions (IPv4 and IPv6), the difference between these two protocols is distinguished in terms of features, operation, and performance. In this study, measuring and evaluation on the performance of the two IPv4 and IPv6 protocols in the networks of communicating companies are proposed for further studies based on the literature gaps identified. The study should be performed by varying the routing protocols RIP, RIPnG, OSPF, OSPFv3, IS-IS and ISIS v6. Further studies should conduct simulation on performance analysis of OSPFV3 and EIGRP in IPV6 applications. The gaps identified after reviewing a number of literature on OSPFV3 and EIGRP with IPV6 network needs to be done since it sought to bridge gaps in literature.

Sign in / Sign up

Export Citation Format

Share Document