tl
 
tr
lunder
camera
CE 7490: Advanced Topics in Distributed Systems
First half of the course provides some basic concepts and principles of distributed computing, followed by different aspects of distributed simulations (lectured by visiting professor Rassul Ayani).
 
In the second part, I teach various concepts of P2P systems - particularly Structured Peer-to-Peer Systems. This webpage is based on the material from the second half.
 
The projects in the course are simulation based, providing a link between the two modules.
runder
lcunder
Wordpress ThemesMiche Bag
rcunder
lnavl
Lecture modules
lnavr
navtop
lnavs
The P2P Paradigm
rnavs
lnavs
Structured Overlays Concepts
rnavs
lnavs
Bootstrapping Issues
rnavs
lnavs
Maintenance Issues
rnavs
lnavs
Graph Theoretic Foundations
rnavs
lnavs
Security Issues
rnavs
lnavs
Applications
bottomnav
lnavl
Projects (Simulation based)
lnavr
navtop
lnavs
Chord network merger
rnavs
lnavs
Storage system maintenance
rnavs
bottomnav
lnavl
Online resources
lnavr
navtop
lnavs
rnavs
lnavs
rnavs
bottomnav

 © Anwitaman Datta, 2009

Back to my homepage

 

spacerl
spacerr
     
  Below is a brief description of the different aspects of structured overlays covered in the lectures as well as mention of some issues which are not covered due to lack of time, but fit in the context.  
 
The P2P Paradigm
     
 
History and philosophy of the P2P paradigm
 
     
     
 
P2P paradigm from the perspective of distributed systems
 
     
     
 
Concepts of decentrlaization and self-organization
 
     
     
     
 
Structured Overlays: Basic Concepts
     
 
Motivation: Resource location at the large, unstructured overlays (Gnutella, Kazaa, ...)
 
     
     
 
The bare basic essentials: Key-space partitioning, Key-to-Peer binding, Routing mechanism, Network maintenance
 
     
     
 
Example systems: Chord, P-Grid, CAN, Koorde - Emphasis on topology and routing mechanisms
 
     
     
 
Performance metrics: Number of hops, fundamental trade-offs, recall, ...
 
     
 
Bootstrapping Overlays
     
 
Concerns (desirable properties): Load-balancing, proximity
 
     
     
 
Mechanisms: Traditional quasi-sequential, parallelized, decentrlaized (merger mechanisms)
 
     
     
 
Characterization: Overheads, Latency, Quality of desirable properties like load-balance
 
     
     
 
 
 
     
 
Overlay Maintenance
     
 
Need: Churn, Load-imbalance
 
     
     
 
Mechanisms for load-rebalancing
 
     
     
 
Mechanisms for handling churn: Reactive, Periodic checks and Proactive
 
     
 
Graph Theoretic Foundations
     
 
Interconnection Networks (not covered in the lectures)
 
     
     
 
Cayley graphs (not covered in the lectures)
 
     
     
 
Small-world graphs and models: Social networks, Watts-Strogatz model, Klienberg model
 
     
     

 

 
Security Issues
     
 
Vulnerabilities
 
     
     
 
Possible attack and overload scenarios
 
     
     
 
Potential solutions for alleviating and protecting structured overlays
 
     
     
     
     
 
Applications
     
 
Chord based Cooperative File Systems
 
     
     
 
Scribe based multicast and publish/subscribe
 
     
     
 
Squirrel based Web Caching
 
     
     
 
Other representative applications (not covered but generally mentioned): P2P storage and back-up systems, ePost, P2P DNS, P2P infrastructure for online social networks, Peer data management systems P2P information retrieval, P2P data-mining