Research Article
Location-Constrained Virtual Machine Placement (LCVP) Algorithm
Algorithm 3
Heuristic maximum clique algorithm.
| input: CG , PM-graph , VM-graph | | output: Maximum clique M | (1) | ; | (2) | ;//put all corresponding physical links of the nodes in CG into the set | (3) | for each in nonincreasing order of do | | //obtain the physical links with sufficient bandwidth to carry and store them in | (4) | | (5) | if then | (6) | return (FALSE); //return failure status | (7) | endif | | select from with the minimum h-parameter defined by equation (12); | (8) | | (9) | ;//only conserve the compatible physical links as candidates for following virtual links. | (10) | update computing resources; | (11) | endfor | (12) | update computing resources; | (14) | return (TRUE); //return success status |
|