Generate a slice propagation information within an overlay graph.
[R,P] = NL_S_ISOLSliceProp(N,D,T)
Quantity of nodes of the overlay topology.
Number of slices.
Overlay topology according to the numbering based on information slicing.
Routing table providing the path followed by each slice along the overlay network.
Collection of all slices crossing each overlay node.
NL_S_ISOLSliceProp generates the slice propagation information R and P within the overlay graph composed by N nodes. T corresponds to the overlay topology according to the numbering based on information slicing. R provides the routing table, e.g. the path followed by each slice along the overlay network. P represents the collection of all slices crossing each overlay node (for global routing information retrieved by the overlay nodes).
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.