{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:00:54Z","timestamp":1760241654068,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T00:00:00Z","timestamp":1529539200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61672416"],"award-info":[{"award-number":["No. 61672416"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>The amount of encoded data replication in an erasure-coded clustered storage system has a great impact on the bandwidth consumption and network latency, mostly during data reconstruction. Aimed at the reasons that lead to the excess data transmission between racks, a rack aware data block placement method is proposed. In order to ensure rack-level fault tolerance and reduce the frequency and amount of the cross-rack data transmission during data reconstruction, the method deploys partial data block concentration to store the data blocks of a file in fewer racks. Theoretical analysis and simulation results show that our proposed strategy greatly reduces the frequency and data volume of the cross-rack transmission during data reconstruction. At the same time, it has better performance than the typical random distribution method in terms of network usage and data reconstruction efficiency.<\/jats:p>","DOI":"10.3390\/info9070150","type":"journal-article","created":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T02:46:21Z","timestamp":1529635581000},"page":"150","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rack Aware Data Placement for Network Consumption in Erasure-Coded Clustered Storage Systems"],"prefix":"10.3390","volume":"9","author":[{"given":"Bilin","family":"Shao","sequence":"first","affiliation":[{"name":"School of Management, Xi\u2019an University of Architecture and Technology, Xi\u2019an 710055, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5544-9820","authenticated-orcid":false,"given":"Dan","family":"Song","sequence":"additional","affiliation":[{"name":"School of Management, Xi\u2019an University of Architecture and Technology, Xi\u2019an 710055, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Genqing","family":"Bian","sequence":"additional","affiliation":[{"name":"School of Management, Xi\u2019an University of Architecture and Technology, Xi\u2019an 710055, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0922-2796","authenticated-orcid":false,"given":"Yu","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Management, Xi\u2019an University of Architecture and Technology, Xi\u2019an 710055, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,6,21]]},"reference":[{"key":"ref_1","first-page":"236","article-title":"Research on Erasure Code-Based Fault-Tolerant Technology for Distributed Storage","volume":"40","author":"Wang","year":"2017","journal-title":"Chin. J. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Li, R., Hu, Y., and Lee, P.P.C. (2015, January 22\u201325). Enabling Efficient and Reliable Transition from Replication to Erasure Coding for Clustered File Systems. Proceedings of the 45th Annual IEEE\/IFIP on Dependable Systems and Networks, Rio de Janeiro, Brazil.","DOI":"10.1109\/DSN.2015.24"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Hu, Y., Lee, P.P.C., and Zhang, X. (2016, January 10\u201315). Double Regenerating Codes for Hierarchical Data Centers. Proceedings of the IEEE International Symposium on Information Theory, Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541298"},{"key":"ref_4","first-page":"1","article-title":"Cross-Rack-Aware Single Failure Recovery for Clustered File Systems","volume":"99","author":"Shen","year":"2017","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"ref_5","first-page":"188","article-title":"BDCode: An erasure code algorithm for big data storage systems","volume":"46","author":"Yin","year":"2016","journal-title":"J. Univ. Sci. Technol. China"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Li, R., Lee, P.P.C., and Hu, Y. (2014, January 23\u201326). Degraded-First Scheduling for Mapreduce in Erasure-Coded Storage Clusters. Proceedings of the 44th Annual IEEE\/IFIP on Dependable Systems and Networks, Atlanta, GA, USA.","DOI":"10.1109\/DSN.2014.47"},{"key":"ref_7","unstructured":"Li, R., Li, X., Lee, P.P.C., and Huang, Q. (2017, January 12\u201314). Repair Pipelining for Erasure-Coded Storage. Proceedings of the 2017 USENIX Annual Technical Conference (USENIX ATC\u201917), Santa Clara, CA, USA."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1007\/s11227-016-1661-7","article-title":"Dynamic erasure coding decision for modern block-oriented distributed storage systems","volume":"72","author":"Ahn","year":"2016","journal-title":"J. Supercomput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/2534169.2486021","article-title":"Leveraging endpoint flexibility in data-intensive clusters","volume":"43","author":"Chowdhury","year":"2013","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.comnet.2014.11.018","article-title":"Replication vs erasure coding in data centric storage for wireless sensor networks","volume":"77","author":"Albano","year":"2015","journal-title":"Comput. Netw."},{"key":"ref_11","first-page":"54","article-title":"Study on Binary Regenerating Codes for Big Data Storage Systems","volume":"50","author":"Huang","year":"2013","journal-title":"J. Comput. Res. Dev."},{"key":"ref_12","first-page":"1980","article-title":"Random Binary Extensive Code (RBEC): An Efficient Code for Distributed Storage System","volume":"40","author":"Chen","year":"2017","journal-title":"Chin. J. Comput."},{"key":"ref_13","first-page":"2688","article-title":"Erasure codes-based data placement fault-tolerant algorithm","volume":"31","author":"Ge","year":"2014","journal-title":"Appl. Res. Comput."},{"key":"ref_14","unstructured":"Wu, Y., Dimakis, A.G., and Ramchandran, K. (2007, January 26\u201328). Deterministic Regenerating Codes for Distributed Storage. Proceedings of the Allerton Conference on Communication, Control, and Computing 2007, Monticello, IL, USA."},{"key":"ref_15","unstructured":"Wu, Y., and Dimakis, A.G. (July, January 28). Reducing Repair Traffic for Erasure Coding-Based Storage via Interference Alignment. Proceedings of the IEEE International Conference on Symposium on Information Theory, Seoul, South Korea."},{"key":"ref_16","unstructured":"Cullina, D., Dimakis, A.G., and Ho, T. (October, January 30). Searching for Minimum Storage Regenerating Codes. Proceedings of the Allerton Conference on Communication, Control, and Computing 2009, Monticello, IL, USA."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","article-title":"Network Coding for Distributed Storage Systems","volume":"56","author":"Dimakis","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/JPROC.2010.2096170","article-title":"A Survey on Network Codes for Distributed Storage","volume":"99","author":"Dimakis","year":"2011","journal-title":"Proc. IEEE"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Hou, H., Lee, P.P.C., Shum, K.W., and Hu, Y. (2018). Rack-Aware Regenerating Codes for Data Centers. arXiv.","DOI":"10.1109\/TIT.2019.2902835"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Ma, Y., Nandagopal, T., Puttaswamy, K.P.N., and Banerjee, S. (2013, January 14\u201319). An Ensemble of Replication and Erasure Codes for Cloud File Systems. Proceedings of the 32nd IEEE International Conference on Computer Communications, Turin, Italy.","DOI":"10.1109\/INFCOM.2013.6566920"},{"key":"ref_21","first-page":"3085","article-title":"Research on dynamic replication redundancy storage strategy based on erasure code","volume":"35","author":"Zheng","year":"2014","journal-title":"Comput. Eng. Des."},{"key":"ref_22","first-page":"2150","article-title":"Improved HDFS scheme based on erasure code and dynamical-replication system","volume":"32","author":"Li","year":"2012","journal-title":"J. Comput. Appl."},{"key":"ref_23","first-page":"137","article-title":"Fault-tolerant mechanism combined with replication and error correcting code for cloud file systems","volume":"54","author":"Yang","year":"2014","journal-title":"J. Tsinghua Univ."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.future.2015.07.006","article-title":"Improving reliability and performances in large scale distributed applications with erasure codes and replication","volume":"56","author":"Gribaudo","year":"2016","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_25","unstructured":"Silberstein, M., Ganesh, L., Wang, Y., Alvisi, L., and Dahlin, M. (July, January 30). Lazy Means Smart: Reducing Repair Bandwidth Costs in Erasure-Coded Distributed Storage. Proceedings of the International Conference on Systems and Storage, Haifa, Israel."},{"key":"ref_26","unstructured":"Huang, C., Simitci, H., Xu, Y., Ogus, A., Calder, B., Gopalan, P., Li, J., and Yekhanin, S. (2012, January 13\u201315). Erasure Coding in Windows Azure Storage. Proceedings of the USENIX Annual Technical Conference, Boston, MA, USA."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Sathiamoorthy, M., Asteris, M., Papailiopoulos, D., Dimakis, A.G., Dimakis, R., and Dimakis, S. (2013, January 26\u201330). Xoring Elephants: Novel Erasure Codes for Big Data. Proceedings of the VLDB Endowment, Trento, Italy.","DOI":"10.14778\/2535573.2488339"},{"key":"ref_28","unstructured":"Rashmi, K.V., Nakkiran, P., Wang, J., Shah, N.B., and Ramchandran, K. (2015, January 16\u201319). Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I\/O, Storage, and Network-bandwidth. Proceedings of the 13th USENIX Conference on File and Storage Technologies, Santa Clara, CA, USA."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Rashmi, K.V., Shah, N.B., Gu, D., Kuang, H., Borthakur, D., and Ramchandran, K. (2014, January 17\u201322). A Hitchhiker\u2019s Guide to Fast and Efficient Data Reconstruction in Erasure-Coded Data Centers. Proceedings of the 2014 ACM conference on SIGCOMM, Chicago, IL, USA.","DOI":"10.1145\/2619239.2626325"},{"key":"ref_30","unstructured":"Muralidhar, S., Lloyd, W., Roy, S., Hill, C., Lin, E., Liu, W., Pan, S., Shankar, S., Tang, L., and Kumar, S. (2014, January 6\u20138). F4: Facebook\u2019s Warm Blob Storage System. Proceedings of the 11th USENIX conference on Operating Systems Design and Implementation, Broomfield, CO, USA."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhu, L., Wang, R., and Yang, H. (2017). Multi-path Data Distribution Mechanism Based on RPL for Energy Consumption and Time Delay. Information, 8.","DOI":"10.20944\/preprints201709.0085.v1"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.jnca.2017.09.009","article-title":"An algorithm for network and data-aware placement of multi-tier applications in cloud data centers","volume":"98","author":"Ferdaus","year":"2017","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Mitra, S., Panta, R., Ra, M.R., and Bagchi, S. (2016, January 18\u201321). Partial-Parallel-Repair (PPR): A Distributed Technique for Repairing Erasure Coded Storage. Proceedings of the Eleventh European Conference on Computer Systems, London, UK.","DOI":"10.1145\/2901318.2901328"},{"key":"ref_34","unstructured":"Ford, D., Labelle, F., Popovici, F.I., Stokely, M., Truong, V., Barroso, L., Grimes, C., and Quinlan, S. (2010, January 4\u20136). Availability in Globally Distributed Storage Systems. Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation, Vancouver, BC, Canada."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Gast\u00f3n, B., Pujol, J., and Villanueva, M. (2013, January 20\u201322). A Realistic Distributed Storage System that Minimizes Data Storage and Repair Bandwidth. Proceedings of the Data Compression Conference, Snowbird, UT, USA.","DOI":"10.1109\/DCC.2013.72"},{"key":"ref_36","unstructured":"Ahmad, F., Chakradhar, S.T., Raghunathan, A., and Vijaykumar, T.N. (2014, January 19\u201320). ShuffleWatcher: Shuffle-Aware Scheduling in Multi-Tenant MapReduce Clusters. Proceedings of the USENIX Annual Technical Conference 2014, Philadelphia, PA, USA."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Li, J., Yang, S., Wang, X., and Li, B. (2010, January 15\u201319). Tree-Structured Data Regeneration in Distributed Storage Systems with Regenerating Codes. Proceedings of the IEEE INFOCOM, San Diego, CA, USA.","DOI":"10.1109\/INFCOM.2010.5462122"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/7\/150\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:09:35Z","timestamp":1760195375000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/7\/150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,21]]},"references-count":37,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2018,7]]}},"alternative-id":["info9070150"],"URL":"https:\/\/doi.org\/10.3390\/info9070150","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2018,6,21]]}}}