Prof.A.S. Shinde, S.T. Navale, Yogesh D. Patil et al. · INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT · 2025
Abstract : The proposed decentralized storage system is designed to overcome the limitations of traditional cloud storage by combining InterPlanetary File System (IPFS), Ethereum blockchain, and advanced encryption techniques. The architecture ensures secure, transparent, and user-controlled file management without relying on centralized servers. Files are encrypted using Attribute-Based Encryption (ABE) and Chebyshev Polynomial Encryption to enforce fine-grained access control and confidentiality. Encrypted files are fragmented and stored across IPFS nodes, generating unique Content Identifiers (CIDs) that are immutably logged on the Ethereum blockchain via smart contracts. These smart contracts automate access control, file ownership verification, and audit trails, ensuring tamper-proof and transparent operations. A Django-based backend and web portal frontend enable seamless user interaction and file handling. Optional AI-based intrusion detection enhances system reliability by monitoring unauthorized access attempts. The integrated framework delivers decentralization, immutability, scalability, and user empowerment, offering a secure alternative to conventional storage models. This architecture demonstrates the potential of blockchain and distributed systems to revolutionize data privacy, integrity, and ownership in next-generation storage solutions. Key Words: Decentralized Storage, InterPlanetary File System (IPFS), Ethereum Blockchain, Smart Contracts, Attribute-Based Encryption (ABE), Chebyshev Polynomial Encryption, Distributed File System, Secure File Sharing, Access Control, Data Immutability, User Privacy, Data Integrity, Blockchain-Based Storage, Django Backend, AI Intrusion Detection, Decentralized Architecture, Scalable Cloud Alternatives, Data Confidentiality, Secure Data Management, Web Portal Interface.
Cited by 0Open access
Iosif Irimie, Larisa Muntean, Andrada Anca et al. · 2010
Chapter I- Introduction …………………………………………………………………….. page 3 • I.1.The purpose of this paper………………………………………………………….page 3 • I.2.Overview................................................................................................................... page 3 • I.3.Structure of the paper……………………………………………………………...page 3
Cited by 0
Igor Botygin, Vladimir Popov · On-line Journal Naukovedenie · 2014
. , - . , . () , ,
Cited by 0Open access
Kluwer Academic Publishers eBooks · 2006
This research paper is a survey of the present state of design and implementation of distributed file systems. In a distributed file system, one or more central servers store files that can be accessed, with proper authorization rights. It consists of four parts: an Introduction of Distributed file system, implementation, architecture and component of distributed file system and their design goals for good distributed file system i.e. transparency – the main goal of good DFS. In this paper we also discuss some distributed file systems like NFS, CIFS, OwFS and HDFS. We explain features, architecture of above file system. This paper also include the criteria for choosing right Distributed file system of our need and recommendation foe right Distributed File System .The above file systems are also compared on the basis of File size, Analytic functionality, TCO and their selection criteria. This research also included the future aspect of distributed file systems like the problem we based in current DFS like transparency and at last the conclusion of the whole paper on the basis of above survey.
Cited by 4
Salovaara, Antti · Theseus (Ammattikorkeakoulujen) · 2010
Työssä toteutetaan Distributed File System -ratkaisu käyttäen Microsoftin palvelimiin sisäänrakennettua ominaisuutta ja perehdytään tekniikoihin, joihin DFS perustuu kuten Active Directoryyn ja Domain Name Systemiin. Yrityksen tiedostokopioinnit on tähän asti hoidettu erilaisilla xcopy-pohjaisilla ratkaisuilla käyttämällä Windows-ajastetuilla tehtävillä ajastettuja .bat-tiedostoja. Bat-ratkaisu on tarkoitus korvata keskitetysti hallitulla Distributed File System -ratkaisulla, jolla voidaan helposti jakaa tiedostoja Helsingistä etäkonttoreihin ja päinvastoin. Lisäksi tavoitteena on muodostaa DFS-Mesh -yhteys Aasian konttoreiden välille helpottamaan konttorien välistä tiedonsiirtoa ja korvaamaan tähänastinen ratkaisu, jossa kaikki liikenne on kiertänyt Helsingin kautta. Yrityksen verkko on jakautunut usealla mantereelle, joten työssä tutustutaan lisäksi konttorien välisten VPN-yhteyksien toimintaan ja päivitetään yrityksen verkkoa vastaamaan nykypäivän haasteita.
Cited by 0Open access
James Howe, James W. Howe · 1992
A component of the Institutional File System (IFS), the intermediate file server addresses scaling and interoperability issues on the University of Michigan campus. The IFS is based on AFS, a distributed file system from Transarc. Intermediate servers provide protocol translation that enables non-AFS clients to easily access the distributed file system. For example, Macintosh users can manipulate UNIX files that reside on a server by moving folders and icons, just as they would manipulate local Macintosh files. Intermediate servers also offer other benefits, such as multi-level caching and data preloading, that increase the capacity of the network by reducing the load on central servers.
Cited by 0
Walter F. Tichy, Zuwang Ruan · Purdue e-Pubs (Purdue University System) · 1984
This paper describes IBIS, a distributed file system for a network. of UNIX machines. IBIS provides two levels of abstraction: file access transparency and file location transparency. File access transparency means that all files are accessed in the same way, regardless of whether they are remote or local. File location transparency hides the location of files in the network. IBIS provides a single, location transparent, hierarchical file system that spans several machines. IBIS exploits location transparency by replicating files and mi~rating them where they are needed. Replication and migration improve file system efficiency and fault tolerance. This paper reports on the design, implementation, and performance of the access transparency level, and descri:Jes the design of the location transparency level. This project is supported in part by grants from the National Science FoundatioD. (MCS8219178) and SUN Microsystcms Incorporated.
Cited by 31Open access
Chandramouli, Zhijian Yu, ; Chengyang Yuan et al. · International Journal of Innovative Technology and Exploring Engineering · 2019
The investigation of little documents is required to give singular clients the most recent data and improved administrations. Every one of the machines is required to be under a typical director and have the option to impart safely. Huge information is the center subject in enterprises and research fields just as for society overall. Hadoop is the most generally utilized device for huge information examination in internet-based life like Google, Facebook, Yahoo, and Amazon and so on. Hadoop essentially uses Distributed File System for the capacity of an enormous volume of unstructured, ongoing information and streams at a high speed. It has given exact significance to information stockpiling in Hadoop, however, the security of information has overlooked and exceptionally least significance was given. We have algorithms or methodologies proposed.
Cited by 0Open access
Andrew Birrell, Andy Hisgen, Chuck Jerian et al. · 1993
Echo is an ambitious distributed file system. It was designed around a truly global name space. It uses a coherent caching algorithm. It is fault tolerant. And it is real—it was the primary file system for a large group of researchers. Its novel aspects include an extensible “junction ” mechanism for global naming; extensive write-behind with ordering semantics that allow applications to maintain invariants without resorting to synchronous writes; and fault tolerance mechanisms that are highly configurable and that tolerate network partitions. It was designed with the intention that its performance could be as good as a local file system, while supporting large numbers of clients per server. Its reliability was designed to be higher than other distributed file systems, and higher than
Cited by 72
Shlomi Dolev, Ronen I. Kat · Journal of High Speed Networks · 2005
A self-stabilizing distributed file systems is presented. The system constructs and maintains a spanning tree for each file volume. The spanning tree consists of the servers that have volume replicas and caches for the specific file volume. The spanning trees are constructed and maintained by self-stabilizing distributed algorithms. A self-stabilizing synchronizer enforces file system semantics and consistent replications. File system updates use the tree to implement file read and write operations. A prototype of the system based on the Linux operating system has been implemented.
Cited by 5
Laine, Teijo · Aaltodoc (Aalto University) · 2009
DX 200 is a distributed computing system comprising of networked computer units. Majority of the computer units do not have a persistent storage such as a hard drive. These computer units use a RAM disk as their storage medium. Since the contents of the RAM disk are lost if the computer unit restarts, persisting updates cannot be done to the file system. Computer units that use RAM disk load the operating system and the file system contents either from a computer unit that has a hard drive or from a computer unit that has already done the loading. For computer units using RAM to store their file system, it would be useful to be able to store the changes in case a restart occurs. Persistent storage could he used for example to store computer logs and to manage configuration files more easily. The aim of this thesis is to design and implement a distributed file system that allows Linux-based computer units to perform persisting file system changes while using RAM disks. The file system can also be shared by multiple computer units.
Cited by 0
Calvin Jia, Haoyuan Li · Encyclopedia of Big Data Technologies · 2018
Cited by 1
Debessay Fesehaye Kassa, Rahul Malik, Klara Nahrstedt · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · 2010
Large scale distributed systems such as cloud computing \napplications are becoming very common. These applications \ncome with increasing challenges on how to transfer \nand where to store and compute data. The most prevalent \ndistributed file systems to deal with these challenges is the \nHadoop File System (HDFS) which is a variant of the Google \nFile System (GFS). However HDFS has two potential problems. \nThe first one is that it depends on a single name node \nto manage almost all operations of every data block in the \nfile system. As a result it can be a bottleneck resource and \na single point of failure. The second potential problem with \nHDFS is that it depends on TCP to transfer data. As has \nbeen cited in many studies TCP takes many rounds before \nit can send at the full capacity of the links in the cloud. This \nresults in low link utilization and longer download times. \nTo overcome these problems of HDFS we present a new distributed \nfile system. Our scheme uses a light weight front \nend server to connect all requests with many name nodes. \nThis helps distribute load of a single name node to many \nname nodes. Our second contribution is to use an efficient \nprotocol to send and route data. Our protocol can achieve \nfull link utilization and hence decreased download times. \nBased on simulation our protocol can outperform HDFS and \nhence GFS.
Cited by 3Open access
Azer Bestavros, Mohammad Makarechian · OpenBU/Boston University Institutional Repository (Boston University) · 1993
This paper describes a prototype implementation of a Distributed File System (DFS) based on the Adaptive Information Dispersal Algorithm (AIDA). Using AIDA, a file block is encoded and dispersed into smaller blocks stored on a number of DFS nodes distributed over a network. The implementation devises file creation, read, and write operations. In particular, when reading a file, the DFS accepts an optional timing constraint, which it uses to determine the level of redundancy needed for the read operation. The tighter the timing constraint, the more nodes in the DFS are queried for encoded blocks. Write operations update all blocks in all DFS nodes--with future implementations possibly including the use of read and write quorums. \n \nThis work was conducted under the supervision of Professor Azer Bestavros (best@cs.bu.edu) in the Computer Science Department as part of Mohammad Makarechian's Master's project.
Cited by 0
Konstantin V. Shvachko, Hairong Kuang, Sanjay Radia et al. · 2010
The Hadoop Distributed File System (HDFS) is designed to store very large data sets reliably, and to stream those data sets at high bandwidth to user applications. In a large cluster, thousands of servers both host directly attached storage and execute user application tasks. By distributing storage and computation across many servers, the resource can grow with demand while remaining economical at every size. We describe the architecture of HDFS and report on experience using HDFS to manage 25 petabytes of enterprise data at Yahoo!.
Cited by 4,800
Antonio Augusto Medeiros Frolich.
<html xmlns:o=3D"urn:schemas-microsoft-com:office:office" xmlns:w=3D"urn:schemas-microsoft-com:office:word" xmlns=3D"http://www.w3.org/TR/REC-html40"> <head> <meta http-equiv=3DContent-Type content=3D"text/html; charset=3Dwindows-1252"> <meta name=3DProgId content=3DWord.Document> <meta name=3DGenerator content=3D"Microsoft Word 11"> <meta name=3DOriginator content=3D"Microsoft Word 11"> <link rel=3DFile-List href=3D"RESUMEN_archivos/filelist.xml"> <title>RESUMEN</title> <!--[if gte mso 9]><xml> <o:DocumentProperties> <o:Author>Biblioteca de Ciencias y Tecnología</o:Author> <o:Template>Normal</o:Template> <o:LastAuthor>Biblioteca de Ciencias y Tecnología</o:LastAuthor> <o:Revision>2</o:Revision> <o:TotalTime>86</o:TotalTime> <o:Created>2007-01-12T18:53:00Z</o:Created> <o:LastSaved>2007-01-12T18:53:00Z</o:LastSaved> <o:Pages>1</o:Pages> <o:Words>114</o:Words> <o:Characters>631</o:Characters> <o:Company>UCLA</o:Company> <o:Lines>5</o:Lines> <o:Paragraphs>1</o:Paragraphs> <o:CharactersWithSpaces>744</o:CharactersWithSpaces> <o:Version>11.6568</o:Version> </o:DocumentProperties> </xml><![endif]--><!--[if gte mso 9]><xml> <w:WordDocument> <w:SpellingState>Clean</w:SpellingState> <w:GrammarState>Clean</w:GrammarState> <w:HyphenationZone>21</w:HyphenationZone> <w:PunctuationKerning/> <w:DrawingGridHorizontalSpacing>6 pto</w:DrawingGridHorizontalSpacing> <w:DisplayHorizontalDrawingGridEvery>2</w:DisplayHorizontalDrawingGridEvery> <w:DisplayVerticalDrawingGridEvery>2</w:DisplayVerticalDrawingGridEvery> <w:ValidateAgainstSchemas/> <w:SaveIfXMLInvalid>false</w:SaveIfXMLInvalid> <w:IgnoreMixedContent>false</w:IgnoreMixedContent> <w:AlwaysShowPlaceholderText>false</w:AlwaysShowPlaceholderText> <w:Compatibility> <w:BreakWrappedTables/> <w:SnapToGridInCell/> <w:WrapTextWithPunct/> <w:UseAsianBreakRules/> <w:DontGrowAutofit/> </w:Compatibility> <w:BrowserLevel>MicrosoftInternetExplorer4</w:BrowserLevel> </w:WordDocument> </xml><![endif]--><!--[if gte mso 9]><xml> <w:LatentStyles DefLockedState=3D"false" LatentStyleCount=3D"156"> </w:LatentStyles> </xml><![endif]--> <style> <!-- /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-parent:""; margin:0cm; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman"; mso-fareast-font-family:"Times New Roman"; mso-ansi-language:ES-VE;} p {mso-margin-top-alt:auto; margin-right:0cm; mso-margin-bottom-alt:auto; margin-left:0cm; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman"; mso-fareast-font-family:"Times New Roman";} span.palabradestacada {mso-style-name:palabradestacada;} @page Section1 {size:612.1pt 792.1pt; margin:4.0cm 3.0cm 3.0cm 3.0cm; mso-header-margin:35.45pt; mso-footer-margin:35.45pt; mso-paper-source:0;} div.Section1 {page:Section1;} --> </style> <!--[if gte mso 10]> <style> /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Tabla normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman"; mso-ansi-language:#0400; mso-fareast-language:#0400; mso-bidi-language:#0400;} </style> <![endif]--> </head> <body lang=3DES style=3D'tab-interval:35.4pt'> <div class=3DSection1> <p class=3DMsoNormal align=3Dcenter style=3D'text-align:center'><b style=3D'mso-bidi-font-weight: normal'><span lang=3DES-VE style=3D'font-size:11.0pt'>RESUMEN<o:p></o:p></span></b> <p class=3DMsoNormal align=3Dcenter style=3D'text-align:center'><b style=3D'mso-bidi-font-weight: normal'><span lang=3DES-VE style=3D'font-size:11.0pt'><o:p> </o:p></span></b> <p class=3DMsoNormal style=3D'mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; text-align:justify'><span lang=3DPT-BR style=3D'font-size:11.0pt;mso-ansi-language: PT-BR'>Este artigo apresenta o SDFS (Simple Distributed File System), um sistema de arquivos distribuído, portável, com alto grau de paralelismo e desenhado para ser flexível no que diz respeito ao ambiente sobre a qual seus componentes são distribuídos, possibilitando sua execução em multicomputadores ou em redes de computadores. O projeto foi desenvolvido no curso de pós-graduação em Ciências da Computação da Universidade Federalde Santa Catarina (CPGC/UFSC), onde se encontra em processo evolutivo, edeverá integrar um projeto coletivo das universidades federais de Santa Catarina (UFSC), Rio Grande do sul (UFRGS) e Santa Maria (UFSM), que visa desenvolver um multicomputador e um ambiente para programação paralela sobre ele.<O:P></O:P></span><span lang=3DES-VE style=3D'font-size:11.0pt'><o:p></o:p></span> <p class=3DMsoNormal style=3D'text-align:justify'><span lang=3DES-VE style=3D'font-size:11.0pt;color:black'> <br> <br> </span><span lang=3DES-VE style=3D'font-size:9.0pt;color:black'> <br> </span><b style=3D'mso-bidi-font-weight:normal'><span lang=3DES-VE style=3D'font-size:11.0pt'><o:p></o:p></span></b> </div> </body> </html>
Cited by 0
Mahadev Satyanarayanan, John H. Howard, David A. Nichols et al. · 1985
Cited by 91
Hyeran Lim, Vikram Kapoor, Chirag Wighe et al. · Digest of papers - IEEE Symposium on Mass Storage Systems · 2001
Consistent improvements in processor and memory technology have led to disks having greater processing power and cache memory in a compact size. This increased processing power and memory allows disks to execute more than just the basic disk operations, sometimes, even run user defined codes. Offloading part of the application processing to the disks can help reducing the latency of data manipulation as well as the amount of data transferred across the network. Such disks are called active disks. In this paper, a file system for the active-disk-based data server (ADFS) is proposed. All data files stored on active disks are provided with operations, forming objects. For some applications such as database, application-specific operations can be run by disk processors so that only the results are returned to clients, rather than whole data file is read by the clients. Therefore, ADFS is able to reduce the application-processing overhead of the system. In ADFS, part of file system functionality of the file manager can be delegated to active disks. Our implementation is based on CORBA specification. A set of file system interfaces is implemented for each module of each file system component. Part of the file system functionality, such as lookup, is embedded in the modules for active disks. We tested the performance of ADFS with 64 files in three-layer directory system. The performance results are obtained in a limited manner and presented in this paper. Our ADFS is basically stateful, but the delegation of file system functionality to disks allows our file system to be more scalable and helps to overcome some of the limitations of current prevailing file systems, like NFS, by greatly reducing the work of the central file manager. In addition, it is conceivable that the central file manager could be eliminated altogether.
Cited by 26
Fang Zho · 2015
The marketing file system of Zhejiang(Provincial) Electric Power Company now is fully applied in the whole province.The fast growth of file data brings stricter requirements on storage of electronic files and other nonstructural data.By investigating features of distributed file system and taking the application of Moose FS distributed file system in marketing file system as an example,it is verified that the distributed file system is superior to the concentrated storage in terms of load balance,online capacity expansion and so on.The application of distributed file system provides a feasible solution to massive data storage of marketing file system.
Cited by 0
Hani Jamjoom, Steve Raasch, Andrew Shih · 1999
Cited by 0