DEUKS internship: On the Interconnection of Heterogeneous...

DEUKS internship: On the Interconnection ofHeterogeneous Overlay Networks

Bojan Marinkovic

Mathematical Institute of the Serbian Academy of Sciences and [email protected]

ARGO Seminar, 02.12.2009.

Bojan Marinkovic (MISANU) Overlay networks ARGO Seminar, 02.12.2009. 1 / 25

[email protected]

Overview

1 Introduction

2 Overlay Networks

3 Babelchord

4 Application Demo

5 Further Work

6 Cote d’Azur


Introduction

Overview

1 Introduction

2 Overlay Networks

3 Babelchord

4 Application Demo

5 Further Work

6 Cote d’Azur


Introduction

DEUKS - Doctoral School towards European Knowledge Society,Tempus Project JEP - 41099 - 2006

Consortium Members:

Universita Degli Studi di Udine (I)University of Novi Sad (RS)Institut National de Recherches en Informatique et en Automatique -Sophia Antipolis (FR)Mathematical Institute of the Serbian Academy of Science And Arts -Belgrade (RS)State University of Novi Pazar (RS)Universidad Politecnica de Valencia - Valencia (ES)Individual experts:

Prof. Pierre Lescanne, Ecole Normale Superieure de Lyon (FR)Prof. Pawel Urzyczyn, University of Warsaw (PL)


Introduction

Main objectives of DEUKS:

Promotion of the current European landscape of doctoral programmesin Serbia;

Building-up and implementing pilot doctoral programme according tothe European innovative recommendations;

Introduction of improved and new teaching methods: acquisition andexchange of knowledge in the specific fields of teachers’ and students’interests;

Building-up the environment for linking the EHEA and ERA.


Introduction

My Participation

Internship at INRIA Sophia Antipolis - LOGNET Team

Team leader: Luigi Liquori

Colaborators: Francesco Bongiovanni and Cedric Tedeschi

Duration of stay: February 27th, 2009 - May 25th, 2009

Main goal to develop a software which will follow algorithm describedin the paper:L. Liquori, C. Tedeschi, and F. Bongiovanni: BabelChord: a SocialTower of DHT-Based Overlay Networks. In 14th Symposium onComputers and Communications (ISCC 2009). IEEE, 2009.


Overlay Networks

Overview

1 Introduction

2 Overlay Networks

3 Babelchord

4 Application Demo

5 Further Work

6 Cote d’Azur


Overlay Networks

Basic Terms

Definition (Overlay Networks)

An overlay network is a (computer) network which is built on top ofanother network. Nodes in the overlay can be thought of as beingconnected by virtual or logical links, each of which corresponds to a path,perhaps through many physical links, in the underlying network.

Definition (Distributed Systems)

Systems without any centralized control or hierarchical organization inwhich each node runs software with equivalent functionality.

Points of Interest

Scalability, resource discovery, failure recovery or routing efficiency, inparticular in the context of information retrieval


Overlay Networks

Basic Terms





Points of Interest



Overlay Networks

Basic Terms





Points of Interest



Overlay Networks

Chord Protocol

Ring of nodes

Supports one operation: for a given key it maps it onto a node

Simple - Proved correctness - Proved performance

Uses consistent hashing to assign keys to nodes


Overlay Networks

Chord Protocol

Ring of nodes





Overlay Networks

Chord Protocol

Ring of nodes





Overlay Networks

Chord Protocol

Ring of nodes





Overlay Networks

Golden Rules of Chord

Notation

Keyx = H(Key)

IPy = H(IP)

Golden Rules

1 Invariant: Keyx , IPy iff x 6 y

2 After JOIN keep GR1

3 After LEAVE keep GR1


Overlay Networks

Golden Rules of Chord

Notation

Keyx = H(Key)

IPy = H(IP)

Golden Rules

1 Invariant: Keyx , IPy iff x 6 y

2 After JOIN keep GR1

3 After LEAVE keep GR1


Overlay Networks

Chord - Example


Overlay Networks

Chord - Example - Lookup procedure


Overlay Networks

Chord - Example - Joining of the new node


Babelchord

Overview

1 Introduction

2 Overlay Networks

3 Babelchord

4 Application Demo

5 Further Work

6 Cote d’Azur


Babelchord

Babelchord - Introduction

Motivation: Merging of two Chord rings is costly

Connecting smaller Chord networks in an unstructured way

Nodes as neural synapses


Babelchord

Babelchord - Protocol

Social component

Rings as Floors

Multi-floor routing


Babelchord


Social component

Rings as Floors

Multi-floor routing


Babelchord


Social component

Rings as Floors

Multi-floor routing


Application Demo

Overview

1 Introduction

2 Overlay Networks

3 Babelchord

4 Application Demo

5 Further Work

6 Cote d’Azur


Application Demo

Babelchord - Example


Application Demo

Eclipse demo

Implementation is based on openChord 1.0.5

Developed by: Distributed and Mobile Systems Group Lehrstuhl fuerPraktische Informatik Universitaet Bamberg

Written in Java

GNU public licence


Application Demo

Simulation and Test Results

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

0.1 1 10

Suc

cess

rat

e

"Synapses" percentage

Lookup success rate (10000 nodes, 10 floors)

Connectivity = 2Connectivity = 3Connectivity = 5Connectivity = 10

Figure: Simulation: Exhaustiveness

0

0.2

0.4

0.6

0.8

1

0 20 40 60 80 100

Sat

isfa

ctio

n ra

tio

Number of synapses (%)

Deployment: satisfaction ratio

3 overlays, 10 nodes3 overlays, 30 nodes3 overlays, 50 nodes

6 overlays, 100 nodes6 overlays, 150 nodes

Figure: Deploying JSynapse1:Exhaustiveness

1JSynapse: Another implementation by

LogNet team members


Further Work

Overview

1 Introduction

2 Overlay Networks

3 Babelchord

4 Application Demo

5 Further Work

6 Cote d’Azur


Further Work

Further Work

Publishing paper

”Babelize” other protocols for overlay networks

Apply these techniques in other fields


Cote d’Azur

Overview

1 Introduction

2 Overlay Networks

3 Babelchord

4 Application Demo

5 Further Work

6 Cote d’Azur


Cote d’Azur

Places

Events

Other


Power by: LATEX- GNU Free Documentation License

Merci Beaucoup!Questions?


Date post:	10-Aug-2020
Category:	Documents
Upload:	others
View:	1 times
Download:	0 times

DEUKS internship: On the Interconnection of Heterogeneous...

Documents