This video explains the basic algorithms used in implementing a P2P network. The theory covered here is based on the popular P2P network algorithsm Chord, Ka…
Peer-to-peer (P2P) Networks – Basic Algorithms
Clickbank Market Place
Find your Favorite Products
Hi Pradeep, you need some way which the peers can get to know each other
when they at first know no other peers in the system. Either you host a set
of boot peers, or you can have some kind of UDP broadcast message (works
only on local network). Once a peer has been connected to a P2P network, it
can attempt to contact any of the previous peers in the network when
starting up, instead of relying on the boot peers.
Hello jakob, I am working on p2p systems for my master thesis. Now I have
UDP server and client. How can I make connection between two or three
different systems, i.e p2p way when each of them atleast knew other then
they can connect.
i don’t understand how a new peer get the routing table. all the new peers
have to ask to a fixed peer the routine table (like a server i guess) but
then if that peer is down for any reason the new peer won’t be able to get
the routing table and then it won’t be albe to get in to the p2p network…
did i get it right? thanks
Nice video. Very clear.
Chord DHT explained:
thanks u so much, i was seen your tutorial, that’s so useful.
Which element is the slowest during in P2P’s? Like building an routing
table, management, etc?
Thnks for your reply! I have another question I am compiling a state of the
art research document of P2P for a project im working on. Do you know of
any good P2P resources online? As there is masses of info I am just having
a problem finding decent P2P material regarding algorithms.
I’ve been working as a software developer for almost 12 years now and this
is something that I didn´t know, so thank you very much for the video!
Peer 0 has peer 1, 2, 4 and 8 in its routing table, and thus it can contact
each of those.
Peer 0 has a direct connection to peer 8. The shortest path to peer 8 is 1
hub – a direct connection. The packet does not go through peer 1 and 2, if
it is for peer 8.
Okay the only part i don’t understand is when peer 0 wants to contact peer
15 then like you said it will first try to contact peer 8. But how does it
send a message to peer 8 cause most likely there will be no physical
connection between them. So if 0 is physically connected to 1 and 2 how
does it decide which to send the message for 8 and how do these nodes
decide on how to forward the packet. If could explain that it would be
really nice.
Thank you very much.. perhaps the video could be a bit shorter 🙂
Building the routing table from scratch is probably the slowest part.