An Efficient Algorithm to Create a Loop Free Backup Routing Table

摘要：

Traditional routing protocols schemes allow traffic to pass via the single shortest path. Pre-computing an alternative aims to route the traffic through it when the primary path goes down. A new algorithm schema has been proposed in this paper to find an alternative and disjoint path with primary one by creating a new backup routing table based on adjacent nodes for each node connected with the primary one. The results showing that loss packets, reroute and end to end delay times have been improved between source and destination with avoid loops on the network. The result obtained showed that new schema does not degrade from the network performance by sending additional messages to create a new backup routing table. The Simulation results (using NS2 simulator) show a comparison between existing link state protocol and the proposed algorithm.

关键词： component Link state ART (Alternative Routing Table) Dijkstra algorithm

作者: Radwan S. Abujassar Mohammed Ghanbari

作者单位: School of Computer Science and Electronic Engineering University of Essex Colchester, United Kingdom

会议类型: 国际会议

会议名称: 2011 International Conference on Information and Computer Networks(ICICN 2011)(2011年信息与计算机网络国际会议)

会议地点: 贵阳

会议语种:英文

页码: 148-152

在线出版日期: 2011-01-26（万方平台首次上网日期，不代表论文的发表时间）