Displaying similar documents to “A RED modified weighted moving average for soft real-time application”

Transparent Scheduling of Composite Web Services

Dyachuk, Dmytro, Deters, Ralph (2007)

Serdica Journal of Computing

Similarity:

Composite Web Services (CWS) aggregate multiple Web Services in one logical unit to accomplish a complex task (e.g. business process). This aggregation is achieved by defining a workflow that orchestrates the underlying Web Services in a manner consistent with the desired functionality. Since CWS can aggregate atomic and other CWS they foster the development of service layers and reuse of already existing functionality. An important issue in the deployment of services is their run-time...

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

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

Study of Queuing Systems with a Generalized Departure Process

Mirtchev, Seferin, Statev, Stanimir (2008)

Serdica Journal of Computing

Similarity:

This work was supported by the Bulgarian National Science Fund under grant BY-TH-105/2005. This paper deals with a full accessibility loss system and a single server delay system with a Poisson arrival process and state dependent exponentially distributed service time. We use the generalized service flow with nonlinear state dependence mean service time. The idea is based on the analytical continuation of the Binomial distribution and the classic M/M/n/0 and M/M/1/k system....

Allocating servers to facilities, when demand is elastic to travel and waiting times

Vladimir Marianov, Miguel Rios, Francisco Javier Barros (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers’ travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel...