%0 Journal Article %1 hope2014priority %D 2014 %E Hope, Dr.Martin %J Int. J. on Recent Trends in Engineering and Technology, %K Cloud Computing_ Erlang K-phases _Distribution_ for_ %N 1 %P 10 %T Priority based K-Erlang Distribution Method in Cloud Computing %U http://searchdl.org/public/journals/2014/IJRTET/10/1/1289.pdf %V 10 %X 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.

@article{hope2014priority, abstract = {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.}, added-at = {2014-02-01T08:05:25.000+0100}, biburl = {https://www.bibsonomy.org/bibtex/2006228ec8180a2a17a13a5a90c0c857b/idescitation}, editor = {Hope, Dr.Martin}, interhash = {a0a0af6dfb002b64e34e31fc70fb1ac4}, intrahash = {006228ec8180a2a17a13a5a90c0c857b}, journal = {Int. J. on Recent Trends in Engineering and Technology,}, keywords = {Cloud Computing_ Erlang K-phases _Distribution_ for_}, month = {Jan 2014}, number = 1, pages = 10, timestamp = {2014-02-01T08:05:25.000+0100}, title = {Priority based K-Erlang Distribution Method in Cloud Computing}, url = {http://searchdl.org/public/journals/2014/IJRTET/10/1/1289.pdf}, volume = 10, year = 2014 }