Modified Bellman-Ford algorithm with forming the shortest and fallback paths and its application for telecommunication network stability improvement

Telecommunication system traffic is transmitted over the shortest path defined by routing protocols. In the case of channel failure or network node breakdown traffic should be quickly rerouted. However, the most known routing protocols are based on greedy algorithms for determination of the shortest paths (Dijkstra or Bellman-Ford algorithms). Therefore, result of mentioned algorithms application is a tree-type topology of overlay network for telecommunication system traffic transmission. In the case of failure this tree-type topology loses connection, and re-performing of algorithm for the shortest path determination is required that increases telecommunication system recovery time and reduces its stability. We propose to set a concurrent task for determination of fallback and redundant path for routing protocol shortest path determination algorithm that would be used under network element failure case that would improve network stability. This work presents solution for of the shortest path determination Bellman-Ford problem that is basic for routing protocols RIP, BGP, EBGP, IBGP, IGRP, EIGRP. Modified Bellman-Ford algorithm for fallback path forming utilizes data of node edges. It provides total telecommunication system improvement to values in proportion to network connectivity and topological complexity by preliminary forming of network fallback paths and rapid transitions to fallback channels without time spending for new paths searching.