Articles
| Open Access | Based on an analysis of Amazon S3, real service simulation techniques are used to study the latency performance of distributed storage systems
Abstract
To create the parity nodes, current erasure codes mainly rely on data nodes. "If we can increase the number of parity nodes, we may increase our chances of restoring the original data," the more error tolerance there is. Because data nodes are frequently queried to aid in the repair of parity nodes, as the number of parity nodes increases, so will the storage overhead and the burden of repair on data nodes. For example, all data nodes in LRC [25, 26] need to be fixed if a global parity node fails. The "increasing demands on the network's data nodes" mean that processing read requests for data nodes will take longer. A program where regular data and FH HTSC, or High Failure-tolerant Hierarchical Tree Structure Code."
Keywords
Data Nodes, Data Retrieval, Hierarchical Tree Structure
References
Article Statistics
Downloads
Copyright License
Copyright (c) 2024 SU RIGUGE, DR MOHAMMAD NIZAMUDDIN INAMDAR (Author)
This work is licensed under a Creative Commons Attribution 4.0 International License.
Download Citations
How to Cite
Download Citation
Cite This Article
Copyright
Copyright (c) 2024 SU RIGUGE, DR MOHAMMAD NIZAMUDDIN INAMDAR (Author)
This work is licensed under a Creative Commons Attribution 4.0 International License.
This License permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Comment This Article
Similar Articles
- YU XIANGXIAN, DR ZURINAWATI BINTI MOHI, DR. ABHIJIT GHOSH , Analyzing Sustainability Challenges in a Traditional Chinese Water Town as a Hub for Cultural Tourism , Journal of Management and Architecture Research: Vol. 6 No. 02 (2024): Volume 06 Issue 02
- Dr. Kavita Desai, Ritu Sharma, TRANSFORMING URBAN AESTHETICS: INVESTIGATING STREET ART'S INFLUENCE ON CITIZEN ENGAGEMENT AND PERCEPTION , Journal of Management and Architecture Research: Vol. 7 No. 08 (2025): Volume 07 Issue 08
You may also start an advanced similarity search for this article.