Select overlay nodes from an underlay graph.
[go,p2pl,rt,T] = NARVAL_P_OL2UL_NodeSel(g,np2p)
network graph.
quantity of nodes of the overlay topology.
output graph.
list of overlay nodes in respect with node numbering in the underlay topology.
underlay paths for each direct overlay link between overlay nodes ([path length|underlay path]).
overlay topology according to a numbering based on information slicing.
NARVAL_P_OL2UL_NodeSel extracts the overlay topology composed by np2p nodes randomly selected from the underlay topology g. p2pl provides the list of overlay nodes in respect with the node numbering within the underlay topology. rt gives the underlay paths for each direct overlay link between overlay nodes ([path length|underlay path]). Extreme nodes belong to the overlay. T corresponds to the overlay topology according to a numbering based on information slicing.
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