<< NL_S_ISOLSliceProp NL_S: Security NL_S_ISSlicePath >>

NARVAL >> NL_S: Security > NL_S_ISOverlay

NL_S_ISOverlay

Generate an overlay graph.

Calling Sequence

[Go] = NL_S_ISOverlay(N,D,T)

Arguments

N :

Number of nodes per line of the overlay network.

D :

Number of slices.

T :

Overlay topology according to the numbering based on information slicing.

:

Overlay graph.

Description

NL_S_ISOverlay generates the overlay graph composed by D lines with ln nodes per line. T corresponds to the overlay matrix according to the 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]=NL_T_BarabasiAlbert(n,l0,Ls);//creation 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]=NL_S_ISUL2OL(g,np2p);//selection of overlay nodes
[gol]=NL_S_ISOverlay(ln,d,T);//application of NL_S_ISOverlay
w1=1;//window index
NL_G_ShowGraph(go,w1);//graph visualization
w2=2;//window index
NL_G_ShowGraphN(gol,w2);//graph visualization

Dependency

NL_G_MakeGraph, NL_G_GraphEdgesLength

Report an issue
<< NL_S_ISOLSliceProp NL_S: Security NL_S_ISSlicePath >>