eprintid: 1839
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/18/39
datestamp: 2023-11-09 15:50:00
lastmod: 2023-11-09 15:50:00
status_changed: 2023-11-09 15:41:27
type: article
metadata_visibility: show
creators_name: Qureshi, M.A.
creators_name: Hassan, M.F.
creators_name: Sammi, R.
creators_name: Safdar, S.
creators_name: Akbar, R.
title: Shortest path tree with embedded backups - An exhaustive link failure recovery algorithm
ispublished: pub
note: cited By 0
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. © 2011 Asian Network for Scientific Information.
date: 2011
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-80055048797&doi=10.3923%2fjai.2011.143.155&partnerID=40&md5=4e122b38f76b8458d475a46cb9400841
id_number: 10.3923/jai.2011.143.155
full_text_status: none
publication: Journal of Artificial Intelligence
volume: 4
number: 2
pagerange: 143-155
refereed: TRUE
issn: 19945450
citation:   Qureshi, M.A. and Hassan, M.F. and Sammi, R. and Safdar, S. and Akbar, R.  (2011) Shortest path tree with embedded backups - An exhaustive link failure recovery algorithm.  Journal of Artificial Intelligence, 4 (2).  pp. 143-155.  ISSN 19945450