Network-Aware Data Placement Strategy in Storage Cluster System

Algorithm 3

Node selection algorithm for link and storage load balancing.

	Input: n nodes in rack Rr, link load, storage load
	Output: the optimal node for placing one chunk
(1)	Initialization: Rr = {N1, N2, …, Nn}; FFn = {FF1, FF2, …, FFn}
(2)	for each node in Rr do
(3)	SL(n) = storage size of N/total storage capacity
(4)	LL(n) = link capacity from N to TOR/total link capacity from N to TOR
(5)	FF(n) = SL(n) + LL(n)
(6)	find the minimum FF(n)
(7)	return data node with minimum FF(n)
(8)	end