Skip to main content
SpringerLink
Log in

Embedded Backups for Link Failure Recovery in Shortest Path Trees

  • Conference paper
Software Engineering and Computer Systems (ICSECS 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 180))

Included in the following conference series:

  • 1719 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zhang, B., Zhang, J., Qi, L.: The shortest path improvement problems under Hamming distance. Journal of Combinatorial Optimization 12, 351–361 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Safdar, S., Hassan, M.F.: Moving Towards Two Dimensional Passwords. In: 4th International Symposium on Information Technology, pp. 891–896 (2010)

    Google Scholar 

  3. Safdar, S., Hassan, M.F.: Framework for Alternate Execution of workflows under threat. In: 2nd International Conference on Communication Software and Networks, Singapore (2010)

    Google Scholar 

  4. Akbar, R., Hassan, M.F.: Limitations and Measures in Outsourcing Projects to Geographically Distributed Offshore Teams. In: 4th International Symposium on Information Technology, KL, Malaysia, pp. 1581–1585 (2010)

    Google Scholar 

  5. Akbar, R., Hassan, M.F.: A Collaborative–Interaction Approach of Software Project Development–An Extension to Agile Base Methodologies. In: 4th International Symposium on Information Technology, KL, Malaysia, pp. 133–138 (2010)

    Google Scholar 

  6. Qureshi, M.A., Maqbool, O.: The Complexity of Teaching: Computability and Complexity. In: International Conference on Teaching and Learning 2007, INTI International University College at Putrajaya, Malaysia (2007)

    Google Scholar 

  7. Qureshi, M.A., Maqbool, O.: The Complexity of Teaching: Computability and Complexity. INTI Journal Special Issue on Teaching and Learnning 1, 171–182 (2007)

    Google Scholar 

  8. Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hershberger, J., Suri, S., Bhosle, A.M.: On the Difficulty of Some Shortest Path Problems. ACM Transactions on Algorithms 3, 1–15 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Pettie, S., Ramachandran, V., Sridhar, S.: Experimental evaluation of a new shortest path algorithm. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 126–142. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Thorup, M.: Floats, Integers, and Single Source Shortest Paths. Journal of Algorithms 35, 189–201 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Thorup, M.: Floats, Integers, and Single Source Shortest Paths *. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, Springer, Heidelberg (1998)

    Google Scholar 

  13. Raman, R.: Recent Results on the Single-Source Shortest Paths Problem. SIGACT News 28, 81–87 (1997)

    Article  Google Scholar 

  14. Bhosle, A.M., Gonzalez, T.F.: Efficient Algorithms for Single Link Failure Recovery and Its Application to ATM Networks. In: 15th IASTED Intl. Conf. on PDCS, pp. 87–92 (2003)

    Google Scholar 

  15. Bhosle, A.M., Gonzalez, T.F.: Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links. eprint arXiv:0811.1301, vol. abs/0811.1 (2008)

    Google Scholar 

  16. Li, Y., Nie, Z., Zhou, X.: Finding the Optimal Shortest Path Tree with Respect to Single Link Failure Recovery. In: Fourth International Conference on Networked Computing and Advanced Information Management, pp. 412–415. IEEE, Los Alamitos (2008)

    Chapter  Google Scholar 

  17. Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R., Sammi, R.: Shortest Path Algorithm With Pre-calculated Single Link Failure Recovery for Non-Negative Weighted Undirected Graphs. In: International Conference on Information and Emerging Technologies (ICIET), pp. 1–5 (2010)

    Google Scholar 

  18. Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R.: A Near Linear Shortest Path Algorithm for Weighted Undirected Graphs. In: 2011 IEEE Symposium on Computers & Informatics, KL, Malaysia (2011) (accepted)

    Google Scholar 

  19. Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R.: Two Phase Shortest Path Algorithm for Non-negative Weighted Undirected Graphs. In: IEEE 2010 Second International Conference on Communication Software and Networks, pp. 223–227 (2010)

    Google Scholar 

  20. Qureshi, M.A., Hassan, M.F.: Improvements over Two Phase Shortest Path Algorithm. In: 4th International Symposium on Information Technology, ITSIM 2010 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Information Sciences Department, Universiti Technologi PETRONAS, Perak, Malaysia

    Muhammad Aasim Qureshi & Mohd Fadzil Hassan

Authors
  1. Muhammad Aasim Qureshi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohd Fadzil Hassan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, Lebuhraya Tun Razak, 26300 Gambang, Kuantan, Pahang, Malaysia

    Jasni Mohamad Zain

  2. Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, Lebuhraya Tun Razak, 26300, Gambang, Kuantan, Pahang, Malaysia

    Wan Maseri bt Wan Mohd

  3. Information Systems Department, King Saud University, 11543, Riyadh, Saudi Arabia

    Eyas El-Qawasmeh

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Qureshi, M.A., Hassan, M.F. (2011). Embedded Backups for Link Failure Recovery in Shortest Path Trees. In: Zain, J.M., Wan Mohd, W.M.b., El-Qawasmeh, E. (eds) Software Engineering and Computer Systems. ICSECS 2011. Communications in Computer and Information Science, vol 180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22191-0_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22191-0_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22190-3

  • Online ISBN: 978-3-642-22191-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation