Network-Aware Data Placement Strategy in Storage Cluster System

Algorithm 1

Request schedule algorithm.

	Input: n nodes in rack Rr, link load, storage load
	Output: data schedule queue Q
(1)	Initialization: D = {d1, d2, …, dm}
(2)	if s = 0 then
(3)	return LinkSelection(L)
(4)	end if
(5)	Q.addToQue(D) #add data block to queue
(6)	Q.sort() #Order by policy
(7)	for all data block d in Q do
(8)	return LinkSelection(L)
(9)	end for
(10)	end