Traffic routing in MPLS networks based on QoS estimation and forecast

Emerging applications demand strict quality of service from the network. To meet these demands, a suitable path with enough resources needs to be selected. The paper focuses on the path computation in an MPLS network for a traffic flow, based on distance, bandwidth and delay constraints. The goal of the paper is to find a feasible path that minimizes the cost incurred. The cost is attributed to bandwidth carriage, and switching and signaling efforts in the network for the requested connection.