資料命名網路(Named Data Networking, NDN)是一個以資料為中心 計的未來網路架構，此新穎的網路架構設計，使得資料命名網路可以解 決一些目前傳統網路所遇到的問題及困境，被視為下一個新的網際網路候選人之一。
在傳送大的檔案的時候，NDN會把檔案切成好幾個小的塊備份在這條producer到consumer的路徑上，這樣備份的方法就像多副本複制一樣，因此我們想用糾刪碼的技術來代替，因為糾刪碼比多副本複制好的地方就是能以更小的儲存代價來獲得相同可靠性，然而NDN的備份方式很容易將緩存中的備份替換掉，所以我們導入異地備援的概念提出NBDS。

本文提出了一種名為Named data networking Backup Data System (NBDS)的命名數據聯網備份數據系統，它結合了命名數據聯網的概念和遠程備份的概念，可以更有效地分配網絡資源，為消費者提供保證帶寬，解決數據替換問題。為了減少空間消耗，保持數據的可靠性，NBDS還集成了糾刪碼。與多副本複制相比，糾刪碼可以實現更高的可靠性和更少的數據冗餘。考慮到可靠性和傳輸性能。 NBDS 還使用糾刪碼備份算法 erasure code backup algorithm(ECBA) 來尋找到消費者的平均跳數最低的存儲節點，提供保證的帶寬並保持備份塊彼此遠離。為了評估我們的解決方案，我們為不同的網絡拓撲隨機生成節點和鏈接，並將我們提出的 ECBA 與 NDN 最短路徑和隨機進行比較。仿真結果表明，我們提出的 ECBA 比其他兩種方法具有更好的性能。

In the Named Data Networking, when sending a large file, NDN will cut the file into several small chunks and back it up on the path from producer to consumer, the backup method is like multi-copy, so we want to use erasure code technology to backup, because erasure code is better than multi-copy in that it can achieve the same reliability at a smaller storage cost. However, the routing method of NDN will easily replace the backup in the cache, so we import remote backup concept.

This paper proposes a Named data networking Backup Data System called NBDS, which combines the concept of named data networking and remote backup concept, which can allocate network resources more efficiently, provide more bandwidth for consumer and resolve data replacement. In order to reduce space consumption and maintain the reliability of data, NBDS also integrates erasure coding.

Compared with multi-copy replication, erasure codes can achieve higher reliability with less data redundancy. With the consideration on reliability and transmission performance. NBDS also uses the erasure code backup algorithm(ECBA ) to find the storage node with the lowest average hops to the consumer, provides the bandwidth guaranteed and keeps backup chunks far from each other. To evaluate our solution, we randomly generate nodes and links for different network topologies, and compare our proposed ECBA with NDN shortest path and random select. Simulation results show that our proposed ECBA has the better performance than the other two methods.

[1] V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, “Networking named content,” in Proceedings of the 5th international con- ference on Emerging networking experiments and technologies, pp. 1–12, 2009.
[2] L.Zhang,A.Afanasyev,J.Burke,V.Jacobson,K.Claffy,P.Crowley,C.Papadopou- los, L. Wang, and B. Zhang, “Named data networking,” ACM SIGCOMM Computer Communication Review, vol. 44, no. 3, pp. 66–73, 2014.
[3] M. Arregoces and M. Portolani, Data center fundamentals. Cisco Press, 2003.
[4] B. A. Forouzan, TCP/IP protocol suite. McGraw-Hill Higher Education, 2002.
[5] W. Stevens, “Tcp slow start, congestion avoidance, fast retransmit, and fast recovery algorithms,” tech. rep., 1997.
[6] W.Lin,D.M.Chiu,andY.Lee,“Erasurecodereplicationrevisited,”inProceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings., pp. 90–97, IEEE, 2004.
[7] T. Lan, D. Kao, M. Chiang, and A. Sabharwal, An axiomatic theory of fairness in network resource allocation. IEEE, 2010.
[8] A. Vagin and A. Teplyakov, “An approach to multi-copy search in molecular re- placement,” Acta Crystallographica Section D: Biological Crystallography, vol. 56, no. 12, pp. 1622–1624, 2000.
[9] T. Zhu, M. Guo, Z. Tang, M. Zhang, Y. Zhuang, J. Chu, and S. Zhang, “Efficient generation of multi-copy strains for optimizing secretory expression of porcine in- sulin precursor in yeast pichia pastoris,” Journal of applied microbiology, vol. 107, no. 3, pp. 954–963, 2009.
[10] Z. Ahmad, M. Tahir, et al., “Named data networking (ndn) new approach to future internet architecture design: A survey,” Int. J. Informat. Commun. Technol., vol. 2, no. 3, pp. 155–164, 2013.
[11] A. Afanasyev, J. Burke, T. Refaei, L. Wang, B. Zhang, and L. Zhang, “A brief in- troduction to named data networking,” in MILCOM 2018-2018 IEEE Military Com- munications Conference (MILCOM), pp. 1–6, IEEE, 2018.
[12] A. Chiniah and A. Mungur, “Dynamic erasure coding policy allocation (decpa) in hadoop 3.0,” in 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), pp. 29–33, IEEE, 2019.
[13] S. B. Wicker and V. K. Bhargava, Reed-Solomon codes and their applications. John Wiley & Sons, 1999.
[14] B.Sklar,“Reed-solomoncodes,”DownloadedfromURLhttp://www.informit.com/- content/images/art. sub.–sklar7. sub.–reed-solomo-n/elementLinks/art. sub.–sklar7. sub.–reed-solomon. pdf, pp. 1–33, 2001.
[15] M. Sudan, “Decoding of reed solomon codes beyond the error-correction bound,” Journal of complexity, vol. 13, no. 1, pp. 180–193, 1997.
[16] R. P. King, N. Halim, H. Garcia-Molina, and C. A. Polyzois, “Management of a remote backup copy for disaster recovery,” ACM Transactions on Database Systems (TODS), vol. 16, no. 2, pp. 338–368, 1991.
[17] C. A. Polyzois and H. Garcia-Molina, “Evaluation of remote backup algorithms for transaction-processing systems,” ACM Transactions on Database Systems (TODS), vol. 19, no. 3, pp. 423–449, 1994.