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

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

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, Rehan Akbar

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	143-155
Number of pages	13
Journal	Journal of Artificial Intelligence
Volume	4
Issue number	2
DOIs	https://doi.org/10.3923/jai.2011.143.155
Publication status	Published - 1 Apr 2011

Keywords

algorithm
alternate shortest path
multiple links failure recover
recovery
shortest path

Access to Document

10.3923/jai.2011.143.155

Cite this

@article{05a6de2138c4408b8b74757b3bf866e2,

title = "Shortest path tree with embedded backups - an exhaustive link failure recovery algorithm",

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.",

keywords = "algorithm, alternate shortest path, multiple links failure recover, recovery, shortest path",

author = "Qureshi, {Muhammad Aasim} and Hassan, {Mohd Fadzil} and Rabia Sammi and Sohail Safdar and Rehan Akbar",

year = "2011",

month = apr,

day = "1",

doi = "10.3923/jai.2011.143.155",

language = "English",

volume = "4",

pages = "143--155",

journal = "Journal of Artificial Intelligence",

issn = "1994-5450",

publisher = "Asian Network for Scientific Information",

number = "2",

}

TY - JOUR

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

AU - Qureshi, Muhammad Aasim

AU - Hassan, Mohd Fadzil

AU - Sammi, Rabia

AU - Safdar, Sohail

AU - Akbar, Rehan

PY - 2011/4/1

Y1 - 2011/4/1

N2 - 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.

AB - 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.

KW - algorithm

KW - alternate shortest path

KW - multiple links failure recover

KW - recovery

KW - shortest path

UR - http://www.scopus.com/inward/record.url?scp=80055048797&partnerID=8YFLogxK

U2 - 10.3923/jai.2011.143.155

DO - 10.3923/jai.2011.143.155

M3 - Article

AN - SCOPUS:80055048797

SN - 1994-5450

VL - 4

SP - 143

EP - 155

JO - Journal of Artificial Intelligence

JF - Journal of Artificial Intelligence

IS - 2

ER -

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

Abstract

Keywords

Access to Document

Fingerprint

Cite this