15 research outputs found
Efficient Algorithms to Enhance Recovery Schema in Link State Protocols
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
An efficient pre-computed backup path on the IGP network communication
Currently, data communication during heavy traffic transmission on the network suffers from node failures. A failure in the network is required to be restored by the routing protocols in the networks. Traditional routing protocols schemes normally compute a routing table which contains all paths between all nodes on the network. Hence, the data packets will be passed via the single shortest path which is the best path between each source and destination. In this paper, a pre-computed alternate path is introduced to assist the congested networks to continue passing the data packets from its source to the final destination once failure occurs. The proposed alternative routing table (ART) algorithm aims to re-route the traffic through a backup route when the primary path has failed. We have evaluated the performance of the proposed scheme with OSPF routing protocol through NS2 simulator. The results show that packet losses, rerouting and end to end delay times of the proposed methods are substantially improved
LAZY SHORTEST PATH COMPUTATION IN DYNAMIC GRAPHS
We address the problem of single-source shortest path computation in digraphs with non-negative edge weights subjected to frequent edge weight decreases such that only some shortest paths are requested in-between updates. We optimise a recent semidynamic algorithm for weight decreases previously reported to be the fastest one in various conditions, resulting in important time savings that we demonstrate for the problem of incremental path map construction in usersteered image segmentation. Moreover, we extend the idea of lazy shortest path computation to digraphs subjected to both edge weight increases and decreases, comparing favourably to the fastest recent state-of-the-art algorithm
Recent Advances in Fully Dynamic Graph Algorithms
In recent years, significant advances have been made in the design and
analysis of fully dynamic algorithms. However, these theoretical results have
received very little attention from the practical perspective. Few of the
algorithms are implemented and tested on real datasets, and their practical
potential is far from understood. Here, we present a quick reference guide to
recent engineering and theory results in the area of fully dynamic graph
algorithms