DocumentCode :
2911942
Title :
Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs
Author :
Aasim Qureshi, Muhammad ; Fadzil Hassan, Mohd ; Safdar, Sohail ; Akbar, Rehan ; Sammi, Rabia
Author_Institution :
Comput. & Inf. Sci. Dept., Univ. Technol. PETRONAS, Tronoh, Malaysia
fYear :
2010
fDate :
14-16 June 2010
Firstpage :
1
Lastpage :
5
Abstract :
Shortest path and related problems have been a very hot topic for researchers since Dijekstra devised his first shortest path algorithm. In transportation and communication routing, during the execution of system, failure of any link needs robust and most effective recovery. In such problems we need some recovery mechanism and/or plan for the continuation of the process with minimum or no delay with least, additional, recovery cost. This paper presents initial finding and achievements to recover from a single link failure on the shortest path with optimal alternate path keeping the cost low.
Keywords :
failure analysis; graph theory; optimisation; nonnegative weighted undirected graphs; optimal alternate path; precalculated single link failure recovery; recovery mechanism; shortest path algorithm; Complexity theory; Computer science; Education; Robots; Routing; Shortest path problem; Transportation; algorithm; alternate shortest path; recovery mechanism; shortest path;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information and Emerging Technologies (ICIET), 2010 International Conference on
Conference_Location :
Karachi
Print_ISBN :
978-1-4244-8001-2
Type :
conf
DOI :
10.1109/ICIET.2010.5625724
Filename :
5625724
Link To Document :
بازگشت