Peer-to-Peer Computing

Author(s):  
Manuela Pereira

The term peer-to-peer (P2P) was originally used to refer to network protocols where all the nodes had the same role and there were no nodes with specific responsibilities to act as the administrators or supervisors of a network (Ye, Makedon, & Ford, 2004). However, with the evolution of Internet as the dominant architecture for applications, contents, and services, applications and services have gradually migrated from the client-server paradigm to the edge services paradigm and now to the P2P computing paradigm. Therefore, nowadays, the term P2P refers to a class of systems and applications that use distributed resources to perform some function in a decentralized manner, where every participating node can act as both a client and a server (Ye et al., 2004). This article provides an overview of P2P computing, being focused on the types of multimedia distribution services and cooperation models in P2P systems. These models are classified regarding the functionality, the degree of decentralization, and the degree of structure of the information system.

Author(s):  
S. H. Kwok ◽  
Y. M. Cheung ◽  
K. Y. Chan

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).


2011 ◽  
pp. 28-65 ◽  
Author(s):  
Choon Hoong Ding ◽  
Sarana Nutanong ◽  
Rajkumar Buyya

Peer-to-peer (P2P) systems are popularly used as “file swapping” networks to support distributed content sharing. A number of P2P networks for file sharing have been developed and deployed. Napster, Gnutella, and Fasttrack are three popular P2P systems. This chapter presents a broad overview of P2P computing and focuses on content sharing networks and technologies. It also emphasizes on the analysis of network topologies used in popular P2P systems. In addition, this chapter also identifies and describes architecture models and compares various characteristics of four P2P systems—Napster, Gnutella, Fasttrack, and OpenFT.


2020 ◽  
Author(s):  
budiono

AbstractManajemen jaringan di era jaringan komputer modern adalah hal yang sangat penting karena setiap perangkat dapat berkoneksi dengan perangkat lain yang berada di seluruh dunia melalui kecanggihan teknologi internet. Tentu saja dengan kemajuan ini membutuhkan suatu sistem pemantauan jaringan komputer yang membantu administrator jaringan dalam mengelola Local Area Network (LAN). Permasalahan yang sering timbul adalah kesulitan untuk mengetahui status open port disaat terjadi trouble ataupun serangan di dalam jaringan karena jumlah port jaringan mencapai 65.536, sehingga membutuhkan waktu yang lebih lama untuk melakukan perbaikan jaringan. Selain itu kebutuhan akan suatu sistem terintegrasi dalam pemantauan proses serta statistik port dalam Local Area Network (LAN) menjadi landasan dalam penelitian ini sehingga dapat meminimalisasi penggunaan sistem yang terlalu banyak dalam pemantauan jaringan komputer. Hasil dari penelitian ini adalah suatu sistem baru hasil modifikasi dari Mandau Registry Tools and Information System dengan menambahkan layanan seperti informasi protokol, statistik port, dan informasi tentang Domain Name System (DNS) dan penambahan layanan Access Control Lists (ACLs) dengan Fail2Ban. Menggunakan tahapan perencanaan, analisis, desain, implementasi, dan pengujian sebagai metode pengembangan sistem, diharapkan penelitian ini dapat membantu pemantauan dan keamanan Local Area Network (LAN) yang lebih baik dengan kompleksitas informasi proses jaringan dan statistik port yang dihasilkan.Lan memiliki kecepatan perpindahan data yang lebih tinggi Berfungsi. dengan baik tanpa adanya jalur telekomunikasi kelainan tidak membutuhkan akses internet.Local area network Lan merupakan sebuah komputer yang saling dihubungkan bersama di dalam satu area tertentu yang tidak begitu luas secara garis besar terdapat dua tipe jaringan atau lan bubar dan jaringan client server.Pada jaringan peer to peer setiap komputer yang terhubung ke jaringan dapat bertindak baik sebagai workstation maupun server. Sedangkan pada Jaringan client server hanya satu komputer yang bertugas sebagai server dan komputer lain berperan sebagai workstation.


Author(s):  
Daniel Cutting ◽  
Aaron Quigley

Client/server approaches to event-based message can scale to millions of users, but at great administrative and financial cost. By contrast, distributed peer-to-peer (P2P) systems offer the promise of smooth scalability from small to large numbers of participants without dedicated infrastructure. Some forms of event-based messaging, such as publish/subscribe, require events to be delivered to groups of consumers based upon their characteristics or interests. Such groups are undefined until the moment of publication and may be very large, posing significant delivery and load distribution problems in P2P environments. This chapter presents Ice, a structured P2P overlay design with scale-free properties that can be used to construct fairly loaded and efficient event-based messaging architectures.


2021 ◽  
Author(s):  
Shahin Talaei

This thesis examines the performance for multimedia distribution and information sharing of social-networking web sites, with a focus on user networks in Facebook. We used real user network data from Facebook together with a synthetic Facebook network in the performance-testing experiments. We tested performance for multimedia distribution and information sharing using three different types of overlay networks: Facebook; structured peer-to-peer (ring topology); and unstructured peer-to-peer (mesh topology). The experiments used Network Simulator 2 (Ns-2) to simulate the network topologies. The results show that structured Peer-to-Peer has the best performance in terms of information transfer, and Facebook has the best performance in regards to average throughput. This thesis shows the strengths and weaknesses of online social networking while sharing information and multimedia content.


2021 ◽  
Author(s):  
Hoda R.K. Nejad

With the emergence of wireless devices, service delivery for ad-hoc networks has started to attract a lot of attention recently. Ad-hoc networks provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad-hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. On the other hand, data access applications in Ad-hoc networks suffer from restricted resources. In this thesis, we explore how to use Cooperative Caching to improve data access efficiency in Ad-hoc network. We propose a Resource-Aware Cooperative Caching P2P system (RACC) for data access applications in Ad-hoc networks. The objective is to improve data availability by considering energy of each node, demand and supply of network. We evaluated and compared the performance of RACC with Simple Cache, CachePath and CacheData schemes. Our simulation results show that RACC improves the lay of query as well as energy usage of the network as compared to Simple Cache, CachePath and CacheData.


Author(s):  
Chr Carter ◽  
Abdennour El Rhalibi ◽  
Madjid Merabti ◽  
A. Taleb Bendiab
Keyword(s):  

2011 ◽  
pp. 278-295
Author(s):  
Irwin Boutboul ◽  
Dikran S. Meliksetian

n this chapter, we propose a new approach for content delivery services by meshing together the best of grid computing and peer-to-peer (P2P) computing. The goal is to design a secure, reliable, and scalable system for efficient and fast delivery of content. The system consists of a combination of nondedicated servers and peers to provide the proposed service. We describe the challenges of designing such a system and discuss possible solutions and trade-offs. We detail the necessary interlacing of grid and P2P feature to achieve the goal. We present a prototype that is built based on the proposed approach.


Sign in / Sign up

Export Citation Format

Share Document