<< NARVAL_P_ULIPknow NARVAL NARVAL_R_AggregationTree >>

NARVAL >> NARVAL > NARVAL_P_UnderlayInter

NARVAL_P_UnderlayInter

Perform the overlapping map of overlay edges in the underlay network.

Calling Sequence

[np,nps] = NARVAL_P_UnderlayInter(rt,n,ln,d,w1,w2)

Parameters

rt :

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

n :

underlay network size.

ln :

number of nodes per line in the overlay graph.

d :

number of slices.

w1 :

window index.

w2 :

window index.

np :

cummulative occurence of each underlay node in the overlay graph.

nps :

occurence of each underlay node in the overlay graph between any 2 successive overlay stages.

Description

NARVAL_P_UnderlayInter performs the overlapping map of overlay edges in the underlay network. rt corresponds to the matrix of underlay paths for each direct overlay link between overlay nodes. NARVAL_P_UnderlayInter generates the 2 variables np and nps, that represent respectivelly the cumulative occurence of each underlay node in the overlay graph and the occurence of each underlay node in the overlay graph between any 2 successive overlay stages.

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);//generation of the underlay topology
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);//selection of overlay nodes
w1=1;//window index
NARVAL_G_ShowGraph(go,w1);//graph visualization
w2=2;//window index
w3=3;//window index
[node_pres,node_pres_stage]=NARVAL_P_UnderlayInter(routetab,n,L,d,w2,w3);//application of NARVAL_P_UnderlayInter
node_pres
node_pres_stage

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_ULIPknow NARVAL NARVAL_R_AggregationTree >>