Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs

Qureshi, M.A. and Hassan, M.F. and Safdar, S. and Akbar, R. and Sammi, R. (2010) Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs. In: UNSPECIFIED.

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

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. ©2010 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: cited By 4; Conference of 2nd International Conference on Information and Emerging Technologies, ICIET 2010 ; Conference Date: 14 June 2010 Through 16 June 2010; Conference Code:82941
Uncontrolled Keywords: Alternate path; Recovery costs; Recovery mechanism; Recovery mechanisms; Shortest path; Shortest path algorithms; Single link failure recovery; Single-link failures; Weighted undirected graph, Algorithms; Recovery, Graph theory
Depositing User: Mr Ahmad Suhairi UTP
Date Deposited: 09 Nov 2023 15:48
Last Modified: 09 Nov 2023 15:48
URI: https://khub.utp.edu.my/scholars/id/eprint/812

Actions (login required)

View Item
View Item