Scribd
Upload
23 views19 pages

Peer-To-Peer Networks (P2P)

The document discusses peer-to-peer (P2P) networks, highlighting the differences between unstructured and structured networks. It details various structures such as supernodes, trackers, and Distributed Hash Tables (DHT), explaining their roles in data exchange and search efficiency. Additionally, it covers the example of BitTorrent, illustrating how it utilizes trackers and DHTs for torrent management and peer connections.

Uploaded by

brasileiroyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
23 views19 pages

Peer-To-Peer Networks (P2P)

The document discusses peer-to-peer (P2P) networks, highlighting the differences between unstructured and structured networks. It details various structures such as supernodes, trackers, and Distributed Hash Tables (DHT), explaining their roles in data exchange and search efficiency. Additionally, it covers the example of BitTorrent, illustrating how it utilizes trackers and DHTs for torrent management and peer connections.

Uploaded by

brasileiroyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

Peer-to-peer Networks (P2P)

1
Unstructured Peer-to-Peer Networks

2
Unstructured Peer-to-Peer Networks

Search?
3
Unstructured Peer-to-Peer Networks

Disadvantages:
● Coordination overhead
● Inefficient search
○ Flooding incurs high overhead
○ Other strategies may fail to find data
even though it exists in the network
4
Structured Peer-to-Peer Networks
● Different network overlay structures exist:
○ Supernodes [Gnutella 2.0, Kazaa]
○ Trackers and swarms [BitTorrent, e-Donkey]
○ Distributed Hash Tables (DHT) [BitTorrent, e-Donkey]
○ Trees [several proposals for video streaming]
○ ...

5
Peer-to-Peer Networks with Supernodes

6
Normal peers:
● Limited resources
Peer-to-Peer Networks with Supernodes
● Exchange data with other peers
● Inform supernodes what data
they have available

Supernodes:
● More compute resources
● Exchange data with other peers
● Cooperate to answer search
queries 7
Peer-to-Peer Networks with Supernodes
Peers cooperate to exchange data
after performing a search

8
P2P Networks with Trackers

Tracker

9
P2P Networks with Trackers

All nodes communicate with the tracker, for


example, to get a list of other nodes
participating in the network
Tracker

10
P2P Networks with Trackers

Tracker

11
P2P Networks with Trackers

Peers establish direct


connections to exchange data

Tracker

12
P2P Networks with Trackers

Peers establish direct


Peer Exchange (PEX) allows
connections to exchange
peers to exchange lists ofdata
known peers in the swarm
Tracker

13
Exemple: BitTorrent
Network with a tracker and swarm:

● Tracker keeps list of peers and information about torrents


○ Does not participate in data exchanges between clients
● Clients establish direct connections to exchange data
○ Peer selection based on connection speed (tit-for-tat)
○ Clients can be seeders or leechers

14
Distributed Hash Tables (DHT)
● Maps key → value like a hash table
● Key storage and search are distributed across all nodes

0 ● Identifier space represented by a circle (for


example, with 2^128 bits). Each key has a
specific “position” in the circle.

2^32 2^96

2^64
15
Distributed Hash Tables (DHT)
● Maps key → value like a hash table
● Key storage and search are distributed across all nodes

0 ● Identifier space represented by a circle (for


example, with 2^128 bits). Each key has a
specific “position” in the circle.
● Each data item has a specific key, and as such a
2^32 2^96 specific position in the circle.

2^64
16
Distributed Hash Tables (DHT)
● Maps key → value like a hash table
● Key storage and search are distributed across all nodes

0 ● Identifier space represented by a circle (for


example, with 2^128 bits). Each key has a
specific “position” in the circle.
● Each data item has a specific key, and as such a
2^96 specific position in the circle.
● Each active node in the P2P network
“maintains” information for a (small) part of the
identifier space (like pizza slices).
2^64
17
Distributed Hash Tables (DHT)
● Maps key → value like a hash table
● Key storage and search are distributed across all nodes

0 ● Identifier space represented by a circle (for


example, with 2^128 bits). Each key has a
specific “position” in the circle.
● Each data item has a specific key, and as such a
2^96 specific position in the circle.
● Each active node in the P2P network
“maintains” information for a (small) part of the
identifier space (like pizza slices).
2^64 ● Efficient search and maintenance algorithms for
the DHT (search/join/leave/add/remove ops) 18
BitTorrent and DHTs
● Magnet links contain the identifier of a torrent in the DHT
● Clients query the DHT for information about the torrent
○ Using the ID embedded in the magnet link

● DHTs allow the existence of “trackerless” torrents


○ Torrents that are available on the DHT and survive based on PEX
(Peer Exchange)

19

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy