Online file management systems enable cooperatively editing and sharing.However,due to the cost of communication and storage infrastructures,traditional online file management services,e.g.,Google Drive and OneDrive,u...Online file management systems enable cooperatively editing and sharing.However,due to the cost of communication and storage infrastructures,traditional online file management services,e.g.,Google Drive and OneDrive,usually provide limited storage space and relatively low download speed for free users.To achieve better performance,ordinary users have to purchase their expensive services.Moreover,these file management systems are based on centralized architecture and bear the privacy leakage risk,because users’personal files are stored and controlled by their servers.To address the above problems,we propose a peer-to-peer(P2P)file management system based on IPFS and Hyperledger Fabric,named as FileWallet,which can serve as a personal wallet for individual users or organizations to store and share their files in a secure manner.In FileWallet,the users form a P2P network and a Fabric network,where P2P network builds the connections and distributed storage network and the Fabric network sustains consistent blockchain ledgers to record file operation related transactions.In our FileWallet,the storage and communication costs are mitigated in the decentralized design,and the file owner can fully control the access permission of the file to preserve the file privacy.The design of the system architecture,main functionalities,and system implementations are presented in this paper.The performance of the system is evaluated through experiments,and the experimental results show its wide applicability and scalability.展开更多
A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed a...A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding （FLD） and random walk （RW）. The result shows that with the proposed design, the queries are muted effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.展开更多
In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm ...In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.展开更多
The bane of achieving a scalable distributed file sharing system is the centralized data system and single server oriented file [sharing] system. In this paper, the solution to the problems in a distributed environmen...The bane of achieving a scalable distributed file sharing system is the centralized data system and single server oriented file [sharing] system. In this paper, the solution to the problems in a distributed environment is presented. Thus, inability to upload sizeable files, slow transportation of files, weak security and lack of fault tolerance are the major problems in the existing system. Hence, the utmost need is to build a client-server network that runs on two or more server systems in order to implement scalability, such that when one server is down, the other(s) would still hold up the activities within the network. And to achieve this reliable network environment, LINUX network operating system is recommended among others as a preferred platform for the synchronization of the server systems, such that every user activity like sending of internal memos/mails, publication of academic articles, is replicated;thereby, achieving the proposed result. Hence, Scalable Distributed File Sharing System provides the robustness required to having a reliable intranet.展开更多
In a peer-to-peer file-sharing system, a free-rider is a node which downloads files from its peers but does not share files to other nodes. Analyzing the free-riders’ impact on system throughputs is essential in exam...In a peer-to-peer file-sharing system, a free-rider is a node which downloads files from its peers but does not share files to other nodes. Analyzing the free-riders’ impact on system throughputs is essential in examining the performance of peer-to-peer file-sharing systems. We find that the free-riders’ impact largely depends on nodes behavior, including their online time and greed of downloading files. We extend an existing peer-to-peer system model and classify nodes according to their behavior. We focus on two peer-to-peer architectures: centralized indexing and distributed hash tables. We find that when the cooperators in a system are all greedy in downloading files, the system throughput has little room to increase while the cooperators throughput degrade badly with the increasing percent of greedy free-riders in the system. When all the cooperators are non-greedy with long average online time, the system throughput has much room to increase and the cooperators throughput degrade little with a high percent of greedy free-riders in the system. We also find that if a system can tolerate a high percent of greedy free-riders without suffering much throughput degradation, the system must contain some non-greedy cooperators that contribute great idle service capacity to the system.展开更多
In 3G networks upgraded with high speed packet access(HSPA) technology,the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications.To r...In 3G networks upgraded with high speed packet access(HSPA) technology,the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications.To receive files as quickly as possible is essential for mobile users in file sharing applications,since they are subject to unstable signal strength and battery failures.While many researches present peer-to-peer file sharing architectures in mobile environments,few works focus on decreasing the time spent in disseminating files among users.In this paper,we present an efficient peer-to-peer file sharing design for HSPA networks called efficient file sharing(EFS) for 3G networks.EFS can decrease the dissemination time by efficiently utilizing the upstream-bandwidth of mobile nodes.It uses an adaptive rearrangement of a node's concurrent uploading transfers,which causes the count of the node's concurrent uploading transfers to lower while ensuring that the node's upstream-bandwidth can be efficiently utilized.Our simulations show that,EFS achieves much less dissemination time than other protocols including Bullet Prime and a direct implementation of BitTorrent for mobile environments.展开更多
IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this...IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.展开更多
When examining the file transfer performance in a peer-to-peer file sharing system, a fundamental problem is how to describe the service rate for a file transfer. In this paper, the problem is examined by analyzing th...When examining the file transfer performance in a peer-to-peer file sharing system, a fundamental problem is how to describe the service rate for a file transfer. In this paper, the problem is examined by analyzing the distribution of server-like nodes' upstream-bandwidth among their concurrent transfers. A sufficient condition for the service rate, what a receiver obtains for downloading a file, to asymptotically be uniform is presented. On the aggregate service rate for transferring a file in a system, a sufficient condition for it to asymptotically follow a Zipf distribution is presented. These asymptotic equalities are both in the mean square sense. These analyses and the sufficient conditions provide a mathematic base for modeling file transfer processes in peer-to-peer file sharing systems.展开更多
HitPeers conotitute a scalable and highly efficient P2P file sharing system in which all the data file can be shared. The center of HitPeers is the Category Tree (CT). CT collects the published information with catego...HitPeers conotitute a scalable and highly efficient P2P file sharing system in which all the data file can be shared. The center of HitPeers is the Category Tree (CT). CT collects the published information with category. It is flexible enough to let users customize their own local CT. Its hierarchy helps users to find the information they desire most conveniently. To increase the robustness and retain the efficiency, HitPeers will divide the tree into disjoint parts. Every part is a subtree. Some special nodes named Onodes will take charge of the subtree and play the role of a service provider. HitPeers produce more and more Onodes to meet the service demands in the internet scale distributed environment. This paper will show the profile of the whole system.展开更多
The aim of this paper is to analyze the sharing and management of files in a tertiary institution using blockchain architecture. It is expected to enable an online system that could provide a decentralized architectur...The aim of this paper is to analyze the sharing and management of files in a tertiary institution using blockchain architecture. It is expected to enable an online system that could provide a decentralized architecture for multiple transfers and sharing of files amongst participants, to design a system that can provide data integrity and security of files using IBM Blockchain technology, to provide a system that can allow multiple user and multiple transactions at once. The research was motivated because of the security challenges associated with existing system which include: delay in transfer and sharing of files, much authority and task given to a single user in a centralized system, high risk of attack and loss of files, reduced speed of file transfer and file access/retrieval, limited number of users per time. Methodology adopted was Object Oriented Analysis Design Methodology (OOADM) in conjunction with Unified Modeling Language (UML) and IBM Blockchain Technology while the programming language used was HTML, CSS, Java and Node Js. The result after design was a decentralized cloud based file sharing and management system that enables multi-shared, replicated and permissioned transactions amongst participants in a network.展开更多
The recent and unprecedented surge of public interest in peer-to-peer (P2P) file-sharing systems has led to a variety of interesting research questions. How to minimize threats in such an open community is an impor-ta...The recent and unprecedented surge of public interest in peer-to-peer (P2P) file-sharing systems has led to a variety of interesting research questions. How to minimize threats in such an open community is an impor-tant research topic. Trust models have been widely used in estimating the trustworthiness of peers in P2P file-sharing systems where peers can transact with each other without prior experience. However, current P2P trust models almost take no consideration for the nature of trust, fuzzy, complex and dynamic, which results in low efficiency in resisting the attacks of malicious nodes. In this paper, a new trust model named NatureTrust that can alleviate the shortage brought by the nature of trust is proposed. In order to cope with the fuzzy characteristic of trust, linguistic terms are used to express trust. Additionally, fuzzy inference rules are employed to evaluate trust of each transaction so as to handle the complex characteristic of trust. Fur-thermore, risk factor is deployed into NatureTrust to represent and reason with the dynamic characteristic of trust. Both risk and trust factors are considered in evaluating the trustworthiness of each peer. Experimental results show that the trust model analyzed here thus stands against malicious act effectively.展开更多
基金Key-Area Research and Development Program of Guangdong Province No.2020B0101090005National Natural Science Foundation of China under Grant No.62032013,and No.U20B2046+1 种基金111 Project(B16009)the Fundamental Research Funds for the Central Universities N182410001.
文摘Online file management systems enable cooperatively editing and sharing.However,due to the cost of communication and storage infrastructures,traditional online file management services,e.g.,Google Drive and OneDrive,usually provide limited storage space and relatively low download speed for free users.To achieve better performance,ordinary users have to purchase their expensive services.Moreover,these file management systems are based on centralized architecture and bear the privacy leakage risk,because users’personal files are stored and controlled by their servers.To address the above problems,we propose a peer-to-peer(P2P)file management system based on IPFS and Hyperledger Fabric,named as FileWallet,which can serve as a personal wallet for individual users or organizations to store and share their files in a secure manner.In FileWallet,the users form a P2P network and a Fabric network,where P2P network builds the connections and distributed storage network and the Fabric network sustains consistent blockchain ledgers to record file operation related transactions.In our FileWallet,the storage and communication costs are mitigated in the decentralized design,and the file owner can fully control the access permission of the file to preserve the file privacy.The design of the system architecture,main functionalities,and system implementations are presented in this paper.The performance of the system is evaluated through experiments,and the experimental results show its wide applicability and scalability.
文摘A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding （FLD） and random walk （RW）. The result shows that with the proposed design, the queries are muted effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.
基金supported by the National Nature Science Foundation of China(No.60672124)the National High Technology Research and Development Programme the of China(No.2007AA01Z221)
文摘In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.
文摘The bane of achieving a scalable distributed file sharing system is the centralized data system and single server oriented file [sharing] system. In this paper, the solution to the problems in a distributed environment is presented. Thus, inability to upload sizeable files, slow transportation of files, weak security and lack of fault tolerance are the major problems in the existing system. Hence, the utmost need is to build a client-server network that runs on two or more server systems in order to implement scalability, such that when one server is down, the other(s) would still hold up the activities within the network. And to achieve this reliable network environment, LINUX network operating system is recommended among others as a preferred platform for the synchronization of the server systems, such that every user activity like sending of internal memos/mails, publication of academic articles, is replicated;thereby, achieving the proposed result. Hence, Scalable Distributed File Sharing System provides the robustness required to having a reliable intranet.
基金the National High Technology Re-search and Development Program (863) of China(No. 2007AA01Z457)the Shanghai Science and Technology Development Funds (No. 07QA14033)
文摘In a peer-to-peer file-sharing system, a free-rider is a node which downloads files from its peers but does not share files to other nodes. Analyzing the free-riders’ impact on system throughputs is essential in examining the performance of peer-to-peer file-sharing systems. We find that the free-riders’ impact largely depends on nodes behavior, including their online time and greed of downloading files. We extend an existing peer-to-peer system model and classify nodes according to their behavior. We focus on two peer-to-peer architectures: centralized indexing and distributed hash tables. We find that when the cooperators in a system are all greedy in downloading files, the system throughput has little room to increase while the cooperators throughput degrade badly with the increasing percent of greedy free-riders in the system. When all the cooperators are non-greedy with long average online time, the system throughput has much room to increase and the cooperators throughput degrade little with a high percent of greedy free-riders in the system. We also find that if a system can tolerate a high percent of greedy free-riders without suffering much throughput degradation, the system must contain some non-greedy cooperators that contribute great idle service capacity to the system.
基金the National High Technology Research and Development Program (863) of China (No.2007AA01Z457)the Science and Technology Youth Qi-ming-xing Program of Shanghai (No.07QA14033)
文摘In 3G networks upgraded with high speed packet access(HSPA) technology,the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications.To receive files as quickly as possible is essential for mobile users in file sharing applications,since they are subject to unstable signal strength and battery failures.While many researches present peer-to-peer file sharing architectures in mobile environments,few works focus on decreasing the time spent in disseminating files among users.In this paper,we present an efficient peer-to-peer file sharing design for HSPA networks called efficient file sharing(EFS) for 3G networks.EFS can decrease the dissemination time by efficiently utilizing the upstream-bandwidth of mobile nodes.It uses an adaptive rearrangement of a node's concurrent uploading transfers,which causes the count of the node's concurrent uploading transfers to lower while ensuring that the node's upstream-bandwidth can be efficiently utilized.Our simulations show that,EFS achieves much less dissemination time than other protocols including Bullet Prime and a direct implementation of BitTorrent for mobile environments.
基金Sponsored by the National Natural Science Foundation of China(Grant No.60672124 and 60832009)Hi-Tech Research and Development Program(National 863 Program)(Grant No.2007AA01Z221)
文摘IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.
基金National High Technology Research and Development Program of China (No.2007AA01Z457)Shanghai Science and Technology Development Fundation,China(No.07QA14033)
文摘When examining the file transfer performance in a peer-to-peer file sharing system, a fundamental problem is how to describe the service rate for a file transfer. In this paper, the problem is examined by analyzing the distribution of server-like nodes' upstream-bandwidth among their concurrent transfers. A sufficient condition for the service rate, what a receiver obtains for downloading a file, to asymptotically be uniform is presented. On the aggregate service rate for transferring a file in a system, a sufficient condition for it to asymptotically follow a Zipf distribution is presented. These asymptotic equalities are both in the mean square sense. These analyses and the sufficient conditions provide a mathematic base for modeling file transfer processes in peer-to-peer file sharing systems.
文摘HitPeers conotitute a scalable and highly efficient P2P file sharing system in which all the data file can be shared. The center of HitPeers is the Category Tree (CT). CT collects the published information with category. It is flexible enough to let users customize their own local CT. Its hierarchy helps users to find the information they desire most conveniently. To increase the robustness and retain the efficiency, HitPeers will divide the tree into disjoint parts. Every part is a subtree. Some special nodes named Onodes will take charge of the subtree and play the role of a service provider. HitPeers produce more and more Onodes to meet the service demands in the internet scale distributed environment. This paper will show the profile of the whole system.
文摘The aim of this paper is to analyze the sharing and management of files in a tertiary institution using blockchain architecture. It is expected to enable an online system that could provide a decentralized architecture for multiple transfers and sharing of files amongst participants, to design a system that can provide data integrity and security of files using IBM Blockchain technology, to provide a system that can allow multiple user and multiple transactions at once. The research was motivated because of the security challenges associated with existing system which include: delay in transfer and sharing of files, much authority and task given to a single user in a centralized system, high risk of attack and loss of files, reduced speed of file transfer and file access/retrieval, limited number of users per time. Methodology adopted was Object Oriented Analysis Design Methodology (OOADM) in conjunction with Unified Modeling Language (UML) and IBM Blockchain Technology while the programming language used was HTML, CSS, Java and Node Js. The result after design was a decentralized cloud based file sharing and management system that enables multi-shared, replicated and permissioned transactions amongst participants in a network.
文摘The recent and unprecedented surge of public interest in peer-to-peer (P2P) file-sharing systems has led to a variety of interesting research questions. How to minimize threats in such an open community is an impor-tant research topic. Trust models have been widely used in estimating the trustworthiness of peers in P2P file-sharing systems where peers can transact with each other without prior experience. However, current P2P trust models almost take no consideration for the nature of trust, fuzzy, complex and dynamic, which results in low efficiency in resisting the attacks of malicious nodes. In this paper, a new trust model named NatureTrust that can alleviate the shortage brought by the nature of trust is proposed. In order to cope with the fuzzy characteristic of trust, linguistic terms are used to express trust. Additionally, fuzzy inference rules are employed to evaluate trust of each transaction so as to handle the complex characteristic of trust. Fur-thermore, risk factor is deployed into NatureTrust to represent and reason with the dynamic characteristic of trust. Both risk and trust factors are considered in evaluating the trustworthiness of each peer. Experimental results show that the trust model analyzed here thus stands against malicious act effectively.
