COMPARATIVE ANALYSIS OF

RESOURCE DISCOVERY
ALGORITHMS ON GRIDSIM
Guide :- Submitted by:-
Mrs. SHAVETA TATWANI
VIVEK SHARMA (0451043107)
MD. IMRAN (0811043107)
VIKAS ATRI (0411043107)
NITESH GUPTA (0651043107)
 What is Resource Discovery
Resource Discovery is systematic process of
determining which grid resource is the best candidate
to complete a job with following trade-offs.
In shortest amount of time

 With most efficient use of resources

At minimum cost

 What is GridSim
 GridSim is a software platform that enables
users to model and simulate the characteristics
of Grid resources and networks with different
configurations.
 There is no limit on the number of application
jobs that can be submitted to a resource.
 Key Features
 Various allocation or scheduling policies can be made
and integrated into GridSim easily, by extending
them from one of the classes.
 Has the infrastructure or framework to support
advance reservation, auction and Data Grid
functionalities of a Grid system.
 Incorporates a background network traffic
functionality based on a probabilistic distribution.
This is useful for simulating over a public network
where the network is congested.
A flow diagram in GridSim based simulations.
 Resource Discovery Algorithms
Following resource discovery algorithms will be
implemented using GridSim:
 Discovering Intermittently Available Resources
(DIAR) Algorithm
 Ant Colony Optimization Algorithm
 DIAR Algorithm
 Used to discover the occasionally available resources
in multimedia environment.
 randomized placement strategies and increased server
storage can facilitate better performance to discover a
particular resource.

A Graph-based representation of the DIAR algorithm

 Pseudo code
DIAR (G<V, E>, R: < VIDR , QoSR , STR , ETR , TypeR> {
/* Initialization:*/
(1) for each edge (u , v) ∈ E
(2) f (u , v) 0 /* f (u , v) is the flow of the edge (u, v) */
(3) f (v , u) 0
(4) /*Reduce the graph:*/
Eliminate infeasible servers that can not provide the service for VID R ;
Eliminate irrelevant time nodes that can not provide service during the
request period.
(i.e. ETR ≤ t1or t2 ≤ STR)
(5) /*ordering the server and time nodes: */
Reorder the left server nodes of Si and Sj , so that e.g. i ≤ j, LF(i) ≤
LF(j) .
(6) define the weight of each edge (u , v) ∈ E, such as:
• C(o, c) = D v, (duration of the requested video);
• C(c, sj ) = the total amount of service time units that server j can provide;
• C(sj , TNt1,t2) = t2-t1, if server j can provide service in the time period [t1,
t2);
• C(TNt1,t2, F) = ∞.
/* Main Loop */
(7) while there exists an Augmenting Path p [11] from O to F in G :
(8) C(p) min (C (e) | e∈ p )
/* e is the edge of p, C (e) is the weight of edge e.*/
(9) for each edge (u , v) ∈ p
(10) f (u , v) f (u , v) + C (p)
(11) f (v , u) - f ( u , v)
}
Ant Colony Optimization Algorithm

 Deploy m ants
from source node
to next node.
 On basis of
pheromone we
decide the
shortest route to
the node
Pseudo code
Procedure ACO
Begin
Initialize parameters, the pheromone trails
While(stopping criterion not satisfied) do
Each ant position starts at satarting machine
While(stopping when every ant has build a solution)do
For each ant do
Chose next machine by applying the state
transition rate
End for
End while
Update the pheromone
End while
end
 References
 [1]Yan Ma, Bin Gong, Lida Zou, “Resource Discovery Algorithm
Based on Small-World Cluster in Hierarchical Grid Computing
Environment”, Seventh International Conference on Grid and
Cooperative Computing, 2008, pp.110-116.
 [2] Kay D¨ornemann and Bernd Freisleben, “Discovering Grid
Resources and Deploying Grid Services Using Peer-to-Peer,
Technologies”, International Conference on Advanced Information
Networking and Applications Workshops, 2009, pp. 292-297.
 [3] Zenggang Xiong , Yang Yang , Xuemin Zhang, Fu Chen and Li
Liu. “Integrating Genetic and Ant Algorithm into P2P Grid
Resource Discovery”, Third International Conference on Intelligent
Information Hiding and Multimedia Signal Processing 2007, pp.83-
86.
 [4] Shengxian Luo Xiaochuan Peng Shengbo Fan Peiyu Zhang,
“Study on Computing Grid Distributed Middleware and Its
Application”, International Forum on Information Technology and
Applications, 2009, pp. 441-45.