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

We consider a model of two M/M/1 queues, served by a single server. The service policy for this polling model is of threshold type: the server serves queue 1 exhaustively, and does not remain at an empty queue if the other one is non-empty. It switches from queue 2 to queue 1 when the size of the latter queue reaches some level T , either preemptively or non-preemptively. All switches are insta...

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

 This paper deals with batch arrival unreliable queue with two phases of service and vacation under Bernoulli vacation schedule, which consist of a breakdown period and a delay period. For this model, we first derive the joint distribution of state of the server and queue size, which is one of the chief objectives of this paper. Secondly, we derive the pgf of the stationary queue size distribu...

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

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

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