Muli-path Constraint-based Routing Algorithms for MPLS Traffic Engineering
暂无分享,去创建一个
This paper proposed two multi-path constraint-based routing algorithms for Internet traffic engineering using MPLS. In normal constraint-based shortest path first (CSPF) routing algorithm, there is a high probability that it cannot find the required path through networks for a large bandwidth constraint that is one of the most important constraints for traffic engineering, The proposed algorithms can divide the bandwidth constraint into two or more sub-constraints and find a constrained path for each sub-constraint, if there is no single path satisfying the whole constraint. Extensive simulations show that they enhance the success probability of path setup and the utilization of network resources.