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

doi:10.1109/ICIET.2010.5625724

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

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings of the 2010 International Conference on Information and Emerging Technologies, ICIET 2010
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	978-1-4244-8003-6
ISBN (Print)	9781424480012
DOIs	https://doi.org/10.1109/ICIET.2010.5625724
Publication status	Published - 9 Nov 2010
Event	2nd International Conference on Information and Emerging Technologies, ICIET 2010 - Karachi, Pakistan Duration: 14 Jun 2010 → 16 Jun 2010

Conference

Conference	2nd International Conference on Information and Emerging Technologies, ICIET 2010
Country/Territory	Pakistan
City	Karachi
Period	14/06/10 → 16/06/10

Keywords

algorithm
alternate shortest path
recovery mechanism
shortest path

Access to Document

10.1109/ICIET.2010.5625724

Cite this

Qureshi, M. A., Hassan, M. F., Safdar, S., Akbar, R., & Sammi, R. (2010). Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs. In Proceedings of the 2010 International Conference on Information and Emerging Technologies, ICIET 2010 Article 5625724 Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICIET.2010.5625724

@inproceedings{6cb2a0d64fcc49388b3ac9f8e66c1b16,

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

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 = "algorithm, alternate shortest path, recovery mechanism, shortest path",

author = "Qureshi, {Muhammad Aasim} and Hassan, {Mohd Fadzil} and Sohail Safdar and Rehan Akbar and Rabia Sammi",

year = "2010",

month = nov,

day = "9",

doi = "10.1109/ICIET.2010.5625724",

language = "English",

isbn = "9781424480012",

booktitle = "Proceedings of the 2010 International Conference on Information and Emerging Technologies, ICIET 2010",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2nd International Conference on Information and Emerging Technologies, ICIET 2010 ; Conference date: 14-06-2010 Through 16-06-2010",

}

Qureshi, MA, Hassan, MF, Safdar, S, Akbar, R & Sammi, R 2010, Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs. in Proceedings of the 2010 International Conference on Information and Emerging Technologies, ICIET 2010., 5625724, Institute of Electrical and Electronics Engineers Inc., 2nd International Conference on Information and Emerging Technologies, ICIET 2010, Karachi, Pakistan, 14/06/10. https://doi.org/10.1109/ICIET.2010.5625724

Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs. / Qureshi, Muhammad Aasim; Hassan, Mohd Fadzil; Safdar, Sohail et al.
Proceedings of the 2010 International Conference on Information and Emerging Technologies, ICIET 2010. Institute of Electrical and Electronics Engineers Inc., 2010. 5625724.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Qureshi, Muhammad Aasim

AU - Hassan, Mohd Fadzil

AU - Safdar, Sohail

AU - Akbar, Rehan

AU - Sammi, Rabia

PY - 2010/11/9

Y1 - 2010/11/9

N2 - 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.

AB - 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.

KW - algorithm

KW - alternate shortest path

KW - recovery mechanism

KW - shortest path

UR - http://www.scopus.com/inward/record.url?scp=78650580752&partnerID=8YFLogxK

U2 - 10.1109/ICIET.2010.5625724

DO - 10.1109/ICIET.2010.5625724

M3 - Conference contribution

AN - SCOPUS:78650580752

SN - 9781424480012

BT - Proceedings of the 2010 International Conference on Information and Emerging Technologies, ICIET 2010

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2nd International Conference on Information and Emerging Technologies, ICIET 2010

Y2 - 14 June 2010 through 16 June 2010

ER -

Qureshi MA, Hassan MF, Safdar S, Akbar R, Sammi R. Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs. In Proceedings of the 2010 International Conference on Information and Emerging Technologies, ICIET 2010. Institute of Electrical and Electronics Engineers Inc. 2010. 5625724 doi: 10.1109/ICIET.2010.5625724

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

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this