Displaying similar documents to “Stability of queueing networks.”

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

Similarity:

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

Computer Networks Security Models - A New Approach for Denial-of-Services Attacks Mitigation

Tsvetanov, Tsvetomir (2010)

Serdica Journal of Computing

Similarity:

Computer networks are a critical factor for the performance of a modern company. Managing networks is as important as managing any other aspect of the company’s performance and security. There are many tools and appliances for monitoring the traffic and analyzing the network flow security. They use different approaches and rely on a variety of characteristics of the network flows. Network researchers are still working on a common approach for security baselining that might enable early...

On the queue-size distribution in the multi-server system with bounded capacity and packet dropping

Oleg Tikhonenko, Wojciech M. Kempa (2013)

Kybernetika

Similarity:

A multi-server M / M / n -type queueing system with a bounded total volume and finite queue size is considered. An AQM algorithm with the “accepting” function is being used to control the arrival process of incoming packets. The stationary queue-size distribution and the loss probability are derived. Numerical examples illustrating theoretical results are attached as well.

Standard and retrial queueing systems: a comparative analysis.

Jesús Artalejo, Gennadi Falin (2002)

Revista Matemática Complutense

Similarity:

We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues with waiting line and queues with losses. We give a survey of main results for both single server...