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 Dual Bootstrap Server Based Superpeer Overlay Construction

2012 ◽  
pp. 176-180
Author(s):  
K. suguna ◽  
K. Madhavi
Keyword(s):  
Efficient Method ◽  
Large Scale ◽  
Single Point ◽  
Overlay Network ◽  
Peer To Peer ◽  
Experimental Results ◽  
P2p Systems ◽  
Overlay Construction

Many two-layer hierarchy unstructured peer-to-peer (P2P) systems, comprising of superpeers and ordinary peers improved the performance of large scale P2P systems. The construction and maintenance of the superpeer overlay network play an important role in improving the performance P2P systems. One efficient method of constructing the superpeer overlay network is based on notion of Perfect Difference Networks(PDN).The construction and maintenance of network in this method is controlled by single bootstrap server. Such network is prone to single-point failures. The number of registration requests lost before getting up the failed bootstrap server and the delay in adding new peer to the network gets increased. The mechanism of maintaining and constructing the superpeer overlay network by making use of two bootstrap servers having slight different functionality proposed in this paper avoids single-point failures. It also ensures no loss of registration requests. The experimental results show that the delay in adding new peer to the network and number of registration requests lost are reduced.

Peer-to-Peer Technology for File Sharing

2011 ◽  
pp. 372-377
Author(s):  
S. H. Kwok ◽  
Y. M. Cheung ◽  
K. Y. Chan
Keyword(s):  
File Sharing ◽  
Peer To Peer ◽  
Research Projects ◽  
P2p Networks ◽  
P2p Computing ◽  
Client Server ◽  
P2p Systems ◽  
Internet Users ◽  
P2p File Sharing ◽  
P2p Applications

A recent survey revealed that 18 millions American Internet users, or approximately 14% of total American Internet population have peer-to-peer (P2P) file-sharing applications running on their computers (Rainie & Madden, 2004). Not surprisingly, P2P applications have become common tools for information sharing and distribution since the appearance of Napster (Napster, 2003) in 1999. P2P systems are the distributed systems in which all nodes are equal in terms of functionality and able to directly communicate with each other without the coordination of a powerful server. Anonymity, scalability, fault resilience, decentralization and self-organization are the distinct characteristics of P2P computing (Milojicic et al., 2002) compared with the traditional client-server computing. P2P computing is believed to be capable of overcoming limitations of the computing environment placed by the client-server computing model. Milojicic et al. (2002), for example, suggested that P2P computing is capable of providing improved scalability by eliminating the limiting factor, the centralized server existing in the client-server computing. In the past few years, P2P computing and its promised characteristics have caught the attention of researchers who have studied the existing P2P networks, and the advantages and disadvantage of P2P systems. Important findings include the excessive network traffic caused by flooding-based searching mechanism that must be tackled in order to fully utilize the improved scalability of P2P systems (Matei, Iamnitchi, & Foster, 2002; Portmann & Seneviratne, 2002). There were proposed efficient searching techniques targeted for both structured and unstructured P2P systems. Other research projects were conducted to study, and were intended to complement, the drawbacks brought by distinct characteristics of P2P systems. For example, the P2P users’ free-riding behavior is generally attributed to the anonymity of such form of communication (Adar & Huberman, 2000). Recent research projects have shifted to a new line of investigation of P2P networks from the economic perspective and applications of P2P systems in workplaces (Kwok & Gao, 2004; Tiwana, 2003).

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 IOTA-BT: A P2P File-Sharing System Based on IOTA

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1610 ◽  
Author(s):  
Li-Yuan Hou ◽  
Tsung-Yi Tang ◽  
Tyng-Yeu Liang
Keyword(s):  
Single Point ◽  
Hash Table ◽  
File Sharing ◽  
Peer To Peer ◽  
Cyber Attacks ◽  
Distributed Hash Table ◽  
P2p File Sharing ◽  
File Sharing System ◽  
Transaction Fees ◽  
Quantum Resistant Cryptography

BitTorrent (BT) is the most popular peer-to-peer file-sharing system. According to official BT information, more than 100 million active users use BT for file transfers every month. However, BT mainly relies on either a central tracker (tracker) or distributed hash table (DHT) for locating file seeders while it runs a risk of a single point of failure or cyber-attacks such as Sybil and Eclipses. To attack this problem, we proposed a Peer-to-Peer (P2P) file-sharing system called IOTA-BT by integrating BitTorrent with IOTA in this paper. The advantages of IOTA over blockchain include scalability for high throughput, compatibility with Internet of Things (IoT) footprints, zero transaction fees, partition-tolerant, and quantum-resistant cryptography. The autopeering and neighbor selection of the Coordicide of IOTA is aimed at defending a Sybil or Eclipse attack. IOTA-BT inherits these advantages from IOTA. Moreover, our experimental results have shown that the cost of executing BT functions, such as releasing torrent files and retrieving seeder information on IOTA-BT, is acceptable for improving the security of BT. IOTA-BT can indeed efficiently provide users with a P2P file-sharing environment of higher security.

scholarly journals LIVE STREAMING USING PEER DIVISION MULTIPLEXING

2012 ◽  
pp. 68-71
Author(s):  
ABHISHEK.V. RAO ◽  
MANIKANDAN. A ◽  
AZARUDEEN. A ◽  
DEVENDAR RAO
Keyword(s):  
Network Architecture ◽  
Large Scale ◽  
Black Box ◽  
Peer To Peer ◽  
Live Streaming ◽  
Measurement Study ◽  
P2p Systems ◽  
Using Data

A Number of commercial peer-to-peer (P2P) systems for live streaming have been introduced in recent years. The behaviour of the popular systems has been extensively studied in several measurement papers. However, these studies have to rely on a “black-box” approach, where packet traces are collected from a single or a limited number of measurement points, to infer various properties of the traffic on the control and data planes. Although, such studies are useful to compared different systems from the end user’s perspective. It is difficult to intuitively understand the observed properties without fully reverseengineering the underlying systems. In this paper, we describe the network architecture of Zattoo, one of the largest production, live streaming providers, in Europe, at the time of writing, and present a large-scale measurement study of zattoo, using data collected by the provider. To highlight we found that even, when the zattoo system was heavily loaded with as high as 20000 concurrent users on a single overlay, the median channel join delay remained less than 2-5 s, and that, for a majority of users, the streamed signal lags over-the-air broadcast signal by more than 3 s.

scholarly journals CrowdSFL: A Secure Crowd Computing Framework Based on Blockchain and Federated Learning

Electronics ◽  
2020 ◽  
Vol 9 (5) ◽  
pp. 773 ◽  
Author(s):  
Ziyuan Li ◽  
Jian Liu ◽  
Jialu Hao ◽  
Huimei Wang ◽  
Ming Xian
Keyword(s):  
Large Scale ◽  
Single Point ◽  
Ddos Attack ◽  
Similar Work ◽  
Peer Network ◽  
Other Information ◽  
Local Storage ◽  
And Storage ◽  
Peer To Peer Network ◽  
Distributed Machine Learning

Over the years, the flourish of crowd computing has enabled enterprises to accomplish computing tasks through crowdsourcing in a large-scale and high-quality manner, and therefore how to efficiently and securely implement crowd computing becomes a hotspot. Some recent work innovatively adopted a P2P (peer-to-peer) network as the communication environment of crowdsourcing. Based on its decentralized control, issues like single-point-of-failure or DDoS attack can be overcome to some extent, but the huge computing capacity and storage costs required by this scheme is always unbearable. Federated learning is a distributed machine learning that supports local storage of data, and clients implement training through interactive gradient values. In our work, we combine blockchain with federated learning and propose a crowdsourcing framework named CrowdSFL, that users can implement crowdsourcing with less overhead and higher security. In addition, to protect the privacy of participants, we design a new re-encryption algorithm based on Elgamal to ensure that interactive values and other information will not be exposed to other participants outside the workflow. Finally, we have proved through experiments that our framework is superior to some similar work in accuracy, efficiency, and overhead.

scholarly journals An analysis of structured and unstructured P2P systems over MANET

2021 ◽  
Author(s):  
Cristian Negulescu
Keyword(s):  
Ad Hoc ◽  
Mobile Network ◽  
Overlay Network ◽  
Peer To Peer ◽  
P2p Systems ◽  
P2p File Sharing ◽  
Peer Network ◽  
Hoc Networks ◽  
P2p System ◽  
Resource Aware

Peer-to-peer or P2P file-sharing application on wireless ad hoc mobile network (MANET) has gained a lot of interest in the recent years. A peer-to-peer network is an overlay network that is deployed over ad hoc networks. Our work is analyzing two P2P systems over MANET. The systems evaluated are representing two distinct categories in terms of network topology such as unstructured and structured architectures. RAON or Resource-Aware Overlay Network, which is an improvement of an existent P2P system called Gia, is an unstructured system. CAN or Content-Addressable Network is an existent P2P system in the category of structured architectures. Based on the simulations of the two P2P systems over MANET, we evaluated the performance in terms of query search success rate and query search delay.

Sign in / Sign up

Export Citation Format

Share Document