Topological Embedding Feature Based Resource Allocation in Network Virtualization

Algorithm 1

Maximum-convergence-degree algorithm node embedding stage.

(1)  Sort the virtual networks in descending order

according to their revenues in a time

window.

(2)  for each virtual network with maximum revenue

do

sort the virtual nodes according to their required

resources VR in descending order

(3)  for each node with the largest VR do

assign the node onto the substrate node which not

only meets its’ CPU requirement, but also has the

maximum convergence-degree CSR

(4)  end for

(5)  if all nodes are embedded successfully then

return NODE_MAPPING_SUCCESS

(6)  else

postpone the virtual network into the waiting

Queue

return NODE_MAPPING_FAILED

(7)  end if

(8)  end for