The Experts below are selected from a list of 7068 Experts worldwide ranked by ideXlab platform
Kang Chen - One of the best experts on this subject based on the ideXlab platform.
-
social p2p an online social network based p2p File sharing system
IEEE Transactions on Parallel and Distributed Systems, 2015Co-Authors: Haiying Shen, Ze Li, Kang ChenAbstract:A peer-to-peer (P2P) File sharing system provides a platform that enables a tremendous number of nodes to share their Files. Retrieving desired Files efficiently and trustworthily is critical in such a large and jumbled system. However, the issues of efficient Searching and trustworthy Searching have only been studied separately. Simply combining the methods to achieve the two goals doubles system overhead. In this paper, we first study trace data from Facebook and BitTorrent. Guided by the observations, we propose a system that integrates a social network into a P2P network, named Social-P2P, for simultaneous efficient and trustworthy File sharing. It incorporates three mechanisms: (1) interest/trust-based structure, (2) interest/trust-based File Searching, and (3) trust relationship adjustment. By exploiting the social interests and relationships in the social network, the interest/trust-based structure groups common-multi-interest nodes into a cluster and further connects socially close nodes within a cluster. The comparably stable nodes in each cluster form a Distributed Hash Table (DHT) for inter-cluster File Searching. In the interest/trust-based File Searching mechanism, a File query is forwarded to the cluster of the File by the DHT routing first. Then, it is forwarded along constructed connections within a cluster, which achieves high hit rate and reliable routing. Moreover, sharing Files among socially close friends discourages nodes from providing faulty Files because people are unlikely to risk their reputation in the real-world. In the trust relationship adjustment mechanism, each node in a routing path adaptively decreases its trust on the node that has forwarded a faulty File in order to avoid routing queries towards misbehaving nodes later on. We conducted extensive trace-driven simulations and implemented a prototype on PlanetLab. Experimental results show that Social-P2P achieves highly efficient and trustworthy File sharing compared to current File sharing systems and trust management systems.
Haiying Shen - One of the best experts on this subject based on the ideXlab platform.
-
social p2p an online social network based p2p File sharing system
IEEE Transactions on Parallel and Distributed Systems, 2015Co-Authors: Haiying Shen, Ze Li, Kang ChenAbstract:A peer-to-peer (P2P) File sharing system provides a platform that enables a tremendous number of nodes to share their Files. Retrieving desired Files efficiently and trustworthily is critical in such a large and jumbled system. However, the issues of efficient Searching and trustworthy Searching have only been studied separately. Simply combining the methods to achieve the two goals doubles system overhead. In this paper, we first study trace data from Facebook and BitTorrent. Guided by the observations, we propose a system that integrates a social network into a P2P network, named Social-P2P, for simultaneous efficient and trustworthy File sharing. It incorporates three mechanisms: (1) interest/trust-based structure, (2) interest/trust-based File Searching, and (3) trust relationship adjustment. By exploiting the social interests and relationships in the social network, the interest/trust-based structure groups common-multi-interest nodes into a cluster and further connects socially close nodes within a cluster. The comparably stable nodes in each cluster form a Distributed Hash Table (DHT) for inter-cluster File Searching. In the interest/trust-based File Searching mechanism, a File query is forwarded to the cluster of the File by the DHT routing first. Then, it is forwarded along constructed connections within a cluster, which achieves high hit rate and reliable routing. Moreover, sharing Files among socially close friends discourages nodes from providing faulty Files because people are unlikely to risk their reputation in the real-world. In the trust relationship adjustment mechanism, each node in a routing path adaptively decreases its trust on the node that has forwarded a faulty File in order to avoid routing queries towards misbehaving nodes later on. We conducted extensive trace-driven simulations and implemented a prototype on PlanetLab. Experimental results show that Social-P2P achieves highly efficient and trustworthy File sharing compared to current File sharing systems and trust management systems.
Isaac Woungang - One of the best experts on this subject based on the ideXlab platform.
-
using bee algorithm for peer to peer File Searching in mobile ad hoc networks
Journal of Network and Computer Applications, 2011Co-Authors: Sanjay Kumar Dhurandher, Sudip Misra, Puneet Pruthi, Shubham Singhal, Saurabh Aggarwal, Isaac WoungangAbstract:In this work, we present a P2PBA algorithm that refers to a peer-to-peer File Searching method, which uses the bees algorithm. The proposed algorithm has been designed with an aim towards providing an efficient peer-to-peer (P2P) File search in mobile ad hoc networks (MANETs). With reference to Li et al. (2004) and Gerla and Lindemann (2005) it has been observed that the implementation of P2P File sharing system on MANETs is quite tricky to implement as compared to that on a wired network. With the advent of swarm intelligence, the P2P File sharing methodology not only found an optimized search process involving a more selective node tracing, but it also proved to improve the time efficiency and robustness of the sharing mechanism. The P2P File Searching system implementation, particularly in a network of mobile nodes, poses: (a) the percentage network area scanned and (b) the selective File retrieval from a set of File bearing nodes as the biggest challenges. Managing nodes scattered over a large terrain is not easy. Node connectivity and File information become more volatile as the network area increases. Probability of retrieving a File from a profitable source is also a yardstick to determine how good the File retrieval algorithm is. This algorithm referred to as P2PBA implements the P2P File Searching process using the bee algorithm (Pham et al., 2006b; Wedde and Farooq, 2005) and aims at solving these two challenges. This scheme of swarm-based intelligence, which is based on the foraging behavior of honey bees, optimizes the search process selectively hunting for more promising honey sources and scans a sizeable area in a more comprehensive manner. Following a description of the proposed algorithm, this paper finally presents the simulation results for the network against various specified parameters. The simulation results show that our algorithm proposes to make File Searching much more efficient and improves the statistics against the posed challenges.
Ze Li - One of the best experts on this subject based on the ideXlab platform.
-
social p2p an online social network based p2p File sharing system
IEEE Transactions on Parallel and Distributed Systems, 2015Co-Authors: Haiying Shen, Ze Li, Kang ChenAbstract:A peer-to-peer (P2P) File sharing system provides a platform that enables a tremendous number of nodes to share their Files. Retrieving desired Files efficiently and trustworthily is critical in such a large and jumbled system. However, the issues of efficient Searching and trustworthy Searching have only been studied separately. Simply combining the methods to achieve the two goals doubles system overhead. In this paper, we first study trace data from Facebook and BitTorrent. Guided by the observations, we propose a system that integrates a social network into a P2P network, named Social-P2P, for simultaneous efficient and trustworthy File sharing. It incorporates three mechanisms: (1) interest/trust-based structure, (2) interest/trust-based File Searching, and (3) trust relationship adjustment. By exploiting the social interests and relationships in the social network, the interest/trust-based structure groups common-multi-interest nodes into a cluster and further connects socially close nodes within a cluster. The comparably stable nodes in each cluster form a Distributed Hash Table (DHT) for inter-cluster File Searching. In the interest/trust-based File Searching mechanism, a File query is forwarded to the cluster of the File by the DHT routing first. Then, it is forwarded along constructed connections within a cluster, which achieves high hit rate and reliable routing. Moreover, sharing Files among socially close friends discourages nodes from providing faulty Files because people are unlikely to risk their reputation in the real-world. In the trust relationship adjustment mechanism, each node in a routing path adaptively decreases its trust on the node that has forwarded a faulty File in order to avoid routing queries towards misbehaving nodes later on. We conducted extensive trace-driven simulations and implemented a prototype on PlanetLab. Experimental results show that Social-P2P achieves highly efficient and trustworthy File sharing compared to current File sharing systems and trust management systems.
Sanjay Kumar Dhurandher - One of the best experts on this subject based on the ideXlab platform.
-
using bee algorithm for peer to peer File Searching in mobile ad hoc networks
Journal of Network and Computer Applications, 2011Co-Authors: Sanjay Kumar Dhurandher, Sudip Misra, Puneet Pruthi, Shubham Singhal, Saurabh Aggarwal, Isaac WoungangAbstract:In this work, we present a P2PBA algorithm that refers to a peer-to-peer File Searching method, which uses the bees algorithm. The proposed algorithm has been designed with an aim towards providing an efficient peer-to-peer (P2P) File search in mobile ad hoc networks (MANETs). With reference to Li et al. (2004) and Gerla and Lindemann (2005) it has been observed that the implementation of P2P File sharing system on MANETs is quite tricky to implement as compared to that on a wired network. With the advent of swarm intelligence, the P2P File sharing methodology not only found an optimized search process involving a more selective node tracing, but it also proved to improve the time efficiency and robustness of the sharing mechanism. The P2P File Searching system implementation, particularly in a network of mobile nodes, poses: (a) the percentage network area scanned and (b) the selective File retrieval from a set of File bearing nodes as the biggest challenges. Managing nodes scattered over a large terrain is not easy. Node connectivity and File information become more volatile as the network area increases. Probability of retrieving a File from a profitable source is also a yardstick to determine how good the File retrieval algorithm is. This algorithm referred to as P2PBA implements the P2P File Searching process using the bee algorithm (Pham et al., 2006b; Wedde and Farooq, 2005) and aims at solving these two challenges. This scheme of swarm-based intelligence, which is based on the foraging behavior of honey bees, optimizes the search process selectively hunting for more promising honey sources and scans a sizeable area in a more comprehensive manner. Following a description of the proposed algorithm, this paper finally presents the simulation results for the network against various specified parameters. The simulation results show that our algorithm proposes to make File Searching much more efficient and improves the statistics against the posed challenges.