<< NARVAL_M_XYExtractionB NARVAL NARVAL_P_OL2UL_NodeSel >>

NARVAL >> NARVAL > NARVAL_P_IPknowledge

NARVAL_P_IPknowledge

Perform the set of IP slices collected by a defined overlay node.

Calling Sequence

[i,si,k] = NARVAL_P_IPknowledge(j,ol,on,d,w)

Parameters

j :

overlay node index where route information is studied.

ol :

collection of all slice crossing each overlay node.

on :

quantity of nodes of the overlay topology.

d :

number of slices.

w :

window index.

i :

index vector of each overlay node IP slice crossing the node j.

si :

slice index of the IP adress (from 1:d).

k :

normalized vector of information collected in node j.

Description

NARVAL_P_IPknowledge performs the set of IP slices (IP: i, Slices: si) collected by the defined overlay node j within the overlay graph composed by on nodes. ol represents the collection of all slices crossing each overlay node (for global routing information retrieved by overlay nodes). d is the number of slices.

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.

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 a network topology: underlay
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 the overlay nodes
[gol]=NARVAL_P_Overlay(ln,d,T);//creation of the overlay topology
w1=1;//window index
NARVAL_G_ShowGraph(go,w1);//graph visualization
w2=2;//window index
NARVAL_G_ShowNodesIndex(gol,w2);//graph visualization
[OLRT,OLpres]=NARVAL_P_SliceOLProp(np2p,d,T);//propagation of slices
sn=NARVAL_F_Random(np2p);//node of interest at the overlay: study of all IP information crossing this node
w3=3;//window index
[ind,subind,kl]=NARVAL_P_IPknowledge(sn,OLpres,np2p,d,w3);//application of NARVAL_P_IPknowledge
ind
subind
kl

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_M_XYExtractionB NARVAL NARVAL_P_OL2UL_NodeSel >>