<< NARVAL_P_IPknowledge NARVAL NARVAL_P_Overlay >>

NARVAL >> NARVAL > NARVAL_P_OL2UL_NodeSel

NARVAL_P_OL2UL_NodeSel

Select overlay nodes from an underlay graph.

Calling Sequence

[go,p2pl,rt,T] = NARVAL_P_OL2UL_NodeSel(g,np2p)

Parameters

g :

network graph.

np2p :

quantity of nodes of the overlay topology.

go :

output graph.

p2pl :

list of overlay nodes in respect with node numbering in the underlay topology.

rt :

underlay paths for each direct overlay link between overlay nodes ([path length|underlay path]).

T :

overlay topology according to a numbering based on information slicing.

Description

NARVAL_P_OL2UL_NodeSel extracts the overlay topology composed by np2p nodes randomly selected from the underlay topology g. p2pl provides the list of overlay nodes in respect with the node numbering within the underlay topology. rt gives the underlay paths for each direct overlay link between overlay nodes ([path length|underlay path]). Extreme nodes belong to the overlay. T corresponds to the overlay topology according to a numbering based on information slicing.

Information Slicing is a new approach to anonymous communication (WEB). The physical topology, where data are propagated, is called the underlay network. The virtual network named overlay, is built on top of the underlay network. It is working like a Peer-2-Peer network and its goal is to provide source and destination anonymity and churn resilience, without using any public key cryptography. For that purpose, a set of overlay nodes are selected and forms a lattice composed by d lines of ln overlay nodes.

In the previous example, d=3 and ln=5.

Examples

n=200;//network size
l0=3;//a maximum of 5 links are created for each created node
Ls=1000;//network square area side 
[g,dist]=NARVAL_T_BarabasiAlbert(n,l0,Ls);//underlay topology generation
ln=5;//number of nodes per line
L=ln-1;//hop length
d=3;//number of slices
np2p=ln*d;//quantity of nodes of the overlay topology
[go,p2plist,routetab,T]=NARVAL_P_OL2UL_NodeSel(g,np2p);//application of NARVAL_P_OL2UL_NodeSel 
w1=1;//window index
NARVAL_G_ShowGraph(go,w1);//graph visualization
p2plist
routetab
T

Dependency

NARVAL_F_Random, NARVAL_F_Remov, NARVAL_R_Dijkstra_i_j, NARVAL_G_Nodes2Path

Authors

Foued Melakessou

Contact

Dr. Foued Melakessou

Research Associate

Interdisciplinary Centre for Security, Reliability and Trust

Room F106

University of Luxembourg

6, rue Coudenhove Kalergi

L-1359 Luxembourg-Kirchberg

E-mail: foued.melakessou@uni.lu

Tel: (+352) 46 66 44 5346

Home Page


<< NARVAL_P_IPknowledge NARVAL NARVAL_P_Overlay >>