Displaying similar documents to “The use of a non-integer order PI controller with an active queue management mechanism”

On a non-Markovian queueing problem under a control operating policy and start-up times

Arun Borthakur, Ruby Gohain (1982)

Aplikace matematiky

Similarity:

A non-Markovian queueing system with Poisson input is studied under a modified operating rule called “control operating policy” in which the server begins “start-up” only when the queue length reaches a fixed number n ( ≥ 1 ) . By using the supplementary variable technique, the distribution of the queue length (excluding those being served) in the form of a generating function is obtained. As a special case, a Markovian queueing system with exponential start-up is discussed in detail to analyse...

Analyzing discrete-time bulk-service queue

Veena Goswami, Umesh C. Gupta, Sujit K. Samanta (2006)

RAIRO - Operations Research

Similarity:

This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time...

Aspects of Impatience in a Finite Buffer Queue

Medhi Pallabi, Amit Choudhury (2012)

RAIRO - Operations Research

Similarity:

In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed ...

Analysis of AQM queues with queue size based packet dropping

Andrzej Chydziński, Łukasz Chróst (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical...

Fluid limits for the queue length of jobs in multiserver open queueing networks

Saulius Minkevičius (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The object of this research in the queueing theory is a theorem about the Strong-Law-of-Large-Numbers (SLLN) under the conditions of heavy traffic in a multiserver open queueing network. SLLN is known as a fluid limit or fluid approximation. In this work, we prove that the long-term average rate of growth of the queue length process of a multiserver open queueing network under heavy traffic strongly converges to a particular vector of rates. SLLN is proved for the values of an important...

Aspects of Impatience in a Finite Buffer Queue

Medhi Pallabi, Amit Choudhury (2012)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions of a number of performance measures...