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.展开更多
Peer-to-peer (P2P) file sharing systems assume that their users download files in proportion to their sharing. Unfortunately, users are unlikely to do so without an incentive mechanism. Previous solutions to the pro...Peer-to-peer (P2P) file sharing systems assume that their users download files in proportion to their sharing. Unfortunately, users are unlikely to do so without an incentive mechanism. Previous solutions to the problem required some types of centralized control, which strays from the spirit of P2P to provide long-term incentives. This paper presents the balance-based bandwidth allocation, B^3A, an incentive framework to inspire participants to share files. In the B^3A framework, each peer keeps the differences between the amount of data it has received from each peer and the amount it has sent to that one. When receiving simultaneous requests from various peers, the peer prefers to allocate its limited upload bandwidth to those peers with larger differences. Therefore, the downloading bandwidth perceived by a peer is positively related to its contributions to others, consequently stimulating it to share more files. The B^3A framework is fully decentralized, scalable, and secure.展开更多
This article describes a new model of a cooperative file sharing system in a wireless Mesh network. The authors' approach is to develop an efficient and cooperative file sharing mechanism based on opportunistic rando...This article describes a new model of a cooperative file sharing system in a wireless Mesh network. The authors' approach is to develop an efficient and cooperative file sharing mechanism based on opportunistic random linear Network Coding. Within this mechanism, every node transmits random linear combination of its packets according to cooperative priority, which is computed in a distributed manner according to the node-possible contribution to its neighbor nodes. With this mechanism, the more a node contributes to others, the more the node has chances to recover the entire file first. The performance metrics of interest here are: the delay until all the packets in a file have been delivered to all nodes, and an ideal packet size, by the use of which the authors can get the minimum transmission delay. Through extensive simulation the authors compare their mechanism with the current transmission process in a wireless Mesh network without random linear Network Coding. The authors found that using their mechanism, the nodes can cooperatively share the entire file with less transmission time and delay than the current transmission process without random linear network.展开更多
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%.展开更多
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.展开更多
Proxy Re-encryption(PRE) is greatly concerned by researchers recently. It potentially has many useful applications in network communications and file sharing. Secure distributed cryptographic file system is one of its...Proxy Re-encryption(PRE) is greatly concerned by researchers recently. It potentially has many useful applications in network communications and file sharing. Secure distributed cryptographic file system is one of its applications. But the practical applications of PRE are few. And even fewer of them are tested by systematically designed experiments. Appling a couple of representative algorithms proposed by BBS,Ateniese,Shao,et al.,a distributed file system is designed. In the system,some substitute mechanisms such as data dispersal,dynamic file sharing,are well-applied. A lot of features such as flexible authorization and data redundancy are embraced in the system. The comparison evaluation justified that the system is more practical and efficient.展开更多
Nowadays, an increasing number of persons choose to outsource their computing demands and storage demands to the Cloud. In order to ensure the integrity of the data in the untrusted Cloud, especially the dynamic files...Nowadays, an increasing number of persons choose to outsource their computing demands and storage demands to the Cloud. In order to ensure the integrity of the data in the untrusted Cloud, especially the dynamic files which can be updated online, we propose an improved dynamic provable data possession model. We use some homomorphic tags to verify the integrity of the file and use some hash values generated by some secret values and tags to prevent replay attack and forgery attack. Compared with previous works, our proposal reduces the computational and communication complexity from O(logn) to O(1). We did some experiments to ensure this improvement and extended the model to file sharing situation.展开更多
The underlying premise of peer-to-peer(P2P)systems is the trading of digital resources among individual peers to facilitate file sharing,distributed computing,storage,collaborative applications and multimedia streamin...The underlying premise of peer-to-peer(P2P)systems is the trading of digital resources among individual peers to facilitate file sharing,distributed computing,storage,collaborative applications and multimedia streaming.So-called free-riders challenge the foundations of this system by consuming resources from other peers without offering any resources in return,hindering resource exchange among peers.Therefore,immense effort has been invested in discouraging free-riding and overcoming the ill effects of such unfair use of the system.However,previous efforts have all fallen short of effectively addressing free-riding behaviour in P2P networks.This paper proposes a novel approach based on utilising a credit incentive for P2P networks,wherein a grace period is introduced during which free-riders must reimburse resources.In contrast to previous approaches,the proposed system takes into consideration the upload rate of peers and a grace period.The system has been thoroughly tested in a simulated environment,and the results show that the proposed approach effectively mitigates free-riding behaviour.Compared to previous systems,the number of downloads from free-riders decreased while downloads by contributing peers increased.The results also show that under longer grace periods,the number of downloads by fast peers(those reimbursing the system within the grace period)was greater than the number of downloads by slow peers.展开更多
文摘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 Natural Science Foundation of China (Nos. 60373004, 60373005, 60273007, and 2003CB3169007), and the Na-tional High-Tech Research and Development (863) Program of China (No. 2002AA104580)
文摘Peer-to-peer (P2P) file sharing systems assume that their users download files in proportion to their sharing. Unfortunately, users are unlikely to do so without an incentive mechanism. Previous solutions to the problem required some types of centralized control, which strays from the spirit of P2P to provide long-term incentives. This paper presents the balance-based bandwidth allocation, B^3A, an incentive framework to inspire participants to share files. In the B^3A framework, each peer keeps the differences between the amount of data it has received from each peer and the amount it has sent to that one. When receiving simultaneous requests from various peers, the peer prefers to allocate its limited upload bandwidth to those peers with larger differences. Therefore, the downloading bandwidth perceived by a peer is positively related to its contributions to others, consequently stimulating it to share more files. The B^3A framework is fully decentralized, scalable, and secure.
基金supported by the National Basic Research Program of China (2003CB314806)the Hi-Tech Research and Development Program of China (2007AA12Z321)the National Natural Science Foundation of China (60603060, 60502037 and 90604019).
文摘This article describes a new model of a cooperative file sharing system in a wireless Mesh network. The authors' approach is to develop an efficient and cooperative file sharing mechanism based on opportunistic random linear Network Coding. Within this mechanism, every node transmits random linear combination of its packets according to cooperative priority, which is computed in a distributed manner according to the node-possible contribution to its neighbor nodes. With this mechanism, the more a node contributes to others, the more the node has chances to recover the entire file first. The performance metrics of interest here are: the delay until all the packets in a file have been delivered to all nodes, and an ideal packet size, by the use of which the authors can get the minimum transmission delay. Through extensive simulation the authors compare their mechanism with the current transmission process in a wireless Mesh network without random linear Network Coding. The authors found that using their mechanism, the nodes can cooperatively share the entire file with less transmission time and delay than the current transmission process without random linear network.
基金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%.
基金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.
基金supported by National Science Foundation of China (Grant No.60842006)
文摘Proxy Re-encryption(PRE) is greatly concerned by researchers recently. It potentially has many useful applications in network communications and file sharing. Secure distributed cryptographic file system is one of its applications. But the practical applications of PRE are few. And even fewer of them are tested by systematically designed experiments. Appling a couple of representative algorithms proposed by BBS,Ateniese,Shao,et al.,a distributed file system is designed. In the system,some substitute mechanisms such as data dispersal,dynamic file sharing,are well-applied. A lot of features such as flexible authorization and data redundancy are embraced in the system. The comparison evaluation justified that the system is more practical and efficient.
基金supported by Major Program of Shanghai Science and Technology Commission under Grant No.10DZ1500200Collaborative Applied Research and Development Project between Morgan Stanley and Shanghai Jiao Tong University, China
文摘Nowadays, an increasing number of persons choose to outsource their computing demands and storage demands to the Cloud. In order to ensure the integrity of the data in the untrusted Cloud, especially the dynamic files which can be updated online, we propose an improved dynamic provable data possession model. We use some homomorphic tags to verify the integrity of the file and use some hash values generated by some secret values and tags to prevent replay attack and forgery attack. Compared with previous works, our proposal reduces the computational and communication complexity from O(logn) to O(1). We did some experiments to ensure this improvement and extended the model to file sharing situation.
文摘The underlying premise of peer-to-peer(P2P)systems is the trading of digital resources among individual peers to facilitate file sharing,distributed computing,storage,collaborative applications and multimedia streaming.So-called free-riders challenge the foundations of this system by consuming resources from other peers without offering any resources in return,hindering resource exchange among peers.Therefore,immense effort has been invested in discouraging free-riding and overcoming the ill effects of such unfair use of the system.However,previous efforts have all fallen short of effectively addressing free-riding behaviour in P2P networks.This paper proposes a novel approach based on utilising a credit incentive for P2P networks,wherein a grace period is introduced during which free-riders must reimburse resources.In contrast to previous approaches,the proposed system takes into consideration the upload rate of peers and a grace period.The system has been thoroughly tested in a simulated environment,and the results show that the proposed approach effectively mitigates free-riding behaviour.Compared to previous systems,the number of downloads from free-riders decreased while downloads by contributing peers increased.The results also show that under longer grace periods,the number of downloads by fast peers(those reimbursing the system within the grace period)was greater than the number of downloads by slow peers.