Subscribe Now Subscribe Today
 
FOLLOW US:     Facebook     Twitter
   
Journal of Artificial Intelligence
  Year: 2011 | Volume: 4 | Issue: 2 | Page No.: 143-155
DOI: 10.3923/jai.2011.143.155
Shortest Path Tree with Embedded Backups-an Exhaustive Link Failure Recovery Algorithm
Muhammad Aasim Qureshi, Mohd Fadzil Hassan, Rabia Sammi, Sohail Safdar and Rehan Akbar

Abstract:
In many applications like robot navigation, games, transportation and communication routing, shortest path plays an important role. In such applications vigorous and proficient recovery is vital. Planning for the recovery from failure with minimum additional healing cost, as well as no or least delay is desired. This study presents an algorithm to construct a tree that has all possible recovery plans embedded in it.
 [Fulltext PDF]   [Fulltext HTML]   [XML: Abstract + References]   [References]   [View Citation]  [Report Citation]
 RELATED ARTICLES:
  •    Structured Role Based Interaction Model for Agile Based Outsourced IT Projects: Client’s Composite Structure
  •    An Energy-Aware Cluster-Based Routing Protocol for Wireless Sensor and Actor Network
  •    Graph Algorithms and Shortest Path Problems: A Case of Djikstra’s Algorithm and the Dual Carriage Ways in Sokoto Metropolis
  •    A Novel Protection Architecture Scheme for EPON
How to cite this article:

Muhammad Aasim Qureshi, Mohd Fadzil Hassan, Rabia Sammi, Sohail Safdar and Rehan Akbar, 2011. Shortest Path Tree with Embedded Backups-an Exhaustive Link Failure Recovery Algorithm. Journal of Artificial Intelligence, 4: 143-155.

DOI: 10.3923/jai.2011.143.155

URL: http://scialert.net/abstract/?doi=jai.2011.143.155

 
COMMENT ON THIS PAPER
.
 
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

                 home       |       journals        |       for authors       |       for subscribers       |       asci
          © Science Alert. All Rights Reserved