Displaying similar documents to “Queueing system with merging of two input streams”

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

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

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