Contents

Introduction

This report extracts information from the network topology: links and nodes in the network, and adds some metrics related to link capacities and offered and carried traffic, if this information is available. The description and formulas included in this report follow the notation guidelines described in the Notation section in the Net2Plan help file.

Topology metrics

This section includes some metrics calculated from the topology. Clicking the metric name links to the description of the metric.

MetricValue
Number of nodes (|N|)#topologyMetrics_N#
Number of unidirectional links (|E|)#topologyMetrics_E#
Average node degree#topologyMetrics_averageNodeDegree#
Average link distance (km)#topologyMetrics_averageLinkLength#
Network diameter (hops)#topologyMetrics_networkDiameter_hops#
Network diameter (km)#topologyMetrics_networkDiameter_km#
Network diameter (ms)#topologyMetrics_networkDiameter_ms#
Average shortest path distance (hops)#topologyMetrics_averageShortestPath_hops#
Average shortest path distance (km)#topologyMetrics_averageShortestPath_km#
Average shortest path distance (ms)#topologyMetrics_averageShortestPath_ms#
Connected topology?#topologyMetrics_isConnected#
Bidirectional topology (links)?#topologyMetrics_isBidirectional#
Bidirectional topology (links & capacities)?#topologyMetrics_isWeightedBidirectional#
Simple topology?#topologyMetrics_isSimple#
Number of nodes (|N|)
The number of nodes of the topology.
Number of unidirectional links (|E|)
The number of unidirectional links of the topology.
Average node degree
This is the ratio between the number of links and number of nodes in the network. Is given by:

Average node degree

Average link distance (km)
The sum of the distances in km of all the links, divided by the number of links. Is given by:

Average link distance (km)

Network diameter (hops)
The number of hops that has the shortest path (in number of hops) with largest number of hops among all the shortest paths between every node pair in the network. Is given by:

Network diameter (hops)

where SPh(ij) is the shortest path in number of hops from node i to node j, and as usual |p| represents the number of traversed links of a path p.
Network diameter (km)
The length in km that has the shortest path (in km) with largest length (in km) among all the shortest paths between every node pair in the network. Is given by:

Network diameter (km)

where SPkm(ij) is the shortest path in km from node i to node j, and as usual lkm(p) represents the sum of the km along path p.
Network diameter (ms)
The propagation delay in ms that has the shortest path (in ms) with largest length (in ms) among all the shortest paths between every node pair in the network. Is given by:

Network diameter (ms)

where SPms(ij) is a shortest path in ms from node i to node j, and as usual tpropms(p) represents the sum of the ms along path p.
Average shortest path distance (hops)
The average number of hops of the shortest paths (in number of hops) among every node pair in the network. Is given by:

Average shortest path distance (hops)

where SPh(ij) is the shortest path in number of hops from node i to node j, and as usual |p| represents the number of traversed links of path p.
Average shortest path distance (km)
The average length in km of the shortest paths (in km) among all the shortest paths between every node pair in the network. Is given by:

Average shortest path distance (km)

where SPkm(ij) is the shortest path in km from node i to node j, and as usual lkm(p) represents the sum of the km along path p.
Average shortest path distance (ms)
The average length in ms of the shortest paths (in ms) among all the shortest paths between every node pair in the network. Is given by:

Average shortest path distance (ms)

where SPms(ij) is the shortest path in ms from node i to node j, and as usual tpropms(p) represents the sum of the ms along path p.
Connected topology?
'Yes' if the topology is connected, 'No' otherwise. A topology is connected if for every two nodes i,jN, ij, there is a path between them traversing the links in the network.
Bidirectional topology (links)?
'Yes' if the topology is bidirectional according to the links, 'No' otherwise. A topology is bidirectional according to the links, if for every two nodes i,jN, ij, the number of links ij equals the number of links ji.
Bidirectional topology (links and capacities)?
'Yes' if the topology is bidirectional according to the links and the capacities, 'No' otherwise. A topology is bidirectional according to the links and the capacities, if for every two nodes i,jN, ij, the number of links ij, at a given capacity value u, equals the number of links ji with the same capacity value.
Simple topology?
'Yes' if the topology is simple, 'No' otherwise. A topology is simple of it does not have parallel links nor self-links. Two links e, e' are parallel if they have the same input node and the same output node (a(e) = a(e'), b(e) = b(e')). Link e is a self-link if a(e) = b(e). Self-links are not allowed in Net2Plan.

Capacity metrics

This section includes some metrics calculated from link capacities. Clicking the metric name links to the description of the metric.

MetricValue
Maximum capacity installed in a link#capacityMetrics_maxCapacity#
Minimum capacity installed in a link#capacityMetrics_minCapacity#
Average capacity installed in a link#capacityMetrics_averageCapacity#
Total capacity installed in a link#capacityMetrics_totalCapacity#
Capacity module size#capacityMetrics_capacityModule#
Maximum capacity installed in a link
The maximum capacity installed among the links of the network. The capacity values come directly from the netPlan object.
Minimum capacity installed in a link
The minimum capacity installed among the links of the network. The capacity values come directly from the netPlan object.
Average capacity installed in a link
The average capacity installed among the links of the network. The capacity values come directly from the netPlan object. Noting by ue the capacity of the links, the average capacity installed is given by:

Average capacity installed in a link
Total capacity installed in a link
The total capacity installed in the network, summing the capacity in all the links. The capacity values come directly from the netPlan object. Noting by ue the capacity of the links, the total capacity installed is given by:

Total capacity installed in the network
Capacity module size
The greatest common divisor of the capacities in the links. If the capacities in the links are modular (that is, a multiple of a basic module of capacity), this value will show the capacity of the modules.

Traffic (demands and routing) metrics

This section includes some metrics calculated from traffic demands and routing (if available). Clicking the metric name links to the description of the metric.

MetricValue
Total offered traffic#trafficMetrics_totalOfferedTraffic#
Total carried traffic#trafficMetrics_totalCarriedTraffic#
Average offered traffic per demand#trafficMetrics_averageOfferedTraffic#
Average carried traffic per demand#trafficMetrics_averageCarriedTraffic#
Blocked traffic (%)#trafficMetrics_blockedTraffic#
Avg. number of hops#trafficMetrics_numHops#
Total offered traffic to the network
The total offered traffic to the network, summing the offered traffic by all the demands. The offered traffic values come directly from the netPlan object.
Total carried traffic by the network
The total carried traffic to the network, summing the carried traffic by all the routes.
Average offered traffic per demand by the network
The offered traffic per demand to the network. It is equivalent to divide the total offered traffic to the network by the number of demands.
Average carried traffic per demand by the network
The carried traffic per demand by the network. It is equivalent to divide the total carried traffic to the network by the number of demands.
Blocked traffic (%)
The percentage of traffic which is blocked (not carried) by the network.
Avg. number of hops
It represents the ratio between the in-network traffic (total sum of the carried traffic in all links) and the total carried traffic.

Detailed per-node description

This section provides a tabular information per node. Clicking in the column name links to a description of the column value.

#nodeInformationTable#
Node id
Internal (unique) identifier of the node for Net2Plan. It is the index of the node in the related tables in netPlan.
Node name
The name of the node as it appears in nodeName field of netPlan.
X-Coord, Y-Coord
The XY coordinates of the node as they appear in the NetPlan object. They can represent either Cartesian coordinates or lon/lat coordinates or any other.
Attributes
The attributes of the node as they appear in nodeAttributes field of netPlan. The number of attributes of each node is variable. Each attribute is composed of a name and a value. Usual attributes are node population, or node level (used in some traffic matrix generation models).

Detailed per-link description

#linkInformationTable#
Link id
Internal (unique) identifier of the node for Net2Plan. It is the index of the link in the related tables in netPlan.
Origin node
The node id and node name (in brackets) of the origin node of the link.
Destination node
The node id and node name (in brackets) of the destination node of the link.
Link length (km)
The length of the link in km, as given by the NetPlan object.
Link propagation speed (km/s)
The propagation speed of the link in km/s, as given by the NetPlan object.
Link propagation delay (ms)
The propagation delay of the link in ms, as given by the quotient between link length and propagation speed (converted to ms).
Attributes
The attributes of the link as they appear in linkAttributes field of netPlan. The number of attributes of each link is variable. Each attribute is composed of a name and a value.

Detailed per-demand description

#demandInformationTable#

Detailed per-route description

#routeInformationTable#

Detailed per-protection segment description

#segmentInformationTable#

Detailed per-SRG description

#srgInformationTable#