Table 1 Resource optimization algorithm

for\( {t}_{p,q}^{m,n} \)do

 Invoking the K algorithm in G^L(V^L, E^L) and calculate the shortest path from \( {v}_p^m \)to \( {v}_q^n \), then range the path according to its length: P = {p₁, p₂, …p_k, };

for p_k ∈ P do

 In this path, take the input node and output node of every domain regard as the source node and the sink node of a sub path in this domain. Produce the business requirements of every domain, and send them to the related controller;

if All domain return OK

 Path creation successful, jump out;

else

 Path creation fail, the loop go on;

end if

end for

end for