<< RoutingBellmanFord Network Topology Generator RoutingConnNeighbor >>

Network Topology Generator >> Network Topology Generator > RoutingCongestionMap

RoutingCongestionMap

Perform the normalized congestion map of a network topology described by a routing table.

Calling Sequence

[np,nd]=RoutingCongestionMap(r,n,ns)

Parameters

r :

routing table.

n :

network size.

ns :

sampling value.

np :

vector of probabilities to cross each node i by a random shortest path stored in the routing table.

nd :

normalized congestion map.

Description

RoutingCongestionMap constructs a normalized congestion map that helps to distinguish the network nodes where the probability to face congestion phenomenon is high. These probabilities are connected to the occurence of each node i in all possible shortest routes over the network recorded on the routing table r. Thus np(i) provides the probability that a random shortest path crosses the node i. np is normalized as min(np)-->1 and max(np)-->ns. As a consequence ns congestion states are displayed.

Examples

n=80;//network size
L=1000;//network square area side
dmax=100;//Locality radius
[g]=NtgLocalityConnex(n,L,dmax);//generation of a topology in respect with the Locality method
r=RoutingTableDijkstra(g);//performance of its routing table 
ns=10;
[np,nd]=RoutingCongestionMap(r,n,ns);//application of RoutingCongestionMap
g.node_border=nd;
show_graph(g);
np
nd

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact


<< RoutingBellmanFord Network Topology Generator RoutingConnNeighbor >>