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

The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. This paper shows that this protocol is only marginally stable: once a queue is congested, then its queue size will eventually decrease. However, if a queue is not congested, its queue size can actually increase and a congestion can be self-induc...

We discuss how long range dependence can innuence the characteristics of a single server queue. We take the analogue of the G/M/1 queue except that the input stream is altered to exhibit long range dependence. The equilibrium queue size and equilibrium waiting time distributions each have heavy tails. By suitably selecting the parameters of the inputs, the queue size or waiting time can be made...

In this paper we examine a tandem network of queueing nodes where a nonstationary external Markovian arrival process feeds the initial upstream node. We develop methods for modeling the departure flow from any upstream node in its role as the arrival process to the immediate downstream node, and employ various techniques to match the interarrival moments to the downstream node to the moments of...

The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. Even though the EPRCA has been adopted by the ATM forum as the standard for ABR congestion control, we show that this protocol is only marginally stable. The stability analysis presented in this paper does not consider interactions among network...

Several Active Queue Management (AQM) techniques for routers in the Internet have been proposed and studied during the past few years. One of the widely studied proposals, Random Early Detection (RED), involves dropping an incoming packet with some probability based on the estimated average queue length at the router. The analytical approaches to obtaining average drop probabilities in a RED en...

We consider both a cooperative as well as non-cooperative admission into an M/M/1 queue. The only information available is a signal that sais whether the queue size is smaller than some L or not. We first compute the globally optimal and the Nash equilibrium stationary policy as a function of L. We compare the performance to that of full information on the queue size. We identify the L that opt...

in this paper, a state feedback h¥ controller is proposed in order to design an active queue management (aqm) system based on congestion control algorithm for networks supporting tcp protocols. in this approach, the available link bandwidth is modeled as a time-variant disturbance. the purpose of this paper is to design a controller which is capable of achieving the queue size and can guarantee...

A model of a switching component in a packet switching network is considered. Packets from several incoming channels arrive and must be routed to the appropriate outgoing port according to a service policy. A task confronting the designer of such a system is the selection of policy and the determination of the corresponding input buuer requirements which will prevent packet loss. One natural ch...