The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1 Next

Displaying 1 – 20 of 45

Showing per page

On a discrete modified M / G I / c / queue

Anatolij Dvurečenskij (1987)

Aplikace matematiky

The busy period distribution of a discrete modified queue M / G I / c / , with finitely or infinitely many severs , and with different distribution functions of customer service times is derived.

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

Arun Borthakur, Ruby Gohain (1982)

Aplikace matematiky

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

On main characteristics of the M / M / 1 / N queue with single and batch arrivals and the queue size controlled by AQM algorithms

Wojciech M. Kempa (2011)

Kybernetika

In the article finite-buffer queueing systems of the M / M / 1 / N type with queue size controlled by AQM algorithms are considered, separately for single and batch arrivals. In the latter case two different acceptance strategies: WBAS (Whole Batch Acceptance Strategy) and PBAS (Partial Batch Acceptance Strategy) are distinguished. Three essential characteristics of the system are investigated: the stationary queue-size distribution, the number of consecutively dropped packets (batches of packets) and the time...

Currently displaying 1 – 20 of 45

Page 1 Next