Perform the routing table of a topology in respect with the Flood algorithm.
[rt] = NARVAL_R_TFlood(g,TTL)
network graph.
Flood Time-To-Live.
routing table.
NARVAL_R_TFlood computes the shortest paths between all couples of distinct network nodes of the graph g composed by n nodes in respect with the Flood algorithm.
The paths are stored in the routing table matrix rt. Thus the route between the nodes i and j can be read at the line of index (i-1)*n+j. The first column of rt provides each path length.
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