CN Scribe - 05 - 02 - 2024
CN Scribe - 05 - 02 - 2024
Peer-to-Peer Network
Based on the ability of the file distribution system (Because it is necessary to know the location
of a resource on a P2P network for it to be utilized), it is commonly classified as:
1. Hybrid P2P
- combination of both client-server and P2P
- comprises indexing servers and peers
- indexing server is responsible for keeping track of which peers have which files, their
locations, and other relevant information for resource discovery.
- users (peers) can query the indexing server to search for specific files or resources
across the network.
Example: DC++, BitTorrent
Problems:
- Single Point of failure
- Scalability
2. Pure P2P
Pure P2P networks can be further classified as structured and unstructured based on the
organisation of the network and the way peers are connected.
Example: Gnutella
a. Structured P2P
In this, the connections between peers follow a specific organization. Implemented using
hash value.
- Resources are associated with unique hash values generated by a hash function.
-
DHT (Distributed Hash Table): decentralized data structure maps hash values to
network nodes
- Peers insert resources into the DHT based on their hash values (resource
indexing)
- peers query the DHT to locate resources efficiently based on their hash values.
- each node maintains a finger table to route queries and find responsible nodes
for specific hash ranges.
Problems:
- maintaining and searching in the finger table
- inaccurate search queries eg: Ankmal instead of Animal
b. Unstructured P2P
There is no strict organization/ predefined structure for the connections between peers.
Peers connect in a more ad-hoc manner, like the human network.
Working:
When a peer in the network is searching for specific data, it sends a query to its
immediate neighbours. If the queried neighbour has the required data, it returns the
result to the querying peer. If the queried neighbour does not have the data, it forwards
the query to its own neighbours. This process continues recursively as the query
propagates through the network.
Problems:
- Content Delivery is not guaranteed
- Inefficient, especially in large networks, queries may take multiple hops to find
the data.
Reputation management in P2P networks involves evaluating and assigning trust to peers
based on their past behaviour, cooperation and reliability. Helps to mitigate the above problems
like free-riding and unreliable content delivery. For example, users with a positive reputation
may be prioritized for interactions.
Streaming
challenges
- server-client bandwidth will vary over time, with changing network congestion levels
(house, access network, video server)
- packet loss, delay due to congestion will delay or result in poor video quality
problems in streaming
- Live streaming, concurrent users for a single resource
- flash crowds handling
- Less response time (to feel real-time) in gaming scenarios