Professional Documents
Culture Documents
EFFICIENT
RESOURCE
MANAGEMENT IN
DISTRIBUTED
COMPUTING
Chapter-I
INTRODUCTION
CHAPTER 1
INTRODUCTION
1.1 Motivation
increasingly require to serve society’s needs and the enablement of its missions
PCs in 1990s. In 2010s, nevertheless, they are again moving into consolidated,
services across the internet. The users don't need to invest in a huge computer
system to do their business; instead, they can hire the cloud computing services on
demand. The underlying hardware is generally hosted in huge data centers armed
and availability. "This elasticity of resources, without paying a premium for large
premise computing system, to which the user has to invest in dedicated hardware
and software, the cloud computing system delivers virtualized hardware and
enterprise systems.
Service (IaaS), Platform as a Service (PaaS) and Software as a Service (SaaS) from
service among available ones to build his customized system. Based on these
concepts, this thesis studies stochastic models for cloud computing networks in
arrival of Bag of Tasks (BoTs), service time for classification of BoTs and that of
servers (IaaS, PaaS and SaaS) with a certain probabilistic rules. These queueing
performance.
computing, because today the computer field focuses only on cloud computing
concepts. Cloud computing can provide three kinds of services and the allocation
consists of two nodes namely classification node and service node. First station has
a server that does the classification of bag of tasks, with reference to service level
time. At the second station servers are doing the three kinds of services namely
SaaS, PaaS and IaaS which are assumed to be various distribution using queuing
theory. Various system performance measures are derived for the Cloud
Computing Networks (CCN) and the cost structure is imposed to compute total
expected cost per unit time which is used to increase the overall system.
(varying the service rate) in the distributed environment so that the total expected
allocation technique that played an important role in cluster and grid computing.
network of queues to implement the resource allocation to get optimal service rate.
prime study in this thesis. The thesis emphasizes a classification of jobs to allocate
the three different kinds of service requirements SaaS, PaaS and IaaS. The thesis
relevant to this work. The chapter characterizes the scenario where cloud
computing networks with Poisson type arrival process for bag of tasks in a
the system is busy. These system performance measures are used to get the
optimal resource allocation in terms of service rate. The second model deals
Time queuing system (M/G/s). The researcher observes that the length of
queue in the system and the waiting time of a job decreases with the average
E\ WKH
PHDQ VHUYLFH
WLPH IJ RI
D FXVWRPHU
DQG LWV
YDULDQFH ı2. This model describes a new
analytical expression for performance evaluation of a cloud computing
network (CCN).
(CCN) with two nodes. Node 1 has a single server which classifies the jobs
and node 2 has been divided into three different categories with specific
probabilities. As
tKH H[SHFWHG WRW
DO FRVW DV
D IXQFWLRQ
RI VHUYLFH
UDWH 1 is a
FRQYH[ IXQFWLRQ
WKH RSWLPDO
YDOXH RI 1 is
obtained. The expected total
cost for service node against the service rate 1 is obtained and it is a
convex function. The optimal cost is achieved. Since the number of servers
in this node is fixed, the only possible variation allowed is, the service rate
2 7KH RSWLPDO
YDOXH 2 is obtained.
The optimal allocation of resources in CCN is obtained by optimizing
WKH VHUYLFH
UDWH 1 and 2 at two nodes of
the networks. The second model is the one in which feedback of jobs (tasks)
getting the optimal service rate * and mean number of jobs waiting in the
rate 1 is a convex. The optimal cost value is obtained in the node 1. In the
expected total cost for service node against the service rate 2 is obtained. It
is a
FRQYH[ IXQFWLRQ
7KH RSWLPDO FRV
W 2 is achieved. Since the number of
servers in this node is fixed, the only possible variation allowed is the
VHUYLFH UDWH
2 2SWLPDO FRVW
UDWH 1
*
DQG *
2 are obtained for the CCN. No
physical queue is allowed in the systems and retrial of jobs exists. In the
second model, a CCN with two nodes, classifier and service provider exist.
Thus the queueing system at classifier node becomes G/M/s type. The inter
LLG
ZLWK
PHDQ
'HSHQGLQJ RQ
services are provided. Thus the CCN becomes a tandem Open Jackson
number of customers in the system and expected waiting time in the system.
in cloud computing. Results and its analysis are discussed for different
Chapter 7 presents conclusion, scope for further research and some open
Journals
1. Murugesan R., Elango C., Kannan S., “Cloud Computing Networks with
Conferences
5. Murugesan R., Elango C., Kannan S., “An Efficient Resource Management
6. Murugesan R., Elango C., Kannan S., “Dynamic Resource allocation for Bag
7. Murugesan R., Elango C., Kannan S., “G/M/s-Queueing Model for Resource
44-8, pp 22-29.
8. Murugesan R., Sivakumar S., Kannan S., “A Study of Grid and Cloud
CHAPTER 7
7.1 Conclusion
One of the possible benefits from cloud computing is cost saving. This leads
to different service models in cloud computing. The primary service models being
1. Software as a Service
2. Platform as a Service
3. Infrastructure as a Service
In this thesis we conclude from the stochastic models of CCN that the
Open Jackson Network (Tandem) with feedback retrial mechanism. For tractability
and easy analytic methods for solutions, we assumed that the arrival process is
Poisson and service times are exponentially distributed. In some of the models
general arrival distribution and general service times are assumed to get a realistic
the service node SaaS, which includes all resources including the memory used for
software storage and data storage and also the processing mechanism. The other
service nodes such as PaaS, IaaS each of which includes memory / devices and also
153
the processing mechanism. Since each job needs different resources the service
disciplines are assumed to be processor sharing (PS). The efficient use of the
service nodes SaaS, PaaS, IaaS are measured by each of its average response times.
and service rate which are the repercussions of resources like bandwidth, speed,
memory, quality of resource assigned, availability and selection criteria etc. The
objective of this thesis, is to decide optimal parameters such a service rate and
response time with the cost minimization criteria. Since customer satisfaction is the
By comparing all the six models, we conclude that the last but one model
with feedback retrial is most realistic and efficient (general service time) and
customer friendly. This model provides optimal service rate (representing resource
DOO
FDWL
* at
1
the
clas
sifi
cati
on
nod
e
and
also
opti
mal
serv
ice
rate
(co
mp
utin
g
UHV
XUFH
DOO FDWL
2
* at
ser
vic
e
nod
e.
Th
e
last
mo
del
in
whi
ch
the
arri
val
pro
ces
s
is general and service time is exponentially distributed is more realistic than the
previous models but the computational complexity is a hurdle to find the optimal
VHUYLFH UDWH 1 D
*
G *
2 . If feedback retrials are allowed in this general
model it
becomes more complicated and can be considered for future research in this field.
154
Cloud computing research at the present scenario has entered into a very
complicated stage in which each job needs time sharing services such as memory,
processor, software and other relevant platforms. This increases the complexity of
the problem and getting an analytical solution becomes very tedious. The
resources into three different categories SaaS, PaaS and IaaS in the macro level.
with different nodes and hence analytical solution is feasible by established product
form solution. Even though our model represents exactly all intricacies of the cloud
The researcher’s approach towards resource allocation far better than the
criterion used to get optimal service rate at each node. The remarkable contribution
made in the thesis is designing a simple cloud computing network which becomes
cloud computing field may use time sharing concepts at the service level to get a
155
stochastic models for CCN are most general and abstract to deal with resource
allocation in cloud computing. In future, micro level studies for resource allocation
speed with scalability and security can be done as assignment problems in operation
research.
be used to allocate these resources to the job request from the clients in a more
models in which the CCN has four different nodes which are classifier, SaaS, PaaS
and IaaS equivalent to Open Jackson network (but not in Tandem). In this case, the
complexity of the model will increase but the scope for the further research is
abundant.
The following research directions are suggested to take this research work to
the next level.
improved simultaneously.
156
entities and breaking down the response time into several components
dimension of extension.
security. Since the core data are an assent to a client who is requesting
Contact@
Web: www.writekraft.com