Generate an overlay graph.
[go] = NARVAL_P_Overlay(ln,d,T)
number of nodes per line of the overlay network.
number of slices.
overlay topology according to the numbering based on information slicing.
overlay graph.
NARVAL_P_Overlay generates the overlay graph go composed by d lines with ln nodes per line. T corresponds to the overlay matrix according to the 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