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

Algorithm 2

Edge mapping.

1: Take the request which has successfully passed the vertex mapping stage.

2: for (each_edge_in_the_request) do

 2.1: Search k-shortest paths incrementally between pair of vertices connected by the edge

     (mapped on nodes by the vertex mapping algorithm).

 2.2: Stop searching in above Step   2.1, when either edge demand is satisfied (according to edge

  mapping function, SPM) or all paths have been searched.

 2.3: If, edge request is not satisfied, then, GOTO 3, else, generate residual link capacities of the

  selected path according to (2b) and GOTO 4.

2.4: end for

3: If, this was the first edge of VN, then, return node resources to the substrate according to

(3a), else, return both the link and node resources to the substrate (as defined in (3a) and (3b)).

4: If this was the last request, then, stop, else, call “vertex mapping algorithm.”