...
remove best_candidate from candidate lists
else
return solution
go to A
Random Heuristic Algorithm
Input:
r : instance of a homing request consisting of demands (VNFs), constraint(s), objective function(s), and set of initial candidates for each demand.
available-candidates : list of available candidates to be evaluated for each of the demands in r
procedure Solution (r, available-candidates)
solution_path = null
for each d in r.demands
valid_cands = evaluate_constraints (d, available-candidates[d], solution_path)
solution_path[d] = random candidate from valid_cands
return solution_path