Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues

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

Full description

Bibliographic Details
Main Authors: Chakravarthy Srinivas R., Rumyantsev Alexander
Format: Article
Language:English
Published: De Gruyter 2018-03-01
Series:Open Engineering
Subjects:
Online Access:https://doi.org/10.1515/eng-2018-0004
id doaj-5498b1d232384dfc9ceed18dca4360a3
record_format Article
spelling doaj-5498b1d232384dfc9ceed18dca4360a32021-09-05T20:44:49ZengDe GruyterOpen Engineering2391-54392018-03-0181173110.1515/eng-2018-0004eng-2018-0004Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type QueuesChakravarthy Srinivas R.0Rumyantsev Alexander1Department of Industrial and Manufacturing Engineering, Kettering University, Flint, MI 48504, USAInstitute of Applied Mathematical Research, Karelian Research Centre of RAS, 11 Pushkinskaya Str., Petrozavodsk, 185910, RussiaCloud 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 grids is the level of redundancy (replication) for service requests/workunits. In this paper we study the optimal replication policies by considering three variations of Fork-Join systems in the context of a multi-server queueing system with a versatile point process for the arrivals. For services we consider phase type distributions as well as shifted exponential and Weibull. We use both analytical and simulation approach in our analysis and report some interesting qualitative results.https://doi.org/10.1515/eng-2018-0004queueingdesktop gridsdistributed computingcloud computingmatrix-analytic methodmarkovian arrival processphase type distributionheavy tailssimulation
collection DOAJ
language English
format Article
sources DOAJ
author Chakravarthy Srinivas R.
Rumyantsev Alexander
spellingShingle Chakravarthy Srinivas R.
Rumyantsev Alexander
Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues
Open Engineering
queueing
desktop grids
distributed computing
cloud computing
matrix-analytic method
markovian arrival process
phase type distribution
heavy tails
simulation
author_facet Chakravarthy Srinivas R.
Rumyantsev Alexander
author_sort Chakravarthy Srinivas R.
title Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues
title_short Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues
title_full Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues
title_fullStr Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues
title_full_unstemmed Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues
title_sort efficient redundancy techniques in cloud and desktop grid systems using map/g/c-type queues
publisher De Gruyter
series Open Engineering
issn 2391-5439
publishDate 2018-03-01
description 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 grids is the level of redundancy (replication) for service requests/workunits. In this paper we study the optimal replication policies by considering three variations of Fork-Join systems in the context of a multi-server queueing system with a versatile point process for the arrivals. For services we consider phase type distributions as well as shifted exponential and Weibull. We use both analytical and simulation approach in our analysis and report some interesting qualitative results.
topic queueing
desktop grids
distributed computing
cloud computing
matrix-analytic method
markovian arrival process
phase type distribution
heavy tails
simulation
url https://doi.org/10.1515/eng-2018-0004
work_keys_str_mv AT chakravarthysrinivasr efficientredundancytechniquesincloudanddesktopgridsystemsusingmapgctypequeues
AT rumyantsevalexander efficientredundancytechniquesincloudanddesktopgridsystemsusingmapgctypequeues
_version_ 1717785066767122432