An Efficient Heuristic Algorithm for MPLS-Based Traffic Engineering
暂无分享,去创建一个
An efficient heuristic algorithm for end-to-end congestion control in MPLS-based networks is being developed. It can be applied as an effective tool for traffic engineering (TE) in differentiated services (Diff-Serv) networks with M interior routers, to achieve QoS guaranties for predicted traffic with N quality levels. Also, it can be used for network dimensioning in optimal sizing of transmission trunks, minimizing the total expansion cost. The heuristic algorithm is compared with algorithm based on exact approach. In all numerical test-examples the best possible result is achieved. It is obvious that heuristic option is very effective and for all cases it is possible to find the best result but with significant savings. It means that such heuristic approach can be successfully applied for MPLS-based traffic engineering in Diff-Serv networks.