Efficient Routing Protection Algorithm in Large-scale Networks

Geng, Hua; Zhang, Han; Zhang, Yangyang

doi:10.32604/cmc.2020.013355

Cited by 4 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper uses three types of network topologies for experiments, the real network topology, the network topology published by Rocketfuel and the network topology generated by Brite. The real network topology includes Abilene, NJLATA, TORONTO and USLD [27]. The topologies published by Rocketfuel [27,28] are 1755 (Ebone), 3257 (Tiscali), and 3967 (Exodus).…”

Section: Network Topologymentioning

confidence: 99%

See 1 more Smart Citation

Efficient Routing Protection Algorithm Based on Optimized Network Topology

Geng¹,

Jin²,

Yao³

et al. 2022

Computers, Materials &Amp; Continua

Self Cite

View full text Add to dashboard Cite

Network failures are unavoidable and occur frequently. When the network fails, intra-domain routing protocols deploying on the Internet need to undergo a long convergence process. During this period, a large number of messages are discarded, which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers (ISP). Therefore, improving the availability of intra-domain routing is a trending research question to be solved. Industry usually employs routing protection algorithms to improve intra-domain routing availability. However, existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures, which increases the cost of the network and impedes the methods deployed in practice. To address the issues, this study proposes an efficient routing protection algorithm based on optimized network topology (ERPBONT). ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source purposes. Firstly, the backup path with the minimum path coincidence with the shortest path is described as an integer programming problem. Then the simulated annealing algorithm ERPBONT is used to find the optimal solution. Finally, the algorithm is tested on the simulated topology and the real topology. The experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path, and significantly improves the routing availability.

show abstract

Section: Network Topologymentioning

confidence: 99%

“…The real network topology includes Abilene, NJLATA, TORONTO and USLD [27]. The topologies published by Rocketfuel [27,28] are 1755 (Ebone), 3257 (Tiscali), and 3967 (Exodus). When using Brite to generate the topology, it is assumed that the link weights are symmetrical.…”

Section: Network Topologymentioning

confidence: 99%