An efficient algorithm to create a loop free backup routing table

Abujassar, Radwan S.; Ghanbari, M.

doi:10.1109/iccsn.2011.6014023

Cited by 2 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multipath routing has been introduced and considered in wireless ad-hoc networks for improving QoS and reliability of network performance [12]. In [13] we present a new algorithm for wired networks called the Alternative Routing Table (ART) algorithm, which sends messages to enquire if neighboring nodes have an alternative and disjointed pathway from the primary node to its destination. The number of data packets sent to each node will depend on the number of adjacent nodes that are not connected to the primary path.…”

Section: Related Workmentioning

confidence: 99%

A Driven Backup Routing Table to Find Alternative Disjoint Path in Ad Hoc Wireless

Abujassar¹,

Ghanbari²

2011

IJCNC

Self Cite

View full text Add to dashboard Cite

The performances of the routing protocols are important since they compute the primary path between source and destination. In addition, routing protocols need to detect failure within a short period of time when nodes move to start updating the routing table in order to find a new primary path to the destination. Meantime, loss of packets and end-to-end delays will increase thereby reducing throughput and degrading the performance of the network. This paper proposes a new algorithm, DBRT (Driven Backup Routing Table), to improve the existing proactive protocols such as DSDV (Destination Sequenced Distance Vector) protocol by creating a backup routing table to provide multiple alternative routes. The DBRT algorithm identifies adjacent nodes for each node in the same range and then selects one of these as a backup next hop according to the available path to the destination. The results show that loss of data packets, throughput and end-to-end delay times between source and destination are improved. The results show that the new protocol does not degrade the network's performance despite sending extra messages to construct and update the new backup routing table. Simulations (using an NS2 simulator) are undertaken to demonstrate the difference between using a DSDV protocol with or without the proposed schema.

show abstract

Section: Related Workmentioning

confidence: 99%

A Driven Backup Routing Table to Find Alternative Disjoint Path in Ad Hoc Wireless

Abujassar¹,

Ghanbari²

2011

IJCNC

Self Cite

View full text Add to dashboard Cite

show abstract

“…If the acknowledgement is positive, the adjacent node will send a message to the source saying "Yes, I have a disjoint path via me and my neighbours". The source node will then add the adjacent node as a first and her neighbours as second hop in the new backup routing table [1]. Figure 1(A) shows how adjacent nodes can have a disjoint path to the destination without being connected to the primary path.…”

Section: Art Reroute From Source To Destination (Artfp)mentioning

confidence: 99%

Efficient Algorithms to Enhance Recovery Schema in Link State Protocols

Abujassar¹,

Ghanbari²

2011

IJU

Self Cite

View full text Add to dashboard Cite

With the increasing demands for real-time applications traffic in net- works such as video and voice a high convergence time for the existing routing protocols when failure occurred is required. These applications can be very sensitive to packet loss when link/node goes down. In this paper, we propose two algorithms schemas for the link state protocol to reroute the traffic in two states; first, pre-calculated an alternative and disjoint path with the primary one from the source to the destination by re-routing traffic through it, regardless of the locations of failure and the number of failed links. Second, rerouting the traffic via an alternative path from a node whose local link is down without the need to wait until the source node knows about the failure. This is achieved by creating a new backup routing table based on the original routing table which is computed by the dijkstra algorithm. The goal of these algorithms is to reduce loss of packets, end-to-end delay time, improve throughput and avoiding local loop when nodes re-converge the topology in case of failure.Comment: 15 page

show abstract

An efficient algorithm to create a loop free backup routing table

Cited by 2 publications

References 4 publications

A Driven Backup Routing Table to Find Alternative Disjoint Path in Ad Hoc Wireless

A Driven Backup Routing Table to Find Alternative Disjoint Path in Ad Hoc Wireless

Efficient Algorithms to Enhance Recovery Schema in Link State Protocols

Contact Info

Product

Resources

About