A multi-constrained routing optimization algorithm in the IP networks

Nowadays, with the increasing scale of the IP network, the traffic flow demand also increases. And the situation of load imbalance is becoming more obvious. In the IP network, the failure of a link not only causes the interruption of the traffic flow on this link, but also makes the network operator pay the corresponding penalty to the user. So how to select an appropriate path to reduce the operator´s payment while achieving a balanced distribution of the traffic flow at the same time is a big challenge. Usually, traffic equilibrium is used as a routing optimization objective in traffic engineering in order to avoid network traffic flow congestion. In practical problems, the economic losses of the network operators also need to be taken into consideration. Existing link allocation methods often take the failure of links as connection problems and ignore the restrictions of the traffic flow, or only consider the traffic interruption and ignore the network operator´s economic losses caused by the failure of links. In this paper, we propose a routing optimization algorithm to achieve traffic equilibrium while reducing the potential penalty of the network operators at the same time. Experiments show that our algorithm can achieve traffic equilibrium and effectively reduce the network operator´s potential penalty.