Disjoint Multi-Paths Routing For Dynamic Traffic Engineering

Experience shows that multiple loop-free paths may result in traffic converging again, it shifts congest from current link to another. In order to realize load balance in whole network, a new distributed algorithm for the dynamic computation of multiple disjoint paths from source to destination in a computer network or Internet is presented in this paper. According to this algorithm, which is called p-DMR (probability-Disjoint Multi-Paths Routing), each router maintains a set of entries for each destination in its routing table, and each such entry consists of a set of parameters specifying the next router and distance in a probability disjoint path to the destination. Probability disjoint path is a virtual disjoint path based on probability. p-DMR can discover relative valid multi-paths in complex network environment from which it is difficult for the pure disjoint multi-paths to be discovered. It is the main contribution in our working. Basing on p-DMR, we also propose a traffic balancing algorithm, it is combined to some dynamic adjustment ways, including bandwidth resource allocation and congestion restraint mechanism to avoid congestion happening and worsen. The average performance of p-DMR and the traffic engineering frame is analyzed by simulation and compared against Equal Cost Multi-path (ECMP).