Abstract— Recently TCP/RED networks are shown to exhibit a rich set of nonlinear behaviors, leading to instabilities. In order to address some of these issues Floyd et al. have proposed an adaptive version of RED, named ARED. In this paper we analytically demonstrate that ARED has some desirable properties compared to RED. First, we show that the stability of the ARED does not depend on the net...

In this paper we compare the three Active Queue Managements (AQMs) Adaptive Random Early Detection (ARED), Controlled Delay (CoDel) and Proportional Integral controller Enhanced (PIE) in static as well as dynamic scenarios. We find significant issues when these algorithms are used for big Round Trip Times (RTTs) as well as a significant utilization decrease when used for high bandwidth links. W...

In this paper, we systematically study the stability of a class of generalized Additive Increase and Multiplicative Decrease/Random Early Detection (AIMD/RED) system. Sufficient conditions are obtained for asymptotic stability of both homogeneous-flow system and heterogeneous-flow system with or without feedback delay by using indirect Lyapunov and Lyapunov–Razumikhin method. Our study reveals ...

The Random early detection (RED) active queue management (AQM) scheme uses the average queue size to calculate the dropping probability in terms of minimum and maximum thresholds. The effect of heavy load enhances the frequency of crossing the maximum threshold value resulting in frequent dropping of the packets. An adaptive queue management with random dropping (AQMRD) algorithm is proposed wh...

Random Early Detection (RED) has been introduced as a congestion avoidance algorithm for the Internet. RED detects congestion by estimating the average queue size. It drops packets probabilistically before buuer overrow, with the drop probability depending on the average queue size. In this paper, we analyse the innuence of RED on the packet loss ratio and the throughput of a system consisting ...

Several objectives have been identified in developing the random early drop (RED): decreasing queueing delay, increasing throughput, and increasing fairness between short and long lived connections. It has been believed that indeed the drop probability of a packet in RED does not depend on the size of the file to which it belongs. In this paper we study the fairness properties of RED where fair...

Cuvinte cheie. Managementul cozilor de aşteptare, filtru median, probabilitate de rejectare, întârziere. Rezumat. Articolul evaluază performanţele unui algoritm RED (random early detection) modificat care utilizează un filtru median în locul unui filtru liniar pentru calculul probabilităţii de rejectare a pachetelor. Simulările ilustrează faptul că performanţa reţelei creşte prin utilizarea fil...

We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are used. We studied the two RED variants described in [4] and point out a weakness in both. The first variant where the drop probability is independent from the packet size discriminates connections with smaller MTUs. The...

how to cite this article: karimzadeh p. approach to neurometabolic diseases from a pediatric neurological point of view. iran j child neurol. 2015 winter;9(1): 1-16.   abstract objective neurometabolic disorders are an important group of diseases that mostly are presented in newborns and infants. neurological manifestations are the prominent signs and symptoms in this group of diseases. seizure...

how to cite this article: karimzadeh p, jafari n, alai mr, jabbehdari s, ahmad abadi f, nejadbiglari h. homocystinuria: diagnosis and neuroimaging findings - of iranian pediatric patients. iran j child neurol. 2015 winter;9(1):94-98. abstract objective homocystinuria is a neurometabolic diseases characterized by symptoms include neurodevelopmental delay, lens dislocation, long limbs and thrombo...