Nothing Special   »   [go: up one dir, main page]

Skip to main content

Key-Attributes Based Optimistic Data Consistency Maintenance Method

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4742))

  • 792 Accesses

Abstract

Peer-to-peer distributed storage systems usually replicate data objects on multi-node to improve the performance and availability. However, updates may be delayed for P2P systems are generally large-scale and strong distributed, and then the performance of resource location in Internet would be depressed. According to that, an optimistic data consistency maintenance method based on key-attributes is proposed. In the method, updates about key-attributes are separated from user request. Key-updates are propagated by latency-overlay update propagation model, that is, updates are always propagated to nodes having maximum or minimal latency, and assured and uncertain propagation paths of updates are all taken into account. Based on classifying key-update conflicts, a double-level reconciling mechanism including the preprocessing of buffer and the processing of update-log is applied to detect and reconcile conflicts, and then conflicts are solved by policies of last-writer-win and divide-and-rule. Lastly, the technique of managing and maintaining update-log is discussed for the above is deployed based on the information storied in update-log. Delaying key-attributes updates cannot occur by the optimistic disposal method, and then it cannot depress efficiency of resource location based on key-attributes, which adapts well to P2P systems in Internet. The simulation results show it is an effective optimistic consistency maintenance method, achieves good consistency overhead, resource location and access overhead, and has strong robustness.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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.

Similar content being viewed by others

References

  1. Dahlin, M., Gao, L., Nayate, A., Venkataramani, A., Yalagandula, P., Zheng, J.: PRACTI: Replication for Large-scale Systems. Technical Report, TR-04-28, University of Texas at Austin, Austin (2004)

    Google Scholar 

  2. Saito, Y., Karamanoli, C., Karlsson, M., Mahalingam, M.: Taming Aggressive Replication in the Pangaea Wide-area File System. In: Proceedings of the fifth symposium on Operating systems design and implementation, pp. 15–30. ACM Press, New York (2002)

    Google Scholar 

  3. Byung, B., Kang, H.: S2D2: A framework for scalable and secure optimistic replication [Ph.D. Thesis]. University of California, Berkeley (2004)

    Google Scholar 

  4. van Renesse, R., Schneider, F.B.: Chain replication for supporting high throughout and availability. In: Proceedings of sixth symposium on operating systems design & implementation (OSDI 2004), San Francisco, CA (2004)

    Google Scholar 

  5. Wang, Z., Das, S.K., Kumar, M., Shen, H.: Update Propagation through Replica Chain in Decentralized and Unstructured P2P Systems. In: P2P 2004. Proceedings of the 4th IEEE International Conference on Peer-to-Peer Computing, pp. 64–71. IEEE Computer Society, Washington (2004)

    Google Scholar 

  6. Leontiadis, E., Dimakopoulos, V.V., Pitoura, E.: Creating and Maintaining Replicas in Unstructured Peer-to-Peer Systems. Technical Report, TR2006 -01, Department of Computer Science, University of Ioannina, Ioannina, Greece (2006)

    Google Scholar 

  7. Yu, H., Vahdat, A.: Consistent and Automatic Replica Regeneration. ACM Transactions on Storage 1(1), 3–37 (2005)

    Article  Google Scholar 

  8. Vecchio, D.D., Son, S.H.: Flexible Update Management in Peer-to-Peer Database Systems. In: IDEAS 2005. Proceedings of the 9th International Database Engineering & Application Symposium, pp. 435–444. IEEE Computer Society, Washington (2005)

    Google Scholar 

  9. Wang, Z., Kumar, M., Das, S.K., Shen, H.: File Consistency Maintenance through Virtual Servers in P2P Systems. In: ISCC 2006. Proceedings of the 11th IEEE Symposium on Computers and Communications, pp. 435–441. IEEE Computer Society, Washington (2006)

    Google Scholar 

  10. Loukopoulos, T., Ahmad, I., Papadias, D.: An Overview of Data Replication on the Internet. In: ISPAN. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, pp. 694–711. IEEE Computer Society, Los Alamitos (2002)

    Google Scholar 

  11. Petersen, K., Spreitzer, M.J., Terry, D.B.: Flexible update propagation for weakly consistent replication. In: 16th ACM Symposium on Operating Systems Principles, pp. 288–301. ACM Press, New York (1997)

    Chapter  Google Scholar 

  12. Bell, W.H., Cameron, D.G., Capozza, L., Millar, P., Stockinger, K., Zini, F.: Optorsim: a grid simulator for studying dynamic data replication strategies. International Journal of High Performance Computing Applications 17(4), 403–416 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ivan Stojmenovic Ruppa K. Thulasiram Laurence T. Yang Weijia Jia Minyi Guo Rodrigo Fernandes de Mello

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, J., Wang, Y., Li, S. (2007). Key-Attributes Based Optimistic Data Consistency Maintenance Method. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74742-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74741-3

  • Online ISBN: 978-3-540-74742-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics