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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings of the 2010 International Conference on Information and Emerging Technologies, ICIET 2010
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)978-1-4244-8003-6
ISBN (Print)9781424480012
DOIs
Publication statusPublished - 9 Nov 2010
Event2nd International Conference on Information and Emerging Technologies, ICIET 2010 - Karachi, Pakistan
Duration: 14 Jun 201016 Jun 2010

Conference

Conference2nd International Conference on Information and Emerging Technologies, ICIET 2010
Country/TerritoryPakistan
CityKarachi
Period14/06/1016/06/10

Keywords

  • algorithm
  • alternate shortest path
  • recovery mechanism
  • shortest path

Cite this