eprintid: 1982
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/19/82
datestamp: 2023-11-09 15:50:09
lastmod: 2023-11-09 15:50:09
status_changed: 2023-11-09 15:41:45
type: article
metadata_visibility: show
creators_name: Qureshi, M.A.
creators_name: Hassan, M.F.
creators_name: Safdar, S.
creators_name: Akbar, R.
title: A framework to recover single link failure on shortest path in shortest path tree
ispublished: pub
note: cited By 1
abstract: Risk management in many applications become very important for the uninterrupted continuation of the process. Shortest path and many related path planning problems play a vital role in many applications like robot navigation, games, transportation and communication routing. In problems like these and many other, efficient and reliable recovery from the adverse situation with minimum additional healing cost and delay is always required. This study presents a framework to construct shortest path tree with embedded backups for single link failure on any location in shortest path from source to destination. This tree entertain one link failure at one point of time. The cost of the presented algorithms is as low as any shortest path tree algorithm. So it is providing additional feature in the same cost. © 2011 Asian Network for Scientific Information.
date: 2011
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-79960764727&doi=10.3923%2fjas.2011.2916.2923&partnerID=40&md5=7235b080791e60e1ed53d7bda309e938
id_number: 10.3923/jas.2011.2916.2923
full_text_status: none
publication: Journal of Applied Sciences
volume: 11
number: 16
pagerange: 2916-2923
refereed: TRUE
issn: 18125654
citation:   Qureshi, M.A. and Hassan, M.F. and Safdar, S. and Akbar, R.  (2011) A framework to recover single link failure on shortest path in shortest path tree.  Journal of Applied Sciences, 11 (16).  pp. 2916-2923.  ISSN 18125654