Topological Embedding Feature Based Resource Allocation in Network Virtualization

Algorithm 2

Maximum-convergence-degree algorithm link embedding stage.

(1) Sort the virtual networks mapped successfully

in the node stage according to their revenues

in descending order

(2)   for each virtual network with maximum revenue

do

(3)    for each virtual link of the request do

(4)    if substrate network does not support

path splitting then

map virtual link using the -shortest paths

algorithm

(5)    else

map virtual link using the multi-commodity flow

algorithm

(6)    end if

(7)    end for

(8)    if all links are embedded successfully then

return LINK_MAPPING_SUCCESS

(9)    else

postpone the virtual network into the waiting

queue

      return LINK_MAPPING_FAILED

(10)  end if

(11)   end for