▁load ▁of ▁candidate ▁servers . ▁ ▁A ▁candidate ▁server ▁may ▁have ▁sufficient ▁storage ▁space ▁but ▁be ▁serv icing ▁many ▁clients ▁for ▁access ▁to ▁stored ▁files . ▁Pla cing ▁a ▁rep licate ▁on ▁this ▁candidate ▁could ▁deg rade ▁performance ▁for ▁all ▁clients ▁accessing ▁this ▁candidate ▁server . ▁Therefore , ▁pla cement ▁of ▁rep lic as ▁with ▁this ▁method ▁is ▁done ▁by ▁evalu ating ▁each ▁candidate ▁node ▁for ▁access ▁load ▁to ▁find ▁a ▁suitable ▁node ▁for ▁the ▁pla cement ▁of ▁the ▁rep lica . ▁If ▁all ▁candidate ▁nodes ▁are ▁equival ently ▁r ated ▁for ▁access ▁load , ▁none ▁or ▁less ▁accessed ▁than ▁the ▁other , ▁then ▁the ▁candidate ▁node ▁with ▁the ▁lowest ▁storage ▁load ▁will ▁be ▁chosen ▁to ▁host ▁the ▁rep lic as . ▁Similar ▁methods ▁to ▁the ▁other ▁described ▁rep lication ▁methods ▁are ▁used ▁to ▁remove ▁un used ▁or ▁lower ▁requested ▁rep licates ▁if ▁needed . ▁Rep lic as ▁that ▁are ▁removed ▁might ▁be ▁moved ▁to ▁a ▁parent ▁node ▁for ▁later ▁reuse ▁should ▁they ▁become ▁popular ▁again . ▁ ▁Other ▁rep lication ▁The ▁above ▁three ▁rep lica ▁strateg ies ▁are ▁but ▁three ▁of ▁many ▁possible ▁rep lication ▁strateg ies ▁that ▁may ▁be ▁used ▁to ▁place ▁rep lic as ▁within ▁the ▁data ▁grid ▁where ▁they ▁will ▁improve ▁performance ▁and ▁access . ▁Below ▁are ▁some ▁others ▁that ▁have ▁been ▁proposed ▁and ▁tested ▁along ▁with ▁the ▁previously ▁described ▁rep lication ▁strateg ies . ▁▁ ▁St atic ▁– ▁uses ▁a ▁fixed ▁rep lica ▁set ▁of ▁nodes ▁with ▁no ▁dynamic ▁changes ▁to ▁the ▁files ▁being ▁rep licated . ▁