Virtual Network Embedding: A Hybrid Vertex Mapping Solution for Dynamic Resource Allocation

Algorithm 1

Vertex mapping.

1: Take a VN request.

2: Find a unique substrate node, for every vertex, having sufficient resources to satisfy the CPU demand,

(according to the selected vertex mapping function, BLA, HBNRM, or GNM), start from the vertex demanding most resources.

3: If all the vertices can be mapped at this stage, then, generate residual node capacities according to (2a), else, GOTO 5.

4: Call “edge mapping algorithm.”

5: If this was the last request, then, stop, else, GOTO 1.