Skip to main content
SpringerLink
Log in

Selecting the Optimal Recovery Path in Backup Systems

  • Conference paper
  • First Online:
Advanced Techniques in Computing Sciences and Software Engineering

  • 2349 Accesses

Abstract

This work examines the problem of creating a universal recovery path search algorithm in backup systems. The possibility of applying the graph theory is investigated. Various algorithms are examined and their selections are substantiated. Recommendations are presented for realizing the proposed method.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. A. L. Chervenak, V. Vellanki, Z. Kurmas, and V. Gupta. “Protecting file systems: a survey of backup techniques”, in proceedings, Joint NASA and IEEE Mass Storage Conference, 1998. www.isi.edu/~annc/papers/mss98final.ps

  2. Z. Kurmas, A. Chervenak. “Evaluating backup algorithms”, proc. of the Eighth Goddard Conference on Mass Storage Systems and Technologies, 2000. http://www.cis.gvsu.edu/~kurmasz/papers/kurmas-MSS00.pdf

  3. A. Costello, C. Umans, and F. Wu. “Online backup and restore.” Unpublished Class Project at UC Berkeley, 1998. http://www.nicemice.net/amc/research/backup/

  4. Z. Kurmas. “Reasoning Behind the Z Scheme,” 2002. http://www.cis.gvsu.edu/~kurmasz/Research/BackupResearch/rbzs.html

  5. Christofides, N., Graph Theory–An Algorithmic Approach, Academic Press, London, 1975.

    MATH  Google Scholar 

  6. D. Eppstein. “Finding the k shortest paths”, 35th IEEE Symp. Foundations of Comp. Sci., Santa Fe, 1994, pp. 154-165. http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-26.pdf

  7. M. M. B. Pascoal, “Implementations and empirical comparison for K shortest loopless path algorithms,” The Ninth DIMACS Implementation Challenge: The Shortest Path Problem, November 2006. http://www.dis.uniroma1.it/~challenge9/papers/pascoal.pdf

  8. Dijkstra E. W. (1959), “A note on two problems in connection with graphs,” Numerische Mathematik, 1, p. 269.

    Google Scholar 

  9. E. Q. V. Martins, M. M. B. Pascoal and J. L. E. Santos, “The K shortest paths problem,” CISUC, 1998. http://www.mat.uc.pt/~marta/Publicacoes/k_paths.ps.gz

  10. J. Y. Yen. “Finding the K shortest loopless paths in a network,” Management Science, 17:712–716, 1971.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgment

This work was supported in part by The Foundation for Assistance to Small Innovative Enterprises (FASIE).

Author information

Authors and Affiliations

  1. Mordovian State University, Bolshevistskaya street, 68, 430005, Saransk, Russian Federation

    V.G. Kazakov & S.A. Fedosin

Authors
  1. V.G. Kazakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S.A. Fedosin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V.G. Kazakov .

Editor information

Editors and Affiliations

  1. School of Engineering, University of Bridgeport, University Avenue 221, Bridgeport, 06604, U.S.A.

    Khaled Elleithy

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media B.V.

About this paper

Cite this paper

Kazakov, V., Fedosin, S. (2010). Selecting the Optimal Recovery Path in Backup Systems. In: Elleithy, K. (eds) Advanced Techniques in Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3660-5_50

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-3660-5_50

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-3659-9

  • Online ISBN: 978-90-481-3660-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation