{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:14:39Z","timestamp":1743153279518,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953874"},{"type":"electronic","value":"9783030953881"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95388-1_15","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"230-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Square Fractional Repetition Codes for Distributed Storage Systems"],"prefix":"10.1007","author":[{"given":"Bing","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"15_CR1","unstructured":"Huang, C., et al.: Erasure coding in windows azure storage. In: Proceedings of the USENIX Annual Technical Conference, pp. 15\u201326, June 2012"},{"issue":"5","key":"15_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.14778\/2535573.2488339","volume":"6","author":"M Sathiamoorthy","year":"2013","unstructured":"Sathiamoorthy, M., et al.: XORing elephants: novel erasure codes for big data. Proc. VLDB Endowment 6(5), 325\u2013336 (2013)","journal-title":"Proc. VLDB Endowment"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Rashmi, K.V., Shah, N.B., Gu, D., Kuang, H., Borthakur, D., Ramchandran, K.: A \u201cHitchhiker\u2019s\" guide to fast and efficient data reconstruction in erasure-coded data centers. In: Proceedings of the ACM SIGCOMM, pp. 331\u2013342, August 2014","DOI":"10.1145\/2740070.2626325"},{"key":"15_CR4","unstructured":"Rashmi, K.V., Nakkiran, P., Wang, J., Shah, N.B., Ramchandran, K.: Having your cake and eating it too: jointly optimal erasure codes for I\/O, storage, and network-bandwidth. In: Proceedings 13th USENIX Conference File Storage Technology (FAST), pp. 81\u201394, February 2015"},{"issue":"9","key":"15_CR5","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainwright, M., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539\u20134551 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Rashmi, K.V., Shah, N.B., Kumar, P.V., Ramchandran, K.: Explicit construction of optimal exact regenerating codes for distributed storage. In: Proceedings 47th Annual Allerton Conference Communication, Control, Computing, pp. 1243\u20131249, September 2009","DOI":"10.1109\/ALLERTON.2009.5394538"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"El Rouayheb, S., Ramchandran, K.: Fractional repetition codes for repair in distributed storage systems. In: Proceedings of 48th Annual Allerton Conference Communication, Control, Computing, pp. 1510\u20131517, October 2010","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Friedman, R., Kantor, Y., Kantor, A.: Replicated erasure codes for storage and repair-traffic efficiency. In: Proceedings of 14th IEEE International Conference on Peer-to-Peer Computing, pp. 1\u201310, September 2014","DOI":"10.1109\/P2P.2014.6934310"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Koo, J., Gill, J.: Scalable constructions of fractional repetition codes in distributed storage systems. In: Proceedings of 49th Annual Allerton Conference Communication, Control, Computing, pp. 1366\u20131373, September 2011","DOI":"10.1109\/Allerton.2011.6120326"},{"issue":"8","key":"15_CR10","doi-asserted-by":"publisher","first-page":"4164","DOI":"10.1109\/TIT.2015.2442231","volume":"61","author":"N Silberstein","year":"2015","unstructured":"Silberstein, N., Etzion, T.: Optimal fractional repetition codes based on graphs and designs. IEEE Trans. Inf. Theory 61(8), 4164\u20134180 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1109\/TIT.2016.2531720","volume":"62","author":"O Olmez","year":"2016","unstructured":"Olmez, O., Ramamoorthy, A.: Fractional repetition codes with flexible repair from combinatorial designs. IEEE Trans. Inf. Theory 62(4), 1565\u20131591 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Aydinian, H., Boche, H.: Fractional repetition codes based on partially ordered sets. In: Proceedings of IEEE Information Theory Workshop (ITW), pp. 51\u201355, November 2017","DOI":"10.1109\/ITW.2017.8277958"},{"issue":"12","key":"15_CR13","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1109\/LCOMM.2015.2496197","volume":"19","author":"B Zhu","year":"2015","unstructured":"Zhu, B., Li, H.: Adaptive fractional repetition codes for dynamic storage systems. IEEE Commun. Lett. 19(12), 2078\u20132081 (2015)","journal-title":"IEEE Commun. Lett."},{"issue":"6","key":"15_CR14","doi-asserted-by":"publisher","first-page":"2359","DOI":"10.1109\/TCOMM.2018.2799213","volume":"66","author":"Y-S Su","year":"2018","unstructured":"Su, Y.-S.: Pliable fractional repetition codes for distributed storage systems: design and analysis. IEEE Trans. Commun. 66(6), 2359\u20132375 (2018)","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1109\/TIT.2019.2929788","volume":"66","author":"B Zhu","year":"2020","unstructured":"Zhu, B., Shum, K.W., Li, H.: Fractional repetition codes with optimal reconstruction degree. IEEE Trans. Inf. Theory 66(2), 983\u2013994 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Porter, A., Silas, S., Wootters, M.: Load-balanced fractional repetition codes. In: Proceedings of the IEEE International Symposium Information Theory (ISIT), pp. 2072\u20132076, June 2018","DOI":"10.1109\/ISIT.2018.8437460"},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1109\/TIT.2020.3039901","volume":"67","author":"W Yu","year":"2021","unstructured":"Yu, W., Zhang, X., Ge, G.: Optimal fraction repetition codes for access-balancing in distributed storage. IEEE Trans. Inf. Theory 67(3), 1630\u20131640 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"JH van Lint","year":"2001","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge Univ. Press, Cambridge (2001)","edition":"2"},{"key":"15_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139167239","volume-title":"Integer Partitions","author":"GE Andrews","year":"2004","unstructured":"Andrews, G.E., Eriksson, K.: Integer Partitions. Cambridge Univ. Press, Cambridge (2004)"},{"issue":"17","key":"15_CR20","doi-asserted-by":"publisher","first-page":"2095","DOI":"10.1049\/iet-com.2014.1225","volume":"9","author":"B Zhu","year":"2015","unstructured":"Zhu, B., Li, H., Shum, K.W., Li, S.-Y.R.: HFR code: a flexible replication scheme for cloud storage systems. IET Commun. 9(17), 2095\u20132100 (2015)","journal-title":"IET Commun."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95388-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:30:02Z","timestamp":1645518602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95388-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953874","9783030953881"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95388-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"403","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.12","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}