Perform the knowledge matrix of slices stored in each underlay node.
[RT,iRT] = NARVAL_P_ULIPknow(rt,n,T,OLRT,np2p,d,ln)
underlay paths for each direct overlay link between overlay nodes ([path length|underlay path]).
quantity of nodes within the underlay graph.
overlay topology according to the numbering based on information slicing.
underlay paths for each direct overlay link between overlay nodes ([path length|underlay path]).
quantity of nodes of the overlay topology.
number of slices.
number of nodes per line in the overlay graph.
knowledge matrix.
aggregated knowledge matrix.
NARVAL_P_ULIPknow performs the knowledge matrix RT (n*(d*np2p)) of slices stored in each underlay node. For each underlay node, we count the number of slices emitted from each overlay node that has crossed it. Each overlay node transmits d slices towards the overlay nodes of the next level. iRT is the aggregated version of RT. Its size is n*np2p. Values belong to [0,1,..d]. We finally display a picture of the presence of slices in each underlay node. If an underlay node gets the d slices emitted from an overlay node, it can reconstruct its original data packet and get its IP address.
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.
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; w3=3; [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; NARVAL_G_ShowNodesIndex(gol,w4); [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 w5=5;//window index [ind,subind,kl]=NARVAL_P_IPknowledge(sn,OLpres,np2p,d,w5);//application of NARVAL_P_IPknowledge col=[1 2 3 5 6 7 9 10 11];//color dn=d+NARVAL_F_Random(np2p-d);//destination node at the overlay level [gg]=NARVAL_P_ShowSliceMPOL(dn,np2p,d,gol,col);//propagation of slices along the overlay topology w6=6;//window index NARVAL_G_ShowNodesIndex(gg,w6);//graph visualization [RT,iRT]=NARVAL_P_ULIPknow(routetab,n,T,OLRT,np2p,d,ln);//application of NARVAL_P_ULIPknow cmaph=hotcolormap(d+1);//visualization parameters cmapj=jetcolormap(d+1); pres_iRT=find(sum(iRT,'c')<>0);//underlay nodes where information slices are stored; NOI_iRT=iRT(pres_iRT,:); cmapg=graycolormap(d+1); w7=7; w8=8; f7=scf(w7); clf(w7); NARVAL_IP_ImShow(iRT); f7.figure_name='Knowledge (Overlay) Matrix of Underlay nodes (x=[OL11 OL12 .. OL1d OL21 OL22 .. OL2d......OLnp2n1 OLnp2n2 .. OLnp2nd])'; f8=scf(w8); clf(w8); NARVAL_IP_ImShow(NOI_iRT+1,cmapg); colorbar(0,d); f8.figure_name='Global Knowledge (Overlay) Matrix of Underlay nodes(x=[OL1 OL2 .. OLnp2n])'; | ![]() | ![]() |
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