Perform the overlapping map of overlay edges in the underlay network.
[P,S] = NL_S_ISULMap(R,N,L,D,I,J)
Matrix of underlay paths for each direct overlay link between overlay nodes ([path length|underlay path]).
Underlay network size.
Number of nodes per line in the overlay graph.
Number of slices.
Window index.
Window index.
Cummulative occurence of each underlay node in the overlay graph.
Occurence of each underlay node in the overlay graph between any 2 successive overlay stages.
NL_S_ISULMap performs the overlapping map of overlay edges in the underlay network. R corresponds to the matrix of underlay paths for each direct overlay link between overlay nodes. NL_S_ISULMP generates the 2 variables p and s, 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.