摘要
This paper solves the problem of path selection for connection-oriented MPLS-based mesh networks. A novel network planning algorithm, called Capacity-Balanced Alternate Routing (C-BAR), is proposed. For C-BAR, alternate paths between each ingress-egress pair are defined at the network planning stage according to the network topology and the potential traffic load and location of each ingress-egress pair, so that the routing of label switched paths (LSPs) call take the most advantage of the load-balancing characteristic of the alternate paths. Both analytical and simulation-based studies are conducted to examine the proposed approach. The results show that the C-BAR algorithm call significantly improve the performance in blocking probability by spreading potential traffic load into the whole network compared with the other reported connection-oriented routing schemes.
- 出版日期2006-2