Sdh Network Resource Allocation Algorithm

Today, the resource allocation problem in SDH network is always very important. This dissertation researches on the static resource allocation problem of SDH network first, and then researches on the dynamic resource allocation problem of SDH network, especially the failure recovery problem.Chapter 2 researches on the static resource allocation problem of SDH network. For dedicated protection demands, we propose an algorithm based on critical link. For shared protection demands, we propose an algorithm based on shared sets. These algorithms ensure the success rate of demand assignment.Chapter 3 researches on the resource trap problem of static resource allocation in SDH network. This dissertation proposes a heuristic algorithm based on remotion. This algorithm moves paths with critical links, so route demands followed successfully and improve the overall performance of the network.Chapter 4 researches on the static resource allocation problem in Multi-Ring SDH Networks. For inter-ring demands, we propose an algorithm based on auxiliary graph, which ensures the success rate of demand assignment.Chapter 5 researches on the dynamic resource allocation problem in SDH network. The dissertation proposes a heuristic algorithm based on route pre-computed, which can recover failure for disabled demands as soon as possible, and recover disabled demands as much as possible.This dissertation also shows simulations for the above algorithms, and the results indicate these algorithms have good performance.