<< RoutingTableDijkstra Network Topology Generator TopologyRecDijkstra >>

Network Topology Generator >> Network Topology Generator > RoutingTableFlood

RoutingTableFlood

Perform the routing table of a topology in respect with the Flood algorithm.

Calling Sequence

[rt]=RoutingTableFlood(g,TTL)

Parameters

g :

network graph.

TTL :

Flood Time-To-Live.

rt :

routing table.

Description

RoutingTableFlood computes the shortest paths between all couples of distinct network nodes of the graph g in respect with the Flood algorithm.

They 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 where n represents the network size. The first column of rt provides each path length.

Examples

n=50;//network size
l=1000;//network squared area side
d=100;//Locality radius
[g]=NtgLocalityConnex(n,l,d);//generation of a topology
show_graph(g);
TTL=10;//Flood Time-To-Live
[rt]=RoutingTableFlood(g,TTL);//application of RoutingTableFlood 
rt

Dependency

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact


<< RoutingTableDijkstra Network Topology Generator TopologyRecDijkstra >>