糾刪碼(erasure code)架構之多雲儲存服務的資料擺放最佳化方法設計與實作

隨著處存需求的逐年增加，雲端處存系統變得越來越重要。雲端供應商提供了巨大但是便宜的處存服務。人們或是公司可以在使用的同時減少了維護硬體及電力的費用。同時公司也能夠將其轉化為自己的服務。對於雲端儲存而言，糾刪碼被用來增進檔案可取得性而且有降低存取檔案時間的潛力。糾刪碼將檔案轉化成許多的片段。這些片段都比原本的檔案小，如此一來可以透過用平行下載的方式來降低下載時間。此外，這些片段也可以放在不同的儲存區域進而降低遇到發生區域毀壞的情況。然而，每個儲存區域都有不同的存取花費，儲存花費跟傳輸花費。有了這些議題，重點就在於如何選擇選擇候選儲存區域來擺放片段以滿足所有要求。在過去的研究中著重於單一的特性，並且不夠實際。在現實世界中需要考量的因素非常的多。在本篇論文中，我們使用了糾刪碼與線性規劃來找到最好的擺放方法。實驗顯示我們的方法可以省下有66%的金錢以及在效能上有50%的提升。

關鍵字

糾刪碼；線性規劃；多雲端空間

並列摘要

The cloud storage system has been popular recently due to the higher and higher demand of storage space. The cloud providers offer large but cheap storage service. People or companies use them and do not have to pay on hardware or electric utility. Companies can use these features to build its own storage service for benefit too. For cloud storage, erasure code can be used to improve data availability and have potential to reduce download time. Erasure code encode files into chunks and place them in different storage regions for higher availability. Besides, these chunks is smaller than the origin file that the download time can be reduced by using parallel downloading. These chunks can also improve the availability by placed at different regions for avoiding regions failure. However, each region owns different request cost, storage cost or even latency and bandwidth. Besides, users location can largely influence download latency and access cost. With these multiple issues, the main point is how to choose the candidate regions for chunks that can fulfill all requirements. In the past, most thesiss focus on specific features. However, the models from those research are not realistic enough. There are many aspects that we need to take into consideration for being closer to the real world. In this thesis, we propose the method with using erasure code and linear programming to include multiple requirements at the same time and find the best placement strategy. The experiment shows that our work can save money at most 66\% and have at most 50\% performance improvement.

並列關鍵字

Erasure Code ； Linear Programming ； Multi-Cloud Storage

參考文獻

[11] A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh. A survey on network codes for distributed storage. Proceedings of the IEEE, 99(3):476–489, March 2011.

[12] K. S. Esmaili, A. Chiniah, and A. Datta. Efficient updates in cross-object erasure-coded storage systems. In 2013 IEEE International Conference on Big Data, pages 28–32, Oct 2013.

[14] S. Ghemawat, H. Gobioff, and S.-T. Leung. The google file system. In Pro- ceedings of the Nineteenth ACM Symposium on Operating Systems Principles, SOSP ’03, pages 29–43, New York, NY, USA, 2003. ACM.

[15] Y. Hu and D. Niu. Reducing access latency in erasure coded cloud storage with local block migration. In IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, pages 1–9, April 2016.

[19] O. T. Lee, S. D. M. Kumar, and P. Chandran. Erasure coded storage systems for cloud storage x2014; challenges and opportunities. In 2016 International Conference on Data Science and Engineering (ICDSE), pages 1–7, Aug 2016.

國際替代計量

糾刪碼(erasure code)架構之多雲儲存服務的資料擺放最佳化方法設計與實作

全文下載

主題瀏覽