scholarly journals Survey of Network Coding Based P2P File Sharing in Large Scale Networks

2020 ◽  
Author(s):  
Anas AbuDaqa ◽  
Ashraf Mahmoud ◽  
Marwan Abu-Amara ◽  
Tarek Sheltami
Keyword(s):  
Network Coding ◽  
Distribution Systems ◽  
Large Scale ◽  
Content Distribution ◽  
File Sharing ◽  
Download Time ◽  
Survey Paper ◽  
Unreliable Networks ◽  
P2p File Sharing ◽  
Large Scale Networks

Peer-to-peer (P2P) content distribution or file sharing system aims to facilitate the dissemination of large files over unreliable networks. Network coding is a new transmission technique that has captured the interest of researchers because of its ability to increase throughput and robustness of the network, and decrease the download time. In this survey paper, we extensively summarize, assess, compare, and classify the most recently used techniques to improve P2P content distribution systems performance using network coding. To the best of our knowledge, this survey is the first comprehensive survey that specifically focuses on the performance of network coding based P2P file sharing systems.

scholarly journals Survey of Network Coding Based P2P File Sharing in Large Scale Networks

2020 ◽  
Vol 10 (7) ◽  
pp. 2206
Author(s):  
Anas A. AbuDaqa ◽  
Ashraf Mahmoud ◽  
Marwan Abu-Amara ◽  
Tarek Sheltami
Keyword(s):  
Network Coding ◽  
Distribution Systems ◽  
Large Scale ◽  
Content Distribution ◽  
File Sharing ◽  
Download Time ◽  
Survey Paper ◽  
Unreliable Networks ◽  
P2p File Sharing ◽  
Large Scale Networks

Peer-to-peer (P2P) content distribution and file sharing systems aim to facilitate the dissemination of large files over unreliable networks. Network coding is a transmission technique that has captured the interest of researchers because of its ability to increase throughput and robustness of the network, and decrease the download time. In this survey paper, we extensively summarize, assess, compare, and classify the most recently used techniques to improve P2P content distribution systems performance using network coding. To the best of our knowledge, this survey is the first comprehensive survey that specifically focuses on the performance of network coding based P2P file sharing systems.

scholarly journals An Efficient Framework for Large Scale Multimedia Content Distribution in P2P Network: I2NC

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
M. Anandaraj ◽  
P. Ganeshkumar ◽  
K. P. Vijayakumar ◽  
K. Selvaraj
Keyword(s):  
Network Coding ◽  
Large Scale ◽  
Content Distribution ◽  
Distribution Network ◽  
Network Routing ◽  
P2p Network ◽  
Content Distribution Network ◽  
Download Time ◽  
Information Block ◽  
Traffic Reduction

Network coding (NC) makes content distribution more effective and easier in P2P content distribution network and reduces the burden of the original seeder. It generalizes traditional network routing by allowing the intermediate nodes to generate new coded packet by combining the received packets. The randomization introduced by network coding makes all packets equally important and resolves the problem of locating the rarest block. Further, it reduces traffic in the network. In this paper, we analyze the performance of traditional network coding in P2P content distribution network by using a mathematical model and it is proved that traffic reduction has not been fully achieved in P2P network using traditional network coding. It happens due to the redundant transmission of noninnovative information block among the peers in the network. Hence, we propose a new framework, called I2NC (intelligent-peer selection and incremental-network coding), to eliminate the unnecessary flooding of noninnovative coded packets and thereby to improve the performance of network coding in P2P content distribution further. A comparative study and analysis of the proposed system is made through various related implementations and the results show that 10–15% of traffic reduced and improved the average and maximum download time by reducing original seeder’s workload.

scholarly journals A Measurement Study of the Structured Overlay Network in P2P File-Sharing Systems

2007 ◽  
Vol 2007 ◽  
pp. 1-9 ◽  
Author(s):  
Mo Zhou ◽  
Yafei Dai ◽  
Xiaoming Li
Keyword(s):  
Large Scale ◽  
Single Point ◽  
Overlay Network ◽  
File Sharing ◽  
Measurement Study ◽  
P2p Systems ◽  
Ddos Attack ◽  
P2p File Sharing ◽  
Structured Overlay ◽  
Single User

The architecture of P2P file-sharing applications has been developing to meet the needs of large scale demands. The structured overlay network, also known as DHT, has been used in these applications to improve the scalability, and robustness of the system, and to make it free from single-point failure. We believe that the measurement study of the overlay network used in the real file-sharing P2P systems can provide guidance for the designing of such systems, and improve the performance of the system. In this paper, we perform the measurement in two different aspects. First, a modified client is designed to provide view to the overlay network from a single-user vision. Second, the instances of crawler programs deployed in many nodes managed to crawl the user information of the overlay network as much as possible. We also find a vulnerability in the overlay network, combined with the character of the DNS service, a more serious DDoS attack can be launched.

scholarly journals Secure-Network-Coding-Based File Sharing via Device-to-Device Communication

2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Lei Wang ◽  
Qing Wang
Keyword(s):  
Network Coding ◽  
Large Scale ◽  
File Sharing ◽  
User Needs ◽  
Sharing Scheme ◽  
Device To Device ◽  
Share Data ◽  
Secure Network ◽  
Original File ◽  
Secure Network Coding

In order to increase the efficiency and security of file sharing in the next-generation networks, this paper proposes a large scale file sharing scheme based on secure network coding via device-to-device (D2D) communication. In our scheme, when a user needs to share data with others in the same area, the source node and all the intermediate nodes need to perform secure network coding operation before forwarding the received data. This process continues until all the mobile devices in the networks successfully recover the original file. The experimental results show that secure network coding is very feasible and suitable for such file sharing. Moreover, the sharing efficiency and security outperform traditional replication-based sharing scheme.

PROBING HIGH-CAPACITY PEERS TO REDUCE DOWNLOAD TIMES IN P2P FILE SHARING SYSTEMS WITH STOCHASTIC SERVICE CAPACITIES

2012 ◽  
Vol 23 (06) ◽  
pp. 1341-1369 ◽  
Author(s):  
KEQIN LI
Keyword(s):  
High Capacity ◽  
Random Variable ◽  
File Sharing ◽  
Peer To Peer ◽  
Optimal Choice ◽  
Optimal Order ◽  
Peer Selection ◽  
Download Time ◽  
P2p File Sharing ◽  
Switching Method

The main problem for an individual user peer in a peer-to-peer network with heterogeneous source peers is the peer selection problem, namely, switching among source peers and finally settling on one, while keeping the total time of probing and downloading to a minimum. There has been little investigation on selecting source peers with stochastic service capacities. The main contribution of this paper is to address the problem of reducing download times in peer-to-peer file sharing systems with stochastic service capacities. A precise analysis of the expected download time is given when the service capacity of a source peer is a random variable. A chunk-based switching and peer selection algorithm using the method of probing high-capacity peers is proposed and the expected download time of the algorithm is analyzed. Two subproblems of the optimal choice of the threshold of high-capacity source peers and the optimal order of probing are also solved. The performance of the algorithm is compared with the random chunk-based switching method. It is shown that noticeable performance improvement can be obtained.

Sign in / Sign up

Export Citation Format

Share Document