Fuzzy-Logic Based Self Adaptive Grid Architecture

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 184

Fuzzy-Logic Based Self Adaptive Grid
Architecture
Ashiqur Md. Rahman, Roksana Akter, and Rashedur M Rahman
AbstractGrid computing is a framework to meet the growing computational demands and offers the network of large scale
computing resources. This paper presents a survey to generalize the fuzziness in various sectors of Grid computing and
summarize research challenges. The Fuzzy Grid improved the efficiency of probabilistic interpretation of several Grid features.
Not all the Grid architectures provide same benefits for users in utilizing the resources. A thorough overview of Fuzzy-logic
based self adaptive Grid architecture with secure fault tolerant job scheduling, file replication and intelligent routing is studied in
this survey.
Index Termscaching, fuzzification, particle, path goodness, route goodness, security demand, trust index.

1 INTRODUCTION
RID computing [1] is an emerging technology that
focus on uniformly aggregating and sharing distri
buted heterogeneous collection of autonomous sys
tems, resources geographically distributed and intercon
nected by low latency and high bandwidth networks for
solving largescale applications in science, engineering
and commerce [2]. In a largescale grid, distributed re
sources belong to different administrative domains. Data
Grids provides infrastructure for whom accessing, trans
ferringandmanaginglargedatasetsstoredindistributed
repositories [3][4] that leads to a more decentralized ap
proach to address the problem of computing power. Re
search driven by this has promoted the exploration of a
new architecture known as The Grid for high perfor
mancedistributedapplicationsystem.ThetermGridis
driven from an analogy to the electrical power supply in
thesensethatithaspervasiveaccesstothepowerandcan
draw any resources from the distributed resource pool.
Thus, a household draws electricity from power sockets
irrespective of their physical location and the location of
accesspoints[5].
Grid computing can coordinate resource sharing and
problem solving across dynamic multiinstitutional envi
ronments. High performance Grid architectures facilitate
these requirements by applying the various technologies
required in a coordinated fashion to support data inten
sivepetabytescaleapplication.Thispaperdiscussesvari
ous methods of using fuzzy logic in different sector of
Grid architecture. Fuzzy logic [6] has been successfully
applied to many areas such as control, scheduling, repli
cationetc.Thedevelopmentoffuzzygridsysteminvolves
acquiringIFTHENrulesthroughcongregationtheexpert
autonomous grid system.A key motivation of this paper
istoaggregatetheavailablefuzzytechnologiesandmore
importantlythetheoryoffuzzinesstoarticulateaFuzzy
Gridinfrastructure.Classicalexpertsystemsemulatethe
reasoning process on a static trusted Grid environment.
However, the method of handling imprecision must be
excellent for an expert system to measure the natural
probabilistic perception accurately. This new feature is
achievable into the Grid architecture by introducing fuz
ziness. The major areas for implementing fuzziness on
Grid computing are, fuzzy trust integration for security
enforcement on Job Scheduling using Particle Swarm
algorithm, NeuroFuzzy hybrid negotiation model for
resource allocation, and Fuzzy Replica Placement Strate
gies,etc.
Heterogeneous data sources, most of the grid services
thatareavailablearedesignedsuchawaythattheymust
be identical in schema definition for their smooth opera
tion whereas there can be situation where the grid sites
arealsoheterogeneous.Soitisimportantforsuchhetero
geneous distributions of data are to be classified with
maximumsatisfactionwithrespecttoallconstraints.Sec
tion 2 describes the grid architecture forwarded with
fuzzy trust integrated fault tolerant grid architecture for
security enforcement on resource allocation in Section 3.
Section4illustratestheoptimizationofgridresourceallo
cation using NeuroFuzzy hybrid negotiation model.
Fuzzyreplicareplacementalgorithmforoptimizingaver
ageresponsetimeisexplainedinSection5.Fuzzyrouting
tuneup for dynamic maintainability is discussed in Sec
tion 6. Section 7 contains conclusion and provide future
direction.
Motivation of this work is to generalize fuzzy grid
conceptandhighlightongoingresearchinthisemerging
area. XMLbased technologies are involving in interope
rability issues, whereas we are finding some concepts by
which we can provide common specifications on fuzzy
grid.

- Ashiqur Md. Rahman is with the Department of Electrical Engineering &
Computer Science, North South University, Bangladesh.
- Roksana Akter is with the Department of Computer Science & Engineer-
ing, University of Dhaka, Bangladesh.
- Rashedur M. Rahman is with the Department of Electrical Engineering &
Computer Science, North South University, Bangladesh.

G
2011 Journal of Computing Press, NY, USA, ISSN 2151-9617
http://sites.google.com/site/journalofcomputing/

2 GRID ARCHITECTURE
Grid architecture continues to evolve as the overall
design concepts continue to improve and as it is em
ployedforadditionaltasks.However,becauseGridarchi
tecture is highly flexible, Grids have also been adopted
for use by many other, less computationally intensive,
application areas. Today, many types of Grids exist, and
newGridsarecontinuallybeingdesignedtoaddressnew
informationtechnologychallenges.Gridscanbeclassified
invariousways,forexamplebyqualitiesofphysicalcon
figuration, topology, and locality. Grids within an enter
prisearecalledintragrids,interlinkedGridswithinmul
tiple organizations are called intergrids and Grids exter
nal to an organization are called extragrids. Grids can
have a small or large special distribution, i.e.,distributed
locally, nationally or worldwide. Grids can also been
classified by their primary resources and function, for
example computational Grids provide for high
performance or specialized distributed computing. Grids
can provide modest scale computational power by inte
gratingcomputingresourcesacrossanenterprisecampus
or largescale computation by integrating computers
acrossanationsuchastheTeraGridintheUSA[3].
Thebreadthandextensibilityofmultipleheterogene
ous resource types motivate the creation of the multi
tiered architecture shown in Fig. 1. The first tier contri
butes a virtualization layer. The virtualization function is
specific to each resource type and wraps around each
resource instantiation given a resource type. For ease of
programming, the ensuing logical representation for a
resource is typically first supported by companion off
theshelfsoftwareconstructs.
Fig. 1. Multitier architecture of Grid environment. Graphical represen-

tation adapted from [7] and Admela Jukans contribution to [8].
The upper tiers must handle the logical representa
tion of the resource and refrain from direct access to any
specific mechanism for resource lifecycle management
(e.g., to configure, provision, monitor the resource). For
portability and complexity management, it is important
toprovidetheuppertierswithonlyaminimalistviewof
the resource, yet without overlooking any of its core ca
pabilities. Although the first tier may still perceive indi
vidualresourcesassilos,thesecondtierprovidesafoun
dation for horizontal integration among resources (silos).
Within this tier, the SOA property to compose autonom
ous services is most relevant. Conforming to SOA prin
ciples, a service is capable of engaging with other ser
vice(s) at either the same tier or at the bottom tier, in a
peertopeer fashion. The ensuing pool of services fea
turedinthesecondtierisadeparturefromstrictsoftware
layering techniques, which have shown severe limits in
reflecting complex synapses across entities. The Global
GridForumsOpenGridServicesArchitecture(OGSA)[6]
isablueprintwithwhichtostructureservicesthatbelong
tothesecondtierandexhibitsmultivendorinteroperabili
ty.
TherearetwobasicbuildingblocksforDataGrid[1]:
(i) a high performance data transfer system that enables
secure coping of massive datasets; and (ii) a scalable dis
covery and management system for replicas of datasets.
Other services that are required to provide the complete
functionalityofDataGridincludemanagementofshared
dataset collections, resource allocation for processing,
transferandstorageoperationandfinegainedaccesscon
trolsfordatasets.Inthispaper,wepresentanarchitecture
and design of a Data Grid simulation infrastructure
named GridSim [9], [10] shown in Fig. 1. GridSim has a
complete set of feature for simulating realistic Grid test
beds. Such features are modeling heterogeneous compu
tational resources of variable performance, scheduling
jobs based on time or spacedshared policy, differen
tiated network service and workload tracebased simula
tion from real super computers. More importantly, Grid
Sim allows the flexibility and extensibility to incorporate
newcomponentsintoitsexistinginfrastructure.
GridSimisimplementedinJavaontopofanexisting
discrete event simulation engine: SimJava. Interactions
between GridSim entities are implemented using events
(internal, external, synchronous and asynchronous).
GridSim provides other primitives for application task
creation, task mapping to resources and their manage
ment, scheduling task farming applications on heteroge
neous Grids, considering economy based distributed re
source management, dealing with deadline and budget
constraints[11].AllcomponentsinGridSimcommunicate
with each other through message passing operation. The
second layer models are the core elements of the distri
buted infrastructure, namely Grid resource such as clus
ters,storagerepositoriesandnetworklinks.Thethirdand
fourth layers are concerned with modeling and simula
tion of services specific to computational and Data Grid
respectively.Informationaboutavailableresourceandjob
management also incorporates managing data transfers
between computational and storage resources. Replica

catalogs, information services for files and data are also
specificallyimplementedforDataGridsinthislayer.The
fifth layer contains components that aid users in imple
menting their own schedulers and resource brokers. The
layer above this helps users define their own scenarios
and configurations for validating their algorithms and
strategies.
3 FUZZY TRUST INTEGRATED RESOURCE
ALLOCATION
The job scheduling problem is known to be NP
complete.AGridisusedforexecutingalargenumberof
jobs as dispersed resource sites. An optimization model
forfuzzyresourceallocationis,ParticleSwarmOptimiza
tion (PSO), a populationbased stochastic optimization
tool. PSO could be implemented, applied easily to solve
various function optimization problems, or the problem
that can be transformed to function optimization prob
lems [12]. The system is initialized with a population of
random solutions and searches for optima by updating
generations.Fuzzymatricesareusedtorepresentthepo
sition and velocity of the potential solution named par
ticlesinthePSOalgorithmformappingthejobschedules
and the particles. The system dynamically generates an
optimal schedule so as to complete the tasks within a
minimum period of time as well as utilizing all site re
source [13]. To formulate the problem Jj denotes inde
pendent user jobs on Gi heterogeneous trusted grid sites
with an objective of minimizing the completion time and
effectively utilizing trusted computing nodes only. The
fuzzyschedulingrelationfromGtoJcanbeexpressedas
(1).
Sij=R(Gi,Jj),i{1,2,,m},j{1,2,,n} (1)
Here Sij represents the degree of membership of the i
th
element Gi domain G and the j

th
element Jj in domain J
with reference to S. R is the membership function, the
valueofSijmeansthedegreeofmembershipthatthegrid
node Gi would process the job Jj in the feasible schedule
solutionandmisthetotalnumberofGridsiteandn
is the total number of available jobs. In the grid job sche
dulingproblem,theelementsofthesolutionmustsatisfy
the conditions (2) and (3). According to fuzzy matrix re
presentationofthejobschedulingproblem,thepositionX
andvelocityVareredefinedin(4)and(5).
Sij[0,1],i{1,2,,m},j{1,2,,n} (2)
Sij=1,i{1,2,,m},j{1,2,,n} (3)
Xij[0,1],i{1,2,,m},j{1,2,,n} (4)
Vij[0,1],i{1,2,,m},j{1,2,,n} (5)
The elements in the matrix X above have the same
meaningas(1).Accordingly,theelementsofthematrixX
must satisfy the constraint conditions given in (2) & (3).
(6) & (7) for updating the positions and velocities of the
particlesbasedonthematrixoperations.
V(t+1)=wV(t)(c1r1)(X
#
(t)X(t))(c2r2)(X
*
(t)X(t))(6)
Here X
#
is the best position of each particle and X
*
is the
best position among the swarm. Both are obtained in the
time t. c1 andc2 are learning factor, usually c1=c2=2 and r1
andr2arerandomnumberbetween[0,1].
X(t+1)=X(t)V(t+1) (7)
Thepositionmatrixmayviolatetheconstraintsgiven
in (2) and (3) after some iteration, so it is necessary to
normalizethepositionmatrix.First,makeallthenegative
elementsinthematrixtobecomezero.Ifallelementsina
column of the matrix are zero, they need be reevaluated
using a series of random numbers within the interval [0,
1] and then the matrix undergoes the following transfor
mation without violating the constraints |X
]
|e |u,1]
X
k]
m
k=1
wherei{1,2,,m},j{1,2,,n}andk
{1,2,,m}.Nowusingdefuzzificationalongthecolumn
vector in Xij select the highest membership degree. The
corresponding i is the Grid index for job placement.
PSO is not trustworthy in selecting sites depending on
defensecapability.
Trusted Grid Computing demands robust resource
allocation with security assurance at all resource sites.
Largescale Grid applications are being hindered by lack
ofsecurityassurancefromremoteresourcesites.Asecuri
tybinding scheme through site reputation assessment
and trust integration across Grid sites hold fuzziness or
uncertainties behind all trust attributes. The binding is
achieved by periodic exchange of site security informa
tion and matchmaking to satisfy user job demands [14].
Fuzzy trust integration reduces platform vulnerability
andguidesthedefenseacrossGridsites.
PKI (Public Key Infrastructure)based trust model
supports Grids in multisite authentication and single
signon operations. However, cross certificates are inade
quatetoassesslocalsecurityconditionsatGridsites.The
trust index of a Grid site determines the site reputation
from its track record and selfdefense capability attri
buted to the risk conditions at a Grid Site.A Secure Grid
Outsourcing(SeGO)[14]systemprovidessecureschedul
ingalargenumberofautonomousandindividualjobsto
Grid site. SeGO scheduler optimizes the aggregate com
putingpowerwithsecurityassuranceunderfixedbudget
constraints.
Each site executes not only local jobs but also jobs
submitted from remote sites. Grid site may exhibit unac
ceptable security measures and system vulnerabilities
[15], [16]. In mapping autonomous and indivisible user
jobs, it demands resource site to provide security assur
ance by issuing a security demand (SD) whereas the site
needstorevealitstrustworthinessreferredastrustindexI
(TI). These two time variant dynamic parameters must
satisfyasecurityassurancecondition:TISDduringthe
jobmappingprocess.SDiscomputedas(8).

S
=
( S
i

c
i]
q
i
)
q
i
]=1
n
i=1

c
i]
q
i
q
i
]=1
n
i=1
(8)
HereeijExpectedtimetocomputewhenscheduletaskti
to host mj. The estimated expected task execution times
oneachmachineareknowninthegridsites.Theassump
tion is commonly made when studying scheduling prob
lems for grids or Heterogeneous Computing (HC) sys
tems [17], [18], [19] and qi refers the number of hosts
thatsatisfySDTLfortaskti.ThejobSDissuppliedby
the user programs as a single parameter only. The trust
index is normalized as a single number real number with
0representingtheconditionwithhighestriskatasiteand
1 representing the condition which is totally riskfree or
fullytrusted.TIiscomputedas(9).
II
=
II
]
P
]
m
]=1
P
]
m
]=1
(9)
Herethepjisthespeedofhostmj(MFlops).Thevariation
oftheTIofaresourcesitedependsuponsuccessrateand
site defense capability. The trust index increases with the
increase of both contributing factors helps to allocate re
sourceswithhighdegreeofsecurityassurance.Thefuzzy
inferenceisdoneformatchmakingbyfourstapes:fuz
zification,inference,aggregationanddefuzzification[21].
Trust model could deduce detailed security features to
guidethesitesecurityandupdateasaresultoftuningthe
fuzzysystem.Fuzzyrulesextractionfromnumericaldata
directly for function approximation is used to tune the
fuzzysystem[22].
Each SeGO agent contains a resource manager and a
trust manager. The resource manager maintains resource
status and monitor job execution. The trust manager as
sesses sites trust index through fuzzy inference system.
In this architecture the resource manager maintains its
own trust vector, which is updated periodically. The Dis
tributed Hash Table (DHT) offers a fast hashing protocol
to exchange critical information in the trust integration
process. The whole Grid is described by a trust matrix
defined by an m m square matrix M = (V1, V2, V3, ,
Vm),thetrustvectormaintainedatsiteSjisdonatedbyVj
= (t1j, t2j, , tmj) where j m which represents the trust
indexofsiteSjwithallavailablesite.
This model applies two levels of trust inference: the
lower level fuzzy inference system collects all input pa
rametersfromasinglesite,thuscalledintrasitelevel.The
output of the intrasite level provides the inputs to the
upper level. The upper level collects inputs from all re
source sites, thus called intersite level. There are two
fuzzy inference systems applied in the intrasite level.
One evaluates the selfdefense capabilityA, and the other
one evaluates the site reputationu. Each site reports its
assessed selfdefense capability to all other sites. There is
only one fuzzy inference system at the intersite level,
whichcollectsinputsfromintrasitelevels,andinfersthe
sitetrustindicestoformthetrustvectorforeachsite.The
intersite fuzzy inference process using five steps is sum
marized inAlgorithm 1.All selected rules are inferred in
parallel. Initially, the membership is determined by as
sessing all terms in the premise. The fuzzy operator
AND is applied to determine the support degree of the
rules. The AGGREGATE superimposes two AND re
sultscurveswhichisfollowedbydefuzzification.
Thereismanyotherfuzzyinferencerulesthatcanbe
designed using various combination of the fuzzy va
riables considered. The fuzzy rule extraction method de
velopedbyAbeandLan[22]toderiverulesfromnumeri
cal data is used into fuzzy trust system. Fuzzy trust sys
tem needed to be tuned to satisfy the securityassurance
index.
Algorithm1:Intersitefuzzyinferenceprocedure
1. Calculate site reputation , and obtain the reported
selfdefensecapability;
2. Useandsmembershipfunctionstogeneratethe
membershipdegreesforand;
3. Applythefuzzyruleset,mapthespacetoTI
spacethroughfuzzyAND,ORandIMPLYoper
ations;
4. Aggregatethefuzzyoutputsfromallrules;
5. Derive the trust indexs numerical value through a
defuzzificationprocess
Fig. 2. Fuzzy trust aggregation at the intra- and inter-site levels.

There are two tuning process: (1) Fuzzy system cali
bration and (2) Site security attribute tuning. To set up a
fuzzy system for a Grid, initially the tuning process may
not be accurate due to the lack of accumulated data. An
accurate fuzzy system should be able to infer the correct
site trust indices from collected security and behavior
information. As the environment changes, the fuzzy sys
tem need to update its configuration setting repeatedly

known as system calibration. The site security upgrade
process is guided through a topdown system tuning the
securityattributestoyieldthetargettrustindex.Thistun
ing process has two steps: intersite tuning and intrasite
tuning,asillustratedinFig.3.
The goal of the intersite tuning is to upgrade self
defensecapability,toelevatesiteTItomatchwithjobSD
as specified inAlgorithm 2. The intersite tuning sets the
target selfdefense capability for the intrasite tuning to
achieve security upgrades at individual sites. Trust up
date and trust propagation is specified in Algorithm 3
and Algorithm 4 which helps to reduce the site vulnera
bility.
Fig. 3. Fuzzy system tuning process to upgrade site trust index.

Algorithm2:Intersitefuzzysystemtuningprocess
1. targetouput*=averageusersecuritydemand;
2. observedoutput=currentsitetrustindex;
3. error=*;
4. while(||error||>){
5. Adjust selfdefense capability to quantified by
thefuzzysystem;
6. =Intersiteinference(,);
7. error=*;}
8. Sendtointrasitefuzzysystemtuningprocess.
Algorithm3:Trust_Update(index_TTLreports,i,j)
1. Ri calculate success rate of Rj: = number of suc
cessjobs/index_TTL;
2. RiassessdefenserateofRj;
3. Calculate the stimulus value:
Sij=Fuzzy_inference(,);
4. Calculatethenewtrustindex:t
new
ij=ot
old
ij+(1o)Sij;
5. if((t
new
ij<t
old
ij)or(t
new
ij<averagetrustrequirement))
Enhance defense capability of Rj, (Rj) = (Rj) +
().
Algorithm4:Trust_Propagation(i)
1. RibroadcastsVi;
2. forj=1toi1,i+1toM
3. V
new
j=(m1/m)V
old
j+Vi/m
Based in the fuzzy trust model Algorithm 5 represents
the SeGO scheduler for optimized Grid resource alloca
tion. An extension in Algorithm 5 integrates trust in Se
GO,whichisstatedbelow.
Algorithm5:SeGO(Rj,Job=(W,D,T,B))
Input:SubmitJob=(W,D,T,B)toresourcesiteRjattime
T, Rj requests resources from all m sites. Output: Work
load distribution (W1, W2, , Wm) and estimated execu
tion time L for Job based on allocation X = (x1, x2, , xm)
generated.
1. Rjsendsrequeststoobtainavailableresourcesin
formationfromallsites;
2. fori=1tom
3. if(tij<T)xi=0;
4. endfor
5. EstimateexecutiontimeL=D;
6. GeneratetheallocationvectorX=(x1,x2,,xm),
whichmaximizeE=i=1
m
xiPiLtij/i=1
m
xiPiLCi,sub
jecttothefollowingconstraintsi=1
m
xiPiLtijW,
i=1
m
xiPiLCiB,and0xi1;
7. fori=1tom
8. Wi=xiPiL;
9. return(W1,W2,,Wm,L)withallocationX=(x1,
x2,,xm).
ExtendedAlgorithmforallmsitesfornjobs
Input: n jobs submitted at m resource sites. Output: Re
sourceallocationforjobsandupdatedtrustvectorsforall
sites.
1. Dountil(allsubmittedjobsareexecuted)
2. if(=arrivaltimeofcurrentJob=(W,D,T,B))
3. JobisputinthejobqueueofRj;
4. (W1,W2,,Wm,L)SeGO(Rj,Job);
5. fori=1tomresourcereservation,i.e.,Pi=Pi
Wi/L;
6. endif
7. if(RjgetsthepreviousJob=(W,D,T,B)reportat
time)
8. fori=1tom
9. resourcerelease,i.e.,Pi=Pi+Wi/L;
10. if(Rjaccumulatesindex_TTLjobreportsfromRi)
11. Trust_Update(index_TTLreports,i,j);
12. if(Rjaccumulatesexecutionreportsforvector_TTL
jobs)
13. Trust_Propagation(j);
14. endfor
15. endif
16. enddo
Fig. 4. shows the trust inference process using the mem
bership function in Fig. 5. As example, two fuzzy infe
rence rules are given below for using in the inference
processshowninFig.4.

4 AUCTION BASED RESOURCE ALLOCATION
Inexistingeconomybasedmodelsofgridresourceal
location and management, just as a commodity market
modelandpostedpricemodel,shareresourcesarebased
on negotiating about the usage duration or time, the
usagefee,QoS(QualityofServices)andsomeotheritems
between the owner or his broker and consumer of grid
resources. That will cost somuch time for a great dealof
gridusersnomatterwhethertheyaregridresourceown
er or grid resource consumers, which reduce the sharing
efficiencyinthegridenvironmentandsometimeiseven
unexpected. In this section, three auction based resource
allocationmodelsaredescribed.
Fig. 4. Fuzzy logic inference between job success rate u and self-
defense capability A to induce the trust index I of a resource site.
Fig. 5. Membership functions for different levels of the trust indexI,

job success rate u and site defense capabilityA.
4.1 Auction Framework for Resource Allocation
In this section a model of an auction in Grid compu
tingandthedesignoftheauctionframework[23]aredis
cussed. A descending Dutch auction that follows the
standards provided by FIPA [24, 25], which defines stan
dards for multiagent systems and for communication
among agents in multiagent systems. The main partici
pantsinanordinaryauctionaretheseller,theauctioneer
and the buyers or bidders. In reverse auction for Grid
computing, the users are buyers, brokers are auctioneers
and resource providers are sellers. The buyer starts the
auctionandthesellersbidtosellaservicetothebuyer.In
suchacase,aDutchauctionbecomesascending.Initially,
theusersubmitsjobstothebroker.IntheGrid,abrokeris
responsible for submitting and monitoring jobs on the
usersbehalf.Thebrokercreatesanauctionandsetsaddi
tional parameters of the auction such as job length, the
quantityofauctionrounds,thereservepriceandthepoli
cy to be used (e.g. English or Dutch auction policy). As
the broker also plays the role of auctioneer, it posts the
auction to itself; otherwise, the auction would be post to
an external auctioneer. The auctioneer informs the bid
dersthataDutchauctionisabouttostart.Then,theauc
tioneer creates a call for proposals (CFP), sets its initial
price,andbroadcaststheCFPtoallthebidders.Resource
providers formulate bids for selling a service to the user
toexecuteitsjob.
The first time that bidders evaluate the CFP, they de
cide not to bid because the price offered is below what
they are willing to charge for the service. This makes the
auctioneertoincreasethepriceandsendanewCFPwith
this increase in the price. Meanwhile, the auctioneer
keeps updating the information about the auction. In the
second round, a bidder decides to bid. The auctioneer
clears the auction according to the policy specified befo
rehand.Oncetheauctionclears,itinformstheoutcometo
the user and the bidders. Based on this general model of
auctions, which generalized auction framework that al
lows users to develop and evaluate auction protocols for
resource management in Grids by using GridSim Grid
simulator[9].
4.2 Grid Resource Allocation with Generalized
Assignment
OnbehalfofGRM(GridResourceManager)thegene
ralized assignment algorithm meets the service of grid
resource sharing [26]. Two key players driving the Grid
ResourceSupermarket(GRS)areGSPs(GridServicePro
viders) and GRBs (Grid Resource Broker). In the com
modity market model, resource providers specify their
service price and charge users according the amount of
resourcetheyconsume.Thepricingpolicycanbederived
from various parameters and can be flat or variable de
pending on the resource supply and demand. In general,
servicesarepricedinsuchawaythatsupplyanddemand
equilibrium is maintained. Logic structure of commodity
modelisjustlikeFig.6(a).Thepostedpricemodelissimi
lar to the commodity market model except that it adver
tises special offers in order to attract (new) consumers to
establishmarketshareormotivateuserstoconsiderusing
cheaperslots.Logicstructureofpostedpricemodelisjust
likeFig.6(b).

Fig. 6(a) Interaction between GSPs and users in a commodity mar-
ket Grid for resource trading (b) Posted price model and resource is
trading in a computational market environment.

In this case, brokers need not negotiate directly with
GSPsforflatfee,usagedurationortime,QoSetc.butuse
posted prices as they are generally cheaper compared to
regular prices. The postedprice offers will have usage
conditions, but they might be attractive for some users.
The scheme includes two parts. Part one is Posted price
based GRS model. In this part, grid consumer will share
theGRSresourcejustlikepostedpricemodel.Parttwois
grid resource optimization based GAP (Generalized As
signment Problem) in order to maximize the profits for
the GRS manager. GRS have n pieces of resources, each
resource have his ID, resource name, bank account of his
owner, access time for sharing, resource amount, price
etc. signing as GRSRi = ( RiID, Riname, Riaccount, time,
amount, Ripricein, , RiIP) i = 1, 2, , n and GRSRi is
shared by some grid consumer and homologous each
item sign as SellRi = ( RiID, Riname, Riaccount, time,
amount, Ripriceout, , RiIP) i = 1, 2, , n. Therefore, the
managerofGRSgainstheprofitsaccordingtothefollow
ings:Profits=i=1
n
((Ripricein)(Ripriceout)).Ingeneral,Ripricein
is bigger than Ripriceout, so the manager of GRS can get
profitsastheirgrossprofits.Thereareobviousdifferenc
es between Posted price model and Posted price based
GRS model. That is, all the detail about resource sharing
such as cost fee, usage duration or time, QoS and other
items in our approach was negotiated about while the
GRS was constructed. That means a foreground task is
changedintobackgroundtask.
The problems are merely divided into the following
two cases [27]. Case 1: There are n pieces of resources
should be scheduled by m jobs, m n, only one job is
arrangedtooneresource,butjobjcanbearrangedbybj
resources cooperating with job j, here bj is an un
known number, and j=1
n
bj = m. We might as well sup
posethatallocationshouldthinkaboutpfactorsuchas
router,bandwidth,price,etc.Assumefactork(k=1,2,
,p)thatresourcejarrangedtojobicanmakeGRS
economy efficiency eij (i = 1, 2, , m ; j = 1, 2, , n), the
problem is how to allocate the assignment and make the
managerofGRSgetthemaximumprofits.
Model1:maxProfitk=i=1
m
j=1
n
eij
k
xij(k=1,2,,p)
s.t.{
j=1
n
xij=1(i=1,2,,m)
j=1
n
i=1
m
xij=m xije{0,1}
(i=1,2,,m;j=1,2,,n)}
Case 2: If there are n pieces of resources should be
scheduled by m jobs, mn, only one resource is ar
rangedtoonejob,butjobjisarrangedwithairesources
which satisfy job j together, here ai is an unknown
number, and i=1
m
ai = n. We might as well suppose that
allocation should think about p factor such as router,
bandwidth,price,etc.Assumefactork(k=1,2,,p)that
resource j arranged to job i can make GRS economy
efficiencyeij(i=1,2,,m;j=1,2,,n),theproblemis
how to allocate the assignment and make the GRS man
agergetthemaximumprofits.
Model2maxProfitsk=i=1
m
j=1
n
eij
k
xij(k=1,,p)
s.t.{
i=1
m
xij=1(j=1,2,,n)
i=1
m
j=1
n
xij=m xij=0,1
(i=1,2,,m;j=1,2,,n)}
According to the procedure of multiobject composi
tive matrix R is developed with fuzzy relationship.Af
terthat,expandedbenefitmatrixAisproduced.Byus
ingHungaryalgorithm[27]thematrixA~iscalculated.
Combining the fuzzy theory with Hungary algorithm
which is applied to solve conventional assignment prob
lem,thelastallocationofresourceiscalculated[26].
4.3 Neuro-Fuzzy Hybrid Negotiation Model
The restriction of the grid resource allocation with
generalized assignment algorithm brings a disadvantage
position of application and the system is not adaptive in
naturewithresponsetodynamicbehaviorofthegridsite.
A neurofuzzy hybrid model for autonomous agent to
negotiate that allows agents to show effective and intelli
gentbehaviorsofrealgridenvironmentwheretheagents
are able to learn from the environment [28]. The negotia
tionprocessisdrivenbythefuzzylogic,wherethisfuzzy
logic is incorporated with the agents satisfaction consi
dering intelligent. Here knowledge base is used which is
updated by the backpropagation neural network model
fromhistoricalinstancesoftargetdomain.Blockdiagram
of negotiation mechanism is given in Fig. 7. where the
negotiation attribute is price like in Dutch auction. Here
buyer is the resource allocator, seller is the grid site and
price refers resource amount. This model classifies price
intosixsubclasses,theyareverypoor(P5),poor(P4),av
erage(P3),good(P2),verygood(P1)andexcellent(P0).
In this model the negotiation process is going on se
quentially. Following fuzzy membership functions re
gardingsatisfactionagainsttheofferingpriceoftheseller
agentareusedreferredasLevel_indexforbuyerprice,
1. Level_index = 1: If offeringprice within P0 to P2
thenverygoodsatisfaction(VGS)
thengoodsatisfaction(GS)
thenmoderatesatisfaction(MS)
thenbadsatisfaction(BS)
5. Level_index = 5: If offering price within P4 to
abovethenverybadsatisfaction(VBS)
For the fuzzification of the buyer agent input that is to
compute degree of membership for the antecedents is,
If (|1 0) or (|2 0) then the degree of membership = 0;
Else degree of membership B = (|1 S1) ^ (|2 S2) ^ 1
here,thepointofinputistheofferingpricereferasxof
the buyer and |1 = distance (x, lower Level) and |2 = dis
tance (x, higher Level). S1 and S2 is slop of price function
lower and higher Level respectively. For the seller agent
the offering value level satisfactions are {0.2, 0.4, 0.6, 0.8,

1}.
In this model, the negotiation process goes on using
an intelligent utility function. The buyer agent checks its
satisfaction level and updates its beliefs about its oppo
nents and then tries to maximize its own expected out
come based on its own subjective beliefs in single itera
tion.Twoparametersaretobeprovidedtoabuyeragent.
They are least price and maximum value. The buyer and
the seller both generate their own offering price depend
ingupontheseparameters.Ifsatisfactionishighforbuy
er against the sellers offering price the buyer agent tries
tobemoresatisfiedbyusingautilityfunction(10).
Pi+1=Pi+((Pdiff/APs)Level_sats)(Degree_of_mebership)
Level_i
ndex
b (10)
Where Pi+1 = Next price offered by buyer agent, Pi = Last
price offered by the buyer agent, Pdiff = (Last price by the
sellerLastPriceofferedbythebuyer),APs=Pricereduc
tionbythesellerintwoconsecutiveiteration.Itimproves
the concept of zero of agreement [29] in negotiation
dynamically. Naturally Pi+1 is proportional to Pdiff and in
versely proportional to APs since huge reduction by the
sellercreatesdoubtinrealprice,qualityetc.So,thebuyer
increaselowersinprice.Onthecontrary,scantyreduction
bythesellercreatesconfidentonrealprice,qualityresults
the increase in price by the buyer agent. Lavel_sats helps
to the effect of same degree of membership in different
satisfactionlevel.level_indexbcontrolsthestrategyofthe
buyer for what manner he should negotiate. At initial
stage the buyer agent increases the price rapidly as it re
mains in higher satisfaction level. But as the satisfaction
decreasesthebuyeragentchangesitsattitudeandgoesto
increasepriceoftheproductslowly.
Fig. 7. Neuro-Fuzzy based negotiation mechanism flowchart.

The buyer agent will complete the transaction and fi
naldecisionsaretakenwiththehelpofhistoricalinstance
of a target domain by using back propagation neural
network. With one hidden layer the summation of divi
sors of negotiating values is taken from particular seller
agentsimultaneouslyusingSn=Iij/Wij. ThenSnwillbe
input of the next layer. The offer of the selected seller is
calculated by the equation Sn/Wn where W is used for
previous experience for that seller. The output value in
everylayerisdeterminedbytheequationO=1/(1+e
1
o
(S
T)
) and the error is Er = 1/2(T O)
2
where T is the thre
shold value lies between ranges. After completing the
hidden layer operations, the final decision will be taken
dividing by the weight of the seller agentwhich is consi
deredfortheiroverallperformanceandprevioustransac
tion.
5 FUZZY REPLICA REPLACEMENT
The large popularity of Grid Computing and its ap
plications makes their performance very critical. Data
replication is an excellent technique to move and cache
data close touser. Replication reduces access latency and
bandwidthconsumption.Italsofacilitatesloadbalancing
andimprovesreliabilitybycreatingmultipledatacopies.
Replica placement algorithms are based on heuristic
wherereplicascanbemanagedandallocatedeitherstati
cally or dynamically. Static replication is an offline
process whereby replicas are placed using a snapshot of
thesystematdesigntimeevenifthesystemchangessig
nificantly. Therefore, dynamic approach is more natural
as it adapts to change in user behavior and system dy
namicsandreallocatesreplicastonewcandidatesites.
Totaljobexecutiontimemeasureseffectivenessofthe
replicationstrategies.JobsintheDataGridmayrequesta
numberoffiles.Ifthefileisatalocalsite,responsetimeis
assumedtobezero;otherwisethefilemustbetransferred
fromthenearestreplicationsite.Thus,jobexecutiontime
includes the latency required to transfer a file. The best
replicationstrategyminimizesthetotaljobexecutiontime
and the total response time. The identified problem is
closelyanalogoustothepmedian[30]modelusedexten
sively for facility location problem in urban planning.
User requests and network bandwidth plays a vital role
in large file transfers. The current network state and file
requests produce better results than file request alone.
The replication algorithm selects one site per iteration to
hostreplicabyoptimizingriskorutilityindexes[31].Fur
thermore, locating p candidate sites simultaneously ra
therthanonesiteperiterationiselaboratelydescribedin
[32].Thismultiobjectiveapproachcombinespcenterand
pmedian objective to decide where to place a replica.
Thismodelminimizesthemedianobjectivewithoutkeep
ing any requesting site too far from a candidate replica
tion site. The goal of replacement polices is to make the
best use of available resources by dynamically selecting
the files to be cached or evicted. In this section an algo
rithm that applies a set of fuzzy control rules to identify
the filesto evict is described.According to EU Data Grid
Testbed [20], the users are directly connected with the
regionalresourceallocatorwhereastheresourceallocator
accumulates the file replica. So, from ovservation, it is
wise to evict files in the resource allocator rather than
selectingsitenodeforindexing.

Deriving PostModel from resource allocator logs is
oneofthechallengingissues.Modeldiscoveryfromevent
logs is a coherent subset of architecture that typically re
volves around particular aspects of the overall architec
ture [33]. The techniques are based on a probabilistic
analysisoftheeventtraces.Usingmetricsforthenumber,
frequency,sizeoffilesandregularityofeventoccurrence,
adeterminationismadeofthelikelyconcurrentbehavior
being manifested by the system. Discovering this beha
viorhelpsthefuzzysystemtoapplyrules.Whenacache
miss occur and the cache is full Fuzzy 12 rule [34] deter
mines the files to evict by computing for each file in the
cache a figure of merit, namely, its probability of replica
tion (RP). Among the files ranked according to their
probability of replication, the algorithm chooses the files
with the highest rank. By understanding the properties
and behavior of their workload three variables are cho
sen. These are (1) files in size, (2) access frequency, i.e.,
numberofaccessand(3)accesstime.Thefuzzysetswith
membership functions describing the degree of member
ship are associated with these variables. Size (s) and Fre
quency(f)holdsLOW,MEDIUM,HIGHlinguisticvalues
whereasTime(t)representsVERYLOW,LOW,MEDIUM,
HIGH, VERY HIGH membership functions. The indexes
ofthesevariablesareshowinFig.8(a),(b),(c)and(d).The
ifthenFuzzy12conditionalrulesare,
If(fisLOW)and(tisVHI)and(sisMED)then(RPisVHI)
If(fisLOW)and(tisHIG)and(sisHIG)then(RPisVHI)
If(fisMED)and(tisVHI)and(sisHIG)then(RPisVHI)
If(fisLOW)and(tisVHI)and(sisHIG)then(RPisVHI)
If(fisLOW)and(tisHIG)and(sisLOW)then(RPisHIG)
If(fisMID)and(tisHIG)and(sisLOW)then(RPisMED)
If(fisMED)and(tisVHI)and(sisMED)then(RPisHIG)
If(fisMED)and(tisHIG)and(sisHIG)then(RPisHIG)
If(fisHIG)and(tisVHI)and(sisHIG)then(RPisLOW)
If(fisHIG)and(tisHIG)and(sisHIG)then(RPisLOW)
If(fisLOW)and(tisMID)and(sisHIG)then(RPisHIG)
If(fisMED)and(tisHIG)and(sisMED)then(RPisMED)
Once the design parameter have been defined the fuzzy
algorithmproceedsasfollows,
1. Measurement of the values of the input data
fromtheresourceallocatorserver;
2. Fuzzificationoftheinputdataintofuzzysets;
3. Inferencefromfuzzyrules;
4. Aggregation across the rules and defuzzification
of the fuzzy output into a non fuzzy control ac
tion.
The fuzzification has effect of scaling and mapping
crisp input data into fuzzy sets by means of the corres
ponding membership function. The input values related
to each page are translated into linguistic concepts. For
eachrule,theantecedentsareevaluatedandthedegreeof
truth is computed by applying the fuzzy and operator,
that is, the product. The aggregation process combines
the outputs of the rules by applying the maximum op
erator to each descriptive level of the output variable RP
(i.e.,probabilityofreplication).Thedefuzzificationtrans
forms these four values into a nonfuzzy control action
correspondingtotheprobabilityofreplicationofthefile.
The defuzzification used the method of centroid and the
massesareobtainedasaresultofaggregationprocess.As
afinalstep,thefilesarerankedaccordingtotheirproba
bilityofreplication.
Fig. 8. Membership function of the variable (a) Size (b) Time (c) Fre-
quency and (d) Replication
6 FUZZY ROUTING
Toexchangecriticalinformation,amongtheuserand
the grid site, GridSim simulator uses java socket pro
gramming over TCP/IP network model. Efficient routing
in communication network is becoming increasingly dif
ficultduetotheincreasingsize,rapidlychangingtopolo
gy and complexity of communication network. The com
plexity involved in the networks may require the consid
eration of multiple constraints to make the routing deci
sion. A novel approach named FLAR (Fuzzy Logic Ant
based Routing) inspired by swarm intelligence and en
hanced by fuzzy logic technique as adaptive routing that
allows multiple constraints to be considered in a simple
andintuitiveway[35].
In the AntNet algorithm, routing is determined
through complex interactions of network exploration
agents, called ants. These agents are divided into two
classes, the forward ants and the backward ants. The idea
behind this subdivision of agents is to allow the back
ward ants to utilize the useful information gathered by
the forward ants on their trip from source to destination.
Basedonthisprinciple,nonoderoutingupdatesareper
formedbytheforwardants,whoseonlypurposeinlifeis
to report network delay conditions to the backward ants.
This information appears in the form of trip times be
tween each network node. The backward ants inherit this
raw data and use it to update the routing tables of the
nodes. The detailed information about different versions
ofAntNetalgorithmscanbefoundin[36].
FLAR is constructed with the communication model
observed in ant colonies and fuzzy logic technique. The

FuzzyInferenceSystem(FIS)forFLARisamamdanitype
system with two inputs and one output. The system in
puts are route (or link) delay and route utilization. The
both inputs are characterized by the fuzzy membership
functionsasshowninFig.9.andFig.10.Themembership
functionsforthefuzzysetsofinputsarechosentobetri
angular.Bothofinputsarenormalizedbetween(0,1)be
foreapplyingtoFIS.AsshowninFig.9andFig.10,both
input variables route delay and utilization have five
membership functions titled as VL, L, M, H, and VH
which mean Very Low, Low, Medium, High, and Very
Highrespectively.

Fig. 9. Membership function of Link Delay (X1).

Fig. 10. Membership function of Link Utilization (X2).
The rules of the FIS are designed for an optimal per
formance.Table1showsrulebasefortheFIS.Inthistable
the Values for the amount of goodness from lowest to
highestaredefinedasLL(VeryLow),LM,LH,ML,MM
(Medium),MH,HL,HM,andHH(VeryHigh).
TABLE 1
RULE BASE FOR FIS
RouteGoodness
RouteUtilization(%)
VL L M H VH
Route
Delay
(ms)
VL HH HM HL MH MM
L HM HL MH MM ML
M HL MH MM ML LH
VL HH HM HL MH MM
L HM HL MH MM ML
M HL MH MM ML LH
H MH MM ML LH LM
VH MM ML LH LM LL
TheoutputofFISwhichisroutegoodnessisapplied
to the software simulation for evaluations. Design of
Fuzzy Inference System is the process of formulating the
mapping from a given input to an output using fuzzy
logic.
The defuzzification is the process of conversion of
fuzzy output set into a single number. The method used
for the defuzzification is, mean of centers as shown in
(11).Then,theoutputoffuzzysystemafterdenormaliza
tion is applied to the FLAR algorithm as the
Route_Goodnesswhichcanbeusedasacriterionforgood
Fig. 11. Membership function of Route Goodness (Y). ness of a

route(orlink).
Routc_0ooJncss
]
(t)
=
y u
A
i
l
(x)
n
]
i=1
M
l=1
u
A
i
l
(x)
n
]
i=1
M
l=1
(11)
Where, i is the node where an ant is going from, j is
referred the node where an ant wants to move, M is the
number of fuzzy rule, i.e. M = 25, nf is the number of
membership functions for input variables, i.e. nf = 2 and
Ai(xi) is the Fuzzy value of membership functions. The
sequenceofFLARalgorithmisoutlinedasfollows:
1. Eachsourcenodelaunchesforwardantstodesti
nationsatregulartimeintervals.
2. The ants find a path to the destination randomly
based on the current routing tables, but the data
packetschoosethepathtodestinationwithhigh
estprobability.
3. Theforwardantscreateastack,pushingindelay
time and percentage of buffer utilization for
everytraversedroute(orlink)toanode.Thede
lay can be the sum of wait time in queue and
transmissiontimeforeachvisitednoden.
4. When the destination is reached, the backward
antsinheritthestack.
5. The backward ants pop the stack entries (delay
time and utilization percentage) and follow the
pathinreverse.
6. Those entries are given to fuzzy inference sys
tem. The output of fuzzy system is used as the
goodnessvaluetoupdatetheroutingtableofthe
node.
7. The routing tables of each traversed route (or
link)areupdatedwithequation(12)onthebasis

ofthegoodnessvalue.
Potb_0ooJncss
],d
n
(t)
= (1 -)Potb_0ooJncss
],d
n
(t -1) (12)
Whereisthelearningrate.TheestimationPath_Good
ness
n
j,d which means the amount of goodness to go from
node n to destination d via neighbor node j, is ex
pressedinequation(13).ThisequationstatesthatnPath_
Goodnessj,disthesumofallRoute_Goodnessvaluesofthe
traversed links in the path that are obtained by equation
(11).
Potb_0ooJncss
],d
n
= Routc_0ooJncss
I
I+1

t
I=1
(13)
Where t is the number of traversed routes (or links) in

the path starting with node n (l=1) and finished with
node d (l=t) via neighbor node j. Afterward routing
tableprobabilitiesareupdatedbyequation(14).
P
],d
n
(t) =
|
1
PATH_GOODNESS
],d
n
(t)
|
|
1
PATH_GOODNESS
],d
n
(t)
|
l
(14)
WhereleNeighbor(n).Theadvantagesofsuchanintelli
gent algorithm include increased flexibility in the con
straints that can be considered in making the routing de
cisionefficientlyandthesimplicityintakingintoaccount
multipleconstraints.
The fuzzy control ant routing system shows better
performancethanOSPF.Sothisnovelapproachindicates
an encouraging characteristic for dynamic netmesseging
infuzzyGridenvironment.
7 CONCLUSION
The vision of this survey is to make Fuzzy Grid more
comprehensive. We try to come up with some common
features which are desirable for assembling Fuzzy Grid.
As the problem is not trivial, there are lots of factors in-
side, if we really want to establish our arguments of this
paper. Here we highlight the most popular contributions
in this area with the motivation to provide a generic plat-
form to work with a complete fuzzy system of Grid com-
puting environment.
The Grid sites do not share a common memory or the
computing capability among themselves even if the site
remains inoperative. Distributed service Grid manage-
ment architecture [37] is capable of performing auto-
mated resource-to-service assignations. Divisible load
balancing among the sites using parallel algorithm is our
future focus.
REFERENCES
[1] I. Foster, C. Kesselman, and S. Tuecke, The anatomy of the
grid: enabling scalable virtual organization, International Jour-
nal of High Perfromance Computing Application, vol. 15, pp. 200-
222, 2001
[2] I.Foster,C.Kesselman,andS.Tuecke,TheGrid:Blueprintfor
a new computing infrastructure, Morgan Kaufmann Publisher,
SunFrancisco(USA),1999
[3] A. Chervenak, I. Foster, C. Kesselman, C. Salisbury and S. Tu
ecke, The data grid: Towards an architecture for the distri
buted management and analysis of large scientific datasets,
Journal of Network and Computer Applications, vol. 23, pp. 187
200,2001
[4] W.Hoschek,F.Janez,A.Samar,H.Stockinger,andK.Stocking
er, Data Management in an International Data Grid Project,
1
st
International Workshop on Grid Computing (GRID), India, De
cember,2000.(Conference proceedings)
[5] I. Foster, C. Kesselman, and C. Globus, A toolkitbased Grid
architecture, pp. 259278, Morgan Kaufmann Publisher, Sun
Mateo,CA(USA),1999
[6] www.teragrid.org,2002
[7] B.Aiken,J.Strassner,B.Carpenter,I.Foster,C.Lynch,J.Mam
bretti, R. Moore, and B. Teitelbaum, Network Policy and Ser
vices:AReportofaWorkshoponMiddleware,IETFRFC2768,
2000
[8] B. Carpenter, Architectural Principles of the Internet, RFC
1958,1996
[9] R. Buyya, and M. Murshed, GridSim:A Toolkit for Modeling
and Simulation of Distributed Resource Management and
SchedulingforGridComputing,ConcurrencyandComputation:
Practice and Experience (CCPE), vol. 14, pp. 1175 1220, Wiley
Press,2002
[10] A.Sulistio,G.Poduvaly,R.Buyya,and C.Than, Constructing
a grid simulation with differentiated network service using
GridSim, 6
th
International Conference on Internet Computing, Las
Vegas,USA,2005.(Conference proceedings)
[11] A. Sulistio, U. Cibej, S. Venugopal, B. Robic, and R. Buyya, A
toolkit for Modeling and simulating Data Grids: An extension
to GridSim, Concurrency & Computation: Practice & Experience,
vol.2.02,JohnandWiley&Sons,2002
[12] J. Kennedy, and R. Eberhart, Swarm Intelligence, Morgan
Kaufmann,2001
[13] A. Abraham, L. Hongbo, Z. Weishi, C. TaeGyu, Schediling
Jobs on Computational Grids Using Fuzzy Particle Swarm Al
gorithm.,LNAI4252,pp.500407,Springer,2006
[14] S. Song, K. Hwang, and Y. Kwok, Trusted Grid Computing
with Security Binding and Trust Integration, Journal of Grid
Computing,Springer,2005
[15] M. Humphery, and M.R. Thompson, Security Implications of
Typical Grid Computing Usages Scenarios, Proceedings of
HPDC,August2001.(Conference proceedings)
[16] S. Hwang, and C. Kesselman, A Flexible Framework for Fault
Tolerance in the Grid, Journal of Grid Computing, vol. 1, no. 3,
pp.251272,2003
[17] T.D. Braun, D. Hensgen, R. Freund, and R. Siegel, A compari
son of eleven static heuristics for mapping a class of indepen
denttasksontoheterogeneousdistributedcomputingsystems,
Journal of Parallel Distributed Computing, vol. 61, pp. 810837,
2001
[18] J. Kim, S. Shivle, and H.J. Siegel, Dynamically mapping tasks
withprioritiesandmultipledeadlinesinaheterogeneousenvi
ronment, Journal of Parallel Distributed Computing, vol. 67, pp.
154169,2007
[19] H. Zhao, and R. Sakellariou, Scheduling multiple DAGs onto
heterogeneous systems, 20
th
International Parallel and Distri
buted Processing Symposium, pp. 114. IEEE Press, Piscataway
2006.(Conference proceedings)
[20] www.eu-datagrid.org, 2003
[21] B.Kosko,FuzzyEngineering,PrenticeHall,1997

[22] S.Abe, and M. Lan, Fuzzy Rule Extraction Directly from Nu
merical Data fro Function Approximation. IEEE Trans. On
SMC,vol.25,pp.119129,1995
[23] A. Marcos Dias de Assuno, Example of Use of the Auction
Framework for Gridsim, Grid Computing and Distributed Sys
temsLaboratory,Australia,(http://www.gridbus.org),2001
[24] Fipa Dutch Auction Interaction Protocol Specification. FIPA
Foundation for Intelligent Physical Agents, (http://www.fipa.org/),
2001
[25] Fipa English Auction Interaction Protocol Specification. FIPA
Foundation for Intelligent Physical Agents, (http://www.fipa.org/),
2001
[26] L. Mingbiao, C. Xinmeng, J. Feng, and W. Zhijian, Optimiza
tionofGridResourceAllocationCombiningFuzzyTheorywith
Generalized Assignment Problem, 6
th
International Conference
on Grid and Cooperative Computing (GCC 20070), IEEE 2007.
(Conference proceedings)
[27] S. Yexin, C. Mianyun, and Z. Zhisong, Fuzzy Hungary algo
rithmforsolvingthemultiobjectgeneralizedassignmentprob
lem,JournalofNavalUniversityofEngineering,vol.5,pp.7794,
2000
[28] K. Shahidul, NeuroFuzzy Hybrid Negotiation Model for In
telligent Agents in an Electronic Marketplace, 3
rd
International
Conference on Materials for Advanced Technologies (ICMAT), 2005.
(Conference proceedings)
[29] D. Zeng, and K. Sycara. Benefit of learning negotiation,
AAAI,1997.(Conference proceedings)
[30] S. Hakami, Optimum location of switching centers and the
absolutecentersandmediansofagraph,OperationResearch,
vol.12,pp.450459
[31] R.M Rahman, K. Barker, and R. Alhajj, Replica Placement on
Data Grid: Considering Utility and Risk, IEEE International
ConferenceonCodingandComputing(ITCC),2005
[32] R.MRahman,K.Barker,andR.Alhajj,Replica Placement De
sign with Static Optimality and Dynamic Maintability,
IEEE/ACM International Symposium on Cluster Computing and
Grid(CCGrid),2006.(Conference proceedings)
[33] K.Shahidul,A.M.Rahman,andA.K.Azad,DiscoveringMod
elsfromEventBasedDataBasisonaSurveyofIssuesandAp
proaches, 2
nd
International Conference on Web & Semantic Tech
nology(WeST2010),Springer,2010
[34] M.Calzarossa,andG.Valli,AFuzzyAlgorithmforWebCach
ing,SocietyforComputerSimulation,vol.35,pp.630636,1999
[35] S.J.Mirabedini,M.Teshnehlab,andA.M.Rahmani,FLAR:An
Adaptive Fuzzy Routing Algorithm for Communications Net
works Using Mobile Ants, International Conference on Digital
ObjectIdentifier,ConvergenceInformationTechnology,pp.1308
1315,2007
[36] G. Di Caro, and M. Dorigo, Distributed reinforcement agents
foradaptiveroutingin communicationnetworks,3
rd
European
WorkshoponReinforcementLearning,Rennes,France,1997
[37] T.Pieter,V.Bruno,andD.L.Marc,ResourcePartitioningAlgo
rithms in a Programmable Service Grid Architecture, LNCS
3516,pp.250258,Springer,2007

Ashiqur Md. Rahman received his B.Sc. Degree in Computer
Science and Engineering from American International University
Bangladesh, Dhaka in January, 2004. He is currently perusing his
M.Sc. degree from North South University, Dhaka since January
2006. He has authored in 5 national and international journal and
conference papers in the area of Data Mining, VHDL, Cryptography
and PVc module design. His current research interest is in Grid
Computing especially in large Grid Environment.

Roksana Akter obtained the degree of Master of Science (M. Sc.)
and Bachelor of Science (B. Sc.) in Computer Science and Engi-
neering from the University of Dhaka, Bangladesh in 2004 and 2003
respectively. She is currently working as a senior lecturer in the de-
partment of Computer Science and Engineering, Southeast Universi-
ty, Dhaka, Bangladesh. Her current research interest is in computer
networks, network simulators, MANET, digital systems, data com-
munications, cryptography, information security and published seven
research papers in national and international journals and confe-
rence proceedings.

Rashedur M. Rahman received his Ph.D. Degree in Computer
Science from University of Calgary, Canada in November, 2007. He
has received his M.Sc. degree from University of Manitoba, Canada
in 2002 and Bachelor degree from Bangladesh University of Engi-
neering and Technology (BUET) in 2000 respectively. He is currently
working as an Assistant Professor in North South University, Dhaka,
Bangladesh. He has authored more than 25 international journal and
conference papers in the area of parallel, distributed, grid computing
and knowledge and data engineering. His current research interest is
in data mining especially on financial, educational and medical sur-
veillance data, data replication on Grid, and application of fuzzy logic
for grid resource and replica selection.

Fuzzy-Logic Based Self Adaptive Grid Architecture

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Fuzzy-Logic Based Self Adaptive Grid Architecture

Uploaded by

Copyright:

Available Formats

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617

Fig. 1. Multitier architecture of Grid environment. Graphical represen-

element Gi domain G and the j

Fig. 2. Fuzzy trust aggregation at the intra- and inter-site levels.

Fig. 3. Fuzzy system tuning process to upgrade site trust index.

Fig. 5. Membership functions for different levels of the trust indexI,

Fig. 7. Neuro-Fuzzy based negotiation mechanism flowchart.

Fig. 11. Membership function of Route Goodness (Y). ness of a

Where t is the number of traversed routes (or links) in

You might also like