Alternate path routing algorithm for traffic engineering in the Internet

Abstract

In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the network that are responsible for congestion. The traffic in the network is routed through the paths that have no or least number of critical links. This avoids congestion in the critical links and increases the performance of the network. The performance of the algorithm is compared with the shortest path (Dijkstra's) algorithm.

Original document

The different versions of the original document can be found in:

• https://digitalscholarship.unlv.edu/cgi/viewcontent.cgi?article=2443&context=rtds

• http://xplorestaging.ieee.org/ielx5/8532/26947/01197557.pdf?arnumber=1197557,

http://dx.doi.org/10.1109/itcc.2003.1197557

• https://dblp.uni-trier.de/db/conf/itcc/itcc2003.html#SubramanianM03,

https://digitalscholarship.unlv.edu/rtds/1444,

https://digitalscholarship.unlv.edu/cgi/viewcontent.cgi?article=2443&context=rtds,

https://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1197557,

https://academic.microsoft.com/#/detail/1831174789