Traffic engineering label switched paths in IP networks using apre-planned flow optimization model

摘要

We present a flow optimization model for IP networks whereend-to-end paths are identified for each ingress-egress pair in theMPLS-capable part of the network. The model computes link- and pathflows by incrementally distributing the offered traffic among the paths.Fault-tolerance and congestion control are achieved by spreading theoffered traffic over a set of active paths. A set of back-up paths isreserved for carrying the traffic of failed or congested paths. Therouting performance of this model is evaluated through two algorithms:weighted traffic distribution (WTD) and flow deviation (FLD). WTDdistributes the offered traffic among the available paths using weightsallocated to these paths. FLD is a variant of the well-known flowdeviation algorithm