{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T20:23:26Z","timestamp":1754598206141,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,4,17]],"date-time":"2014-04-17T00:00:00Z","timestamp":1397692800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2014,4,17]]},"abstract":"<jats:p>Data driven decisions derived from big data have become critical in many application domains, fueling the demand for collection, transportation, storage and processing of massive volumes of data. Such applications have made data a valuable resource that needs to be provided appropriate security. High value associated with big data sets has rendered big data storage systems attractive targets for cyber attackers, whose goal is to compromise the Confidentiality, Integrity and Availability of data and information. Common defense strategy for protecting cyber assets has been to first take preventive measures, and if these fail, detecting intrusions and finally recovery. Unfortunately, attackers have developed tremendous technical sophistication to defeat most defensive mechanisms. Alternative strategy is to design architectures which are intrinsically attack tolerant. This paper describes a technique that involves eliminating single point of security failures through fragmentation, coding, dispersion and reassembly. It is shown that this technique can be successfully applied to routing, networked storage systems, and big data file systems to make them attack tolerant.<\/jats:p>","DOI":"10.1145\/2627534.2627556","type":"journal-article","created":{"date-parts":[[2014,5,27]],"date-time":"2014-05-27T12:56:59Z","timestamp":1401195419000},"page":"65-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Attack tolerant architecture for big data file systems"],"prefix":"10.1145","volume":"41","author":[{"given":"Bharat B.","family":"Madan","sequence":"first","affiliation":[{"name":"Old Dominion University, Norfolk, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Banik","sequence":"additional","affiliation":[{"name":"Old Dominion University, Norfolk, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,4,17]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Hadoop project. http:\/\/hadoop.apache.org  Hadoop project. http:\/\/hadoop.apache.org"},{"key":"e_1_2_1_2_1","unstructured":"Samba file server. http:\/\/www.samba.org  Samba file server. http:\/\/www.samba.org"},{"key":"e_1_2_1_3_1","unstructured":"Secure hash standard. http:\/\/www.itl.nist.gov\/fipspubs\/fip180-1.htm  Secure hash standard. http:\/\/www.itl.nist.gov\/fipspubs\/fip180-1.htm"},{"key":"e_1_2_1_4_1","unstructured":"Shadoop. http:\/\/blog.jonhnnyweslley.net\/2008\/05\/shadoop.html  Shadoop. http:\/\/blog.jonhnnyweslley.net\/2008\/05\/shadoop.html"},{"key":"e_1_2_1_5_1","first-page":"137","volume-title":"Proceedings of the 6th Symposium on Operating Systems Design and Implementation (December","author":"Dean J.","year":"2004","unstructured":"Dean , J. , and Ghemawat , S . Mapreduce: Simplified data processing on large clusters . In Proceedings of the 6th Symposium on Operating Systems Design and Implementation (December 2004 ), pp. 137 -- 150 . Dean, J., and Ghemawat, S. Mapreduce: Simplified data processing on large clusters. In Proceedings of the 6th Symposium on Operating Systems Design and Implementation (December 2004), pp. 137--150."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646754.705196"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2003.07.008"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2433508.2433869"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/971701.50214"},{"key":"e_1_2_1_12_1","unstructured":"Stevens W. R. TCP\/IP Illustrated Vol. 1 Chap. 20. Addison-Wesley 1996.  Stevens W. R. TCP\/IP Illustrated Vol. 1 Chap. 20. Addison-Wesley 1996."},{"key":"e_1_2_1_13_1","volume-title":"Reed-Solomon Codes and Their Applications","author":"Wicker S.","year":"1994","unstructured":"Wicker , S. , and Bhargava , V . Reed-Solomon Codes and Their Applications . IEEE Press , 1994 . Wicker, S., and Bhargava, V. Reed-Solomon Codes and Their Applications. IEEE Press, 1994."},{"key":"e_1_2_1_14_1","volume-title":"Redundant array of inexpensive links (RAIL) technique for network routing survivability. Master's thesis, Computer Science and Engineering","author":"Wu B.","year":"2011","unstructured":"Wu , B. Redundant array of inexpensive links (RAIL) technique for network routing survivability. Master's thesis, Computer Science and Engineering , Penn State University , November 2011 . Wu, B. Redundant array of inexpensive links (RAIL) technique for network routing survivability. Master's thesis, Computer Science and Engineering, Penn State University, November 2011."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2627534.2627556","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2627534.2627556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:35Z","timestamp":1750230095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2627534.2627556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,17]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4,17]]}},"alternative-id":["10.1145\/2627534.2627556"],"URL":"https:\/\/doi.org\/10.1145\/2627534.2627556","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2014,4,17]]},"assertion":[{"value":"2014-04-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}