<< NARVAL_P_SlicePath NARVAL NARVAL_P_ULIPknow >>

NARVAL >> NARVAL > NARVAL_P_SlicesOLN1N2

NARVAL_P_SlicesOLN1N2

Perform the list of all IP slices forwarded between the overlay nodes i and j.

Calling Sequence

[ind,subind] = NARVAL_P_SlicesOLN1N2(i,j,OLRT,np2p,d)

Parameters

i :

node index.

j :

node index.

OLRT :

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

np2p :

quantity of nodes of the overlay topology.

d :

number of slices.

ind :

vector of overlay indexes.

subind :

vector of slices indexes.

Description

NARVAL_P_SlicesOLN1N2 performs the list of all IP slices (node index (ind) : slice index(subind)) forwarded between the overlay nodes i and j. Values of subind belong to [1,2,..,d]. Values of ind belong to [1,..,np2p]. OLRT provides the underlay paths for each direct overlay link between overlay nodes ([path length|underlay path]). np2p corresponds to the quantity of nodes of the overlay topology.

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);//generation of the overlapping map
[gol]=NARVAL_P_Overlay(ln,d,T);//creation of the overlay topology
w4=4;//window index
NARVAL_G_ShowNodesIndex(gol,w4);//graph visualization
[OLRT,OLpres]=NARVAL_P_SliceOLProp(np2p,d,T);//propagation of slices
i=1;//source node
j=4;//destination node
[ind,subind]=NARVAL_P_SlicesOLN1N2(i,j,OLRT,np2p,d);//application of NARVAL_P_SlicesOLN1N2 
ind
subind

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_SlicePath NARVAL NARVAL_P_ULIPknow >>