Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
A Retrieval Queueing Model With Feedback, Agassi Melikov, Srinivas Chakravarthy, Sevinc Aliyeva
A Retrieval Queueing Model With Feedback, Agassi Melikov, Srinivas Chakravarthy, Sevinc Aliyeva
Industrial & Manufacturing Engineering Publications
A multi-server retrial queuing model with feedback is considered in this paper.Input flow of calls is modeled using a Markovian Arrival Process (M AP) and the service time is assumed to follow an exponential distribution. An arriving call enters into service should there be a free server. Otherwise, in accordance to Bernoulli trials, the call will enter into an infinite orbit (referred to as a retrial orbit) to retry along with other calls to get into service or will leave the system forever. After obtaining a service each call, independent of the others, will either enter into a finite orbit …
A Retrial Queueing Model With Thresholds And Phase Type Retrial Times, Srinivas R. Chakravarthy
A Retrial Queueing Model With Thresholds And Phase Type Retrial Times, Srinivas R. Chakravarthy
Industrial & Manufacturing Engineering Publications
There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use …
Efficient Redundancy Techniques In Cloud And Desktop Grid Systems Using Map/G/C-Type Queues, Srinivas R. Chakravarthy, Alexander Rumyantsev
Efficient Redundancy Techniques In Cloud And Desktop Grid Systems Using Map/G/C-Type Queues, Srinivas R. Chakravarthy, Alexander Rumyantsev
Industrial & Manufacturing Engineering Publications
Cloud computing is continuing to prove its flexibility and versatility in helping industries and businesses as well as academia as a way of providing needed computing capacity. As an important alternative to cloud computing, desktop grids allow to utilize the idle computer resources of an enterprise/community by means of distributed computing system, providing a more secure and controllable environment with lower operational expenses. Further, both cloud computing and desktop grids are meant to optimize limited resources and at the same time to decrease the expected latency for users. The crucial parameter for optimization both in cloud computing and in desktop …
Map/Ph/1 Queueing Model With Working Vacation And Crowdsourcing, Srinivas R. Chakravarthy, Serife Ozkar
Map/Ph/1 Queueing Model With Working Vacation And Crowdsourcing, Srinivas R. Chakravarthy, Serife Ozkar
Industrial & Manufacturing Engineering Publications
Crowdsourcing has been used in different domains such as healthcare, computer science, environmental sciences, business and marketing. However, only recently, queueing models useful in the context of crowdsourcing have been studied. These studies involve queueing models of the type M/M/c, MAP/PH/1, and MAP/PH/c. In this paper we introduce vacation and working vacation in the context of MAP/PH/1 with crowdsourcing and highlight the qualitative aspects of the model through illustrative examples.
Analysis Of A Multi-Server Queueing Model With Vacations And Optional Secondary Services, Srinivas R. Chakravarthy
Analysis Of A Multi-Server Queueing Model With Vacations And Optional Secondary Services, Srinivas R. Chakravarthy
Industrial & Manufacturing Engineering Publications
In this paper we study a multi-server queueing model in which the customer arrive according to a Markovian arrival process. The customers may require, with a certain probability, an optional secondary service upon completion of a primary service. The secondary services are offered (in batches of varying size) when any of the following conditions holds good: (a) upon completion of a service a free server finds no primary customer waiting in the queue and there is at least one secondary customer (including possibly the primary customer becoming a secondary customer) waiting for service; (b) upon completion of a primary service, …