Аннотация
In this paper, we have proposed a priority based service time distribution
method using Erlang Distribution for K-phases. The process of entering into the cloud is
typically based on the priority of the service and form a queue. Each user needs to wait until
the current user is being served if priority of the service is same, as per the First Come First
Served policy. If the server is busy, then the user request has to be waited in the queue until
the current user receives the result of the prescribed tasks. We have considered a priority
class refers to a collection of all customers having the same priority. We introduce M/EK/1
model for a priority based single server and M/EK /2 model for priority based two servers in
each class in cloud computing scenario to reduce overall mean queue length and waiting
time. We have considered a single server and two server retrial queueing systems in which
We considered a single server and
two server queues with three classes of customers.
Пользователи данного ресурса
Пожалуйста,
войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)