Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Embedded Backups for Link Failure Recovery in Shortest Path Trees
verfasst von : Muhammad Aasim Qureshi, Mohd Fadzil Hassan
Erschienen in: Software Engineering and Computer Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Shortest Path Tree Problem has always been a popular problem but with the devise of Dijkstra’s algorithm, SPT and many related problems received immense intention of researchers. Shortest Path Tree plays an important role in many applications like robot navigation, games, transportation and communication routing, etc. In many applications like network and vehicle routing, fast and reliable recovery from the failure is desired. Recovery from these failed links need means and/or plan, with least additional healing cost for the prolongation of the process with no or minimum delay. This paper presents an approach to recover from undesirable state of link failure(s) back to the normal state of working. A shortest path tree is being extracted from the graph with alternate path at each point (junction) keeping the cost as low as possible.