Peer to Peer        Overlay Routing ConceptsSpeaker: Vasileios KomianosSupervisor: Konstantinos OikonomouIonian University...
Peer to Peer Networks• The opposite of client - server architecture.• Distributed systems.• Most famous: Napster, Gnutella.
Why Overlay?[1]• It resides on the application layer.• IP is not focused on peer-to-peer networks.• It does not represent ...
What DHT is?DHT stands for Distributed Hash Tables, imagine asuitable for p2p nets phone book.A file’s or service’s name, ...
The Chord Case[2]Scalable p2p lookup service:• Load balance• Decentralization• Scalability• Availability• Flexible naming
The Chord CaseChord Overlay Topology:   DHT is replaced by finger                          table.Virtual Overlay Circle   ...
To be continued…
References[1] George Coulouris, Jean Dollimore, Tim Kindberg (2005).    Distributed Systems: Concepts and Designs, fourth ...
Upcoming SlideShare
Loading in …5
×

Peer to-peer networks. Chord overlay

1,528 views
1,396 views

Published on

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
1,528
On SlideShare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
15
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Peer to-peer networks. Chord overlay

  1. 1. Peer to Peer Overlay Routing ConceptsSpeaker: Vasileios KomianosSupervisor: Konstantinos OikonomouIonian University, Dept. of Informatics, PostgraduateFor the course: Distributed Networks & Algorithms
  2. 2. Peer to Peer Networks• The opposite of client - server architecture.• Distributed systems.• Most famous: Napster, Gnutella.
  3. 3. Why Overlay?[1]• It resides on the application layer.• IP is not focused on peer-to-peer networks.• It does not represent the network’s physical topology.• Depending on the implementation it can address more objects than IPv4.
  4. 4. What DHT is?DHT stands for Distributed Hash Tables, imagine asuitable for p2p nets phone book.A file’s or service’s name, from now on calledGUID* or key, is being hashed and stored on theDHT. Each GUID is associated with a node’s IP.*Globally Unique Identifier
  5. 5. The Chord Case[2]Scalable p2p lookup service:• Load balance• Decentralization• Scalability• Availability• Flexible naming
  6. 6. The Chord CaseChord Overlay Topology: DHT is replaced by finger table.Virtual Overlay Circle Finger table represents a part of Chord’s topology. Each Chord node needs routing information about only a few nodes. Node position depends on it’s key. Each node is responsible for keys having lower than it’s key value and greater than this of the previous node.
  7. 7. To be continued…
  8. 8. References[1] George Coulouris, Jean Dollimore, Tim Kindberg (2005). Distributed Systems: Concepts and Designs, fourth edition. Addison-Wesley.[2] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan: Chord: A scalable Peer-to- peer Lookup Service for Internet Applications. In Proceedings of ACM SIGCOMM 2001 (San Diego, California, USA, August 27-31). Bibliography[1] Konstantinos Oikonomou, Spyros Sioutas, Ioannis Stavrakakis: Scalable Communication Cost Reduction: The Chord Case. In Ad Hoc Networking Workshop, 2009. Med-Hoc-Net 2009.

×