Perform the overlay path followed by an information slice towards an overlay node.
[P] = NL_S_ISSlicePath(I,S,R,N,D)
Destination overlay node.
Slice index destined to I.
Routing table.
Quantity of nodes of the overlay topology.
Number of slices.
Path within the overlay graph.
NL_S_ISSlicePath performs the overlay path P followed by the information slice S towards the overlay node I within the overlay graph composed by N nodes. R provides the routing table, e.g. the path followed by each slice along the overlay network. 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.
In the previous example, D=3 and ln=5.