Display the disjoint overlay paths followed by information slices towards a destination overlay node.
[go] = NARVAL_P_ShowSliceMPOL(OLi,np2p,d,g,c)
overlay destination node.
quantity of nodes of the overlay topology.
number of slices.
overlay topology according to a numbering based on information slicing.
list of colors (d).
output graph.
NARVAL_P_ShowSliceMPOL displays the disjoint overlay paths followed by information slices towards the destination overlay node OLi in respect with the colors c. The overlay graph g is composed by d lines with ln nodes per line. The ouput graph is stored in go.
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.
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