Abstract:

The path selection for members of virtual concatenation group is non-deterministic polynomial（NP） complete problem in synchronous digital hierarchy(SDH) networks applying virtual concatenation technology. Two-sided constrained optimal path (TSOP) algorithm was proposed to maintain high utilization of network resources and ensure the new adding VC-n to satisfy the differential delay constraints. Simulations results showed the performance of TSOP algorithm is superior to those of k-shortest path algorithm and modified-link-weight k-shortest path algorithm.

Key words: link capacity adjustment scheme, virtual concatenation, two-sided constrained optimal path algorithm