• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
HyperCuP Lightweight Implementation
 

HyperCuP Lightweight Implementation

on

  • 1,560 views

A presentation of HLI project: HyperCuP Lightweight Implementation.

A presentation of HLI project: HyperCuP Lightweight Implementation.

Statistics

Views

Total Views
1,560
Views on SlideShare
1,560
Embed Views
0

Actions

Likes
1
Downloads
26
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

HyperCuP Lightweight Implementation HyperCuP Lightweight Implementation Presentation Transcript

  • HyperCuP Lightweight Implementation Slawomir Grzonkowski slawomir.grzonkowski @deri.org Seoul 2007
  • Presentation outline
    • Motivations
    • Hypercubes
    • HyperCuP
    • HyperCuP Lightweight Implementation
    • Related Work
    • Future Works
  • Motivations
    • We need an efficient broadcast algorithm in distributed systems
    • Peers should be equally balanced
    • All nodes should be be accessible in reasonable time
    • Decentralized topology
  • Hypercubes
    • Cayley Graph
    • Efficient broadcast and search
    • Reach all nodes in the network with the minimum number of messages possible
    • Efficient topology construction and maintenance algorithm
    • Decentralized
    • Symetric
  • HyperCuP
    • HyperCuP (HyperCube in P2P) is as P2P infrastructure for scalable distributed communication.
    • HyperCuP has been invented by Schlosser, Sintek, Decker and Nejdl.
    • The protocol description in some places is incomplete
  • Basic facts
    • Consists of N=b Lmax+1 nodes
      • Base b: number of nodes in one dimension
      • Lmax+1= number of dimensions
      • Each node has exactly (b – 1)x(Lmax+1) neighbors
      • Shortest path between two most distant nodes=log b N
    • Message complexity for node joins and departures – clearly below O(n)
    • Self-healing abilities
  • Topology Construction
  • Broadcasting
  • HyperCuP Lightweight Implementation
    • Delivers a lightweight HyperCuP implementation
    • There are some differences with respect to the protocol
    • Written in Java
    • Uses Web Services
    • Easy to embed in an existing application
  • HyperCuP Architecture
  • Semantic Overlay Network (SON) based on HLI
  • SON
  • SON
  • Other applications
    • Distributed search in JeromeDL
    • One-time registration in FOAFRealm
    • Single Sign-On
  • Conclusions
    • HLI delivers a robust P2P infrastructure
    • Some features are experimental and current state of research doesn't allow us to improve them
    • HLI is easy to use and embed into an existing web-application
  • Future works
    • Continue research on Semantic Overlay Networks
    • Nice AJAX-based user-friendly GUI
    • More research including cube regeneration (?)
  • http://hypercup.org