Peer-to-Peer (P2P) architecture is a decentralized model where each node, or "peer," acts as a client and a server. This contrasts with the traditional client-server model, where a central server provides resources or services, and clients consume them. Here's a detailed breakdown of how P2P architecture works: : In a P2P network, all nodes are equal. Each node can function as both a server and a client. This means each node can request services (acting as a client) and provide services (acting as a server). Node Equality : There is no central server in a P2P network. Instead, tasks and functions are distributed among the nodes in the network. This decentralization makes the network more robust, as there is no single point of failure. Decentralization : Each node in the network can share resources, such as processing power, disk storage, or network bandwidth, with other nodes. This resource sharing is often what makes P2P networks efficient. Resource Sharing : P2P networks are highly scalable. As more nodes join the network, the network's total capacity increases. This is because each new node brings additional resources to the network. Scalability : In a P2P network, nodes need to be able to find each other to share resources. This is often done through a process called discovery. Once nodes have found each other, they can use routing to send messages or help each other. There are different methods for discovery and routing in P2P networks, and the best way often depends on the network's specific requirements. Routing and Discovery : Because resources are distributed among many nodes, P2P networks are often more reliable than traditional client-server networks. If one node fails, others can take over its tasks. This redundancy can also make P2P networks more resistant to attacks or censorship. Redundancy and Reliability : Security can be challenging in P2P networks, as there is no central authority to enforce security policies. However, various methods can secure P2P networks, such as encryption, routing protocols, and reputation systems. Security . Examples of P2P architecture can be seen in file-sharing networks like BitTorrent, communication applications like Skype, and cryptocurrencies like Bitcoin. Each of these uses P2P architecture to provide a service in a decentralized, scalable, and robust way Let's look at how a file is distributed in a Peer-to-Peer architecture. P2P File Distribution This section considers a very natural P2P application: . The file might be a new version of the Linux operating system, a software patch for an existing operating system or application, an MP3 music file, or an MPEG video file. distributing a large file from a single server to many hosts (called peers) In file distribution, the Server must send a copy of the file to each of the peers — placing an enormous burden on the Server and consuming a large amount of server bandwidth. client-server Let's consider a simple model for distributing a file to a fixed set of peers for both architecture types. The Server and the peers are connected to the Internet in the figure below. Peers connected to the Internet trying to download files provided by Server. Let's denote the upload rate of the Server by and the upload rate of the i peer by . Similarly, let's denote the download rate of the Server by and the download rate of the ith peer by . Us th Ui Ds Di Since we are talking about distributing a file, it must have some size; let's denote the file size to be (in bits) and the number of peers that want to obtain it by . F N How long will distributing this file to all the peers (N) take? The distribution time is when it takes to get a copy of the file to all peers. N This will be tough if we don't make certain assumptions. To compute the distribution time for client-server and P2P architecture, we'll simplify the assumption that the , implying that all bottlenecks are in access networks. . Internet core has abundant bandwidth The Server and clients are not participating in any other network applications, so their upload and download access bandwidth can be fully devoted to distributing this file Client-Server Architecture Distribution Time First, determine the client-server architecture's distribution time, which we denote by . In the client-server architecture, none of the peers aids in distributing the file. Here, we make the following observations: D_cs_ The server must transmit one copy of the file to each N peer. Thus the server must share bits. Since the server's upload rate is , the time to distribute the file must be at least . Let’s take an example if we have a 1-kilobyte (1kB) file (1024 bytes), the upload rate of our server is 1 Mbps (megabit per second), and there are 100 peers (N=100). It will take our server at least 0.8s to deliver it to all the peers. N * F U s N * F/U s Let denote the download rate of the peer with the lowest download rate that is, = min{ }. The peer with the lowest download rate cannot obtain F bits of the file in less than F/D seconds. Thus, the minimum distribution time is . D min D min D , D , . . . , D 1 2 N min at least F/D min Putting these two observations together, we obtain This provides a lower bound on the minimum distribution time for the client-server architecture. For large enough, the client-server distribution time is given by . N N * F/Us Thus, the distribution time increases linearly with the number of peers . So, for example, if the number of peers from one week to the next increases a thousand-fold from a thousand to a million, the time required to distribute the file to all peers increases by 1,000. N Peer-2-Peer Architecture Distribution Time Unlike in the client-server (P2P) architecture, each peer can help distribute the file in a peer-to-peer architecture. When a peer receives some file data, it can use its upload capacity to share that data with other peers. Calculating the distribution time in P2P architecture is more complex than in client-server architecture because it depends on how peers distribute portions of the file to each other. However, we can obtain a simple expression for the minimum distribution time based on the following observations: : Only the server has the complete file at the start of distribution. The server needs to send each bit of the file at least once through its access link to make it available to the peers. Therefore, the minimum distribution time is at least the file size (F) divided by the server’s upload speed (Us). It assumes that the peers can redistribute the bits they receive, reducing the need for the server to send them again. Minimum distribution time based on server upload speed : Similar to the client-server architecture, the peer with the slowest download speed (Dmin) cannot receive all the bits of the file in less than the time it takes to transmit the entire file (F / Dmin). Therefore, the minimum distribution time is at least F divided by the download speed of the slowest peer. Minimum distribution time based on the slowest peer download speed : The total upload capacity of the entire system is the sum of the server’s upload rate (Us) and the upload rates of each peer (U1, U2, …, UN). A total of NF bits must be delivered to distribute the file to each of the N peers. This delivery cannot happen faster than the total upload capacity (Utotal). Therefore, the minimum distribution time is at least the full file size (NF) divided by the total upload capacity of the system (Utotal). Total upload capacity of the system Putting these three observations together, we obtain the minimum distribution time for P2P, denoted by . D P2P It provides a lower bound for the minimum distribution time for the P2P architecture. If we imagine that each peer can redistribute a bit as soon as it receives the bit, then there is a redistribution scheme that achieves this lower bound. The figure below compares the minimum distribution time for the client-server and P2P architectures, assuming all peers have the same upload rate u. In Figure 2.23, we have set hour, , and Dmin ≥ Us. Thus, a peer can transmit the entire file in one hour, the server transmission rate is ten times the peer upload rate, and (for simplicity) the peer download rates are set large enough not to have an effect. We see that for the client-server architecture, the distribution time increases linearly and without bounds as the number of peers increases. F / u = 1 Us = 10U However, for the P2P architecture, the minimal distribution time is not only always less than the distribution time of the client-server architecture; it is also less than one hour for any number of peers N. Thus, applications with the P2P architecture can be self-scaling. This scalability directly results from peers being redistributors and consumers of bits. Final Thoughts? P2P networks are a fascinating and powerful technology enabling decentralized, distributed, and resilient applications. They can offer many benefits, such as scalability, efficiency, privacy, and freedom. However, they also face some challenges, such as security, reliability, and regulation. Therefore, it is essential to understand how P2P networks work, their advantages and disadvantages, and how they can be used for different purposes. I hope this article gave you a better understanding of what P2P is. I thank you for taking the time to read my article. Do support me by following me on so that you get notified whenever I publish an article. Hacker Noon Also published . here

Walkthroughs, tutorials, guides, and tips. This story will teach you how to do something new or how to do something better.

zkEVM: A Potential Solution for Ethereum Scalability or a Privacy Nightmare?

An In-Depth Guide to BRC-20 Tokens and Bitcoin NFTs

Dive into insightful articles on decentralized systems, Tech and AI trends

Read My Stories

Too Long; Didn't Read

Boost your HackerNoon story @ $159.99! 🚀

P2P Architecture: How Does It Work?

About Author

Comments

TOPICS

THIS ARTICLE WAS FEATURED IN

Related Stories

Untitled Story

Account Abstraction Could Be The Next Big Thing in Web3

Is Done Better than Perfect? — Part 1

10 Tips for Using Diagrams to Ace The System Design Interview

The 10 Computer Scientists That Made Computers Mainstream

10 Data Structure & Algorithms Books Every Programmer Should Read

Account Abstraction Could Be The Next Big Thing in Web3

Is Done Better than Perfect? — Part 1

10 Tips for Using Diagrams to Ace The System Design Interview

The 10 Computer Scientists That Made Computers Mainstream

10 Data Structure & Algorithms Books Every Programmer Should Read

Light-Mode

Classic

Newspaper

Dark-Mode

Neon Noir

Minty

HN StartUps