A heuristic approach for path provisioning in Diff-Serv networks

To achieve QoS guarantees for predicted traffic with N quality levels in differentiated services (Diff-Serv) networks with M interior routers, an efficient heuristic algorithm for end-to-end congestion control is being developed. It can be applied as an effective tool for traffic engineering (TE) in MPLS-based networks or it can be used for network dimensioning in optimal sizing of transmission trunks, minimizing the total expansion cost. The heuristic algorithm is compared with an algorithm based on an 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 a heuristic approach can be successfully applied for MPLS-based traffic engineering in Diff-Serv networks.