This work documents the implementation of the BLUE Active Queue Management algorithm for the Linux Operating System and its evaluation by measurements. The issues of Active Queue Management (AQM), and the search for the most adequate AQM algorithms are important in these days because of the changing traffic dynamics – mostly congestion – on the Internet, and the rising quality expectations held...

Based on optimal theory, Kelly model realizes the bandwidth allocation on network with proportional fairness and has asymptotical stability. However, the primal algorithm of Kelly model leads to the packet accumulation in the queue of the bottleneck link. By using heuristic fuzzy rules, this paper designs a fuzzy controller to adjust the additive increase parameter of the primal algorithm dynam...

The queue length and the load rate should be monitored to overcome problem of router congestion due increase in network utilization achieve a high-speed transmission. Previous active management methods manage queued packets buffer maintain high performance. However, these depend on monitoring indicators that do not cover all signs, leading packet loss delay. Accordingly, signs wrapped into mana...

In this paper, we study the performance of service systems with priority upgrades. We model the service system as a single-server two-class priority queue, with queue 1 as the normal queue and queue 2 as the priority queue. The queueing model of interest has various applications in healthcare services, perishable inventory and project management. We comprehensively examine the system’s stationa...

The focus of this work is to study the behaviors of varies queue managements, including RED (Random Early Detection), SRED (Stabilized-RED), and BLUE. The performance metrics of the comparison are queue size, the drop probability, and link utilization. The simulation is done using NS-2. The results of this work shows that different from the RED, SRED and BLUE, which use the available queue leng...

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...

This paper presents a new active queue management scheme, Fuzzy Explicit Marking (FEM), implemented within the differentiated services (Diff-Serv) framework to provide congestion control using a fuzzy logic control approach. Network congestion control remains a critical and high priority issue. The rapid growth of the Internet and increased demand to use the Internet for timesensitive voice and...

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

In a potentially congested network, random early detection (RED) active queue management (AQM) proved effective in improving throughput and average queuing delay. The main disadvantage of RED is its sensitive parameters that are impossible to estimate perfectly and adjust manually because of the dynamic nature of the network. For this reason, RED performs differently during different phases of ...