This paper introduces the procedure for an analytical derivation of the drop probability function for the Random Early Detection queue management mechanism. The procedure is based on a model of the TCP window system and the establishment for a criterion for system stability with methods of control theory. The term stability refers to the oscillation amplitude of the steady state queue size. The...

In this paper we give a fairly complete survey of the available results on the control of arrival and service rates for both single queue and networks of queues. We also study two M/M/l queues in series. At the first queue, the arrival and the service rates are chosen in pair from a finite set whenever the queue lengths at both queues change. Each choice has a switching cost depending on the ch...

We study a network of fluid queues in which exogenous arrivals are modulated by a continuous-timeMarkov chain. Service rates in each queue are proportional to the queue size, and the network is assumed to be irreducible. Thequeue levels satisfy a linear, vectorvalued differential equation. We obtain joint moments of the queue sizes recursively, and deduce the Laplace transform of the queue size...

In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the most kn + O(k logn) parallel communication steps, with a constant queue size of O(k). The previous best known algorithm [3] takes 5 4kn + O( kn f(n) ) steps with a queue size of O(k f(n)) (for any 1 ≤ f(n) ≤ n). We will also...

We examine an M/G/1 queue with several queueing disciplines. After reviewing some background material in probability theory, we consider a first-come first-served queue. Next, we examine an absolute priority queue, where high priority customers are always selected for service over lower priority customers, regardless of how long the latter have been waiting. We also review a method for calculat...

Adaptive RED (ARED) is an active queue management (AQM) designed for congestion responsive traffics such as TCP. ARED aims to keep average queue length around a predefined queue length. If so, average delay will be offered to Internet users and simultaneously high link utilization will be achieved. However, ARED algorithm merely makes the average queue length loosely converge to the target leng...

The Internet routers employing the random early detection (RED) algorithm for congestion control suffer from the problem of chaotic queue oscillation. It is well known that the slowly varying nature of the average queue size computed using an exponentially weighted moving average (EWMA) used in the RED scheme causes this chaotic behavior. This paper presents a new mathematical function to model...

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