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 study channel sharing in an integrated cellular voice/data network with a finite queue for data call requests that cannot be served immediately upon arrival. Using analytical techniques, a comparison of different fair channel sharing policies is made. As a main result, a closed-form expression is derived for the expected sojourn time (waiting time plus transfer time) of a data call, conditio...

– When we speak about the buffer overflow period we mean the time interval in which the queue size is equal to the capacity of the buffer. Thus packets or cells arriving during this period are lost. The distribution of the length of this interval is recently gaining attention as a very informative characteristic of the queueing performance. In this paper the numerous results related to the dist...

This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The server process is a single server deterministic queue. A closed form exact solution is given for the expected queue length and delay. A simple system of equ...

We study a double-sided queue with batch arrivals and abandonment. There are two types of customers, patient ones who queue but may later abandon, and impatient ones who depart immediately if their order is not filled. The system matches units from opposite sides of the queue based on a first-come first-served policy. The model is particularly applicable to a class of alternative trading system...

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

The probabilistic structure for the transient M/E,/2 queue is derived in discrete time, where El, denotes a k-Erlangdistribution. This queue has a twodimensional state-space. Expressions for the expected delay in queue are formulated in terms oftransition probabilities. Results are numerically evaluated for a few cases. The convergence behavior is similar to that seen in previous work on queues...

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

In this paper, we studied multi-server queue with Poisson arrivals, general service time distribution, and deterministic reneging times. This work was motivated by the timeout mechanism used in managing application servers in transaction processing environments. In such systems, a customer who stays in the queue longer than the timeout period is lost. We proposed a scaling approach, and a fast ...