The MinNLP based on minimum node and priority load is proposed aimed at limitation of the existing node mapping algorithm on the node load. The strategy uses node memory load as duty cycles parameter, chooses the minimum load and large residual resources of physical nodes to accept the mapping by calculating the load strength of the physical node, and uses the K shortest path algorithm to link the mapping between the nodes. The experimental results show that the mapping strategy based on minimum node and priority load and combined with K shortest path to construct logical bearer network node c...
