Shortest path tree with embedded backups - an exhaustive link failure recovery algorithm

Muhammad Aasim Qureshi*, Mohd Fadzil Hassan, Rabia Sammi, Sohail Safdar, Rehan Akbar

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)143-155
Number of pages13
JournalJournal of Artificial Intelligence
Issue number2
Publication statusPublished - 1 Apr 2011


  • algorithm
  • alternate shortest path
  • multiple links failure recover
  • recovery
  • shortest path

Cite this