Traffic engineering label switched paths in IP networks using a pre-planned flow optimization model
暂无分享,去创建一个
We present a flow optimization model for IP networks where end-to-end paths are identified for each ingress-egress pair in the MPLS-capable part of the network. The model computes link- and path flows by incrementally distributing the offered traffic among the paths. Fault-tolerance and congestion control are achieved by spreading the offered traffic over a set of active paths. A set of back-up paths is reserved for carrying the traffic of failed or congested paths. The routing performance of this model is evaluated through two algorithms: weighted traffic distribution (WTD) and flow deviation (FLD). WTD distributes the offered traffic among the available paths using weights allocated to these paths. FLD is a variant of the well-known flow deviation algorithm.
[1] G. J. A. Stern,et al. Queueing Systems, Volume 2: Computer Applications , 1976 .
[2] Wayne D. Grover,et al. Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..
[3] Ram Dantu,et al. Constraint-Based LSP Setup using LDP , 2002, RFC.
[4] Curtis Villamizar,et al. MPLS Optimized Multipath (MPLS--OMP) , 1999 .
[5] Dimitri P. Bertsekas,et al. Data Networks , 1986 .