NARVAL >> NL_R: Routing
NL_R: Routing
- NL_R_AODVNextHop — Perform the next hop where a packet needs to be forwarded in order to reach its destination (local routing table - AODV).
- NL_R_AODVPath — Perform the path where a packet needs to be forwarded from its source in order to reach its destination (local routing table).
- NL_R_AODVRREQLocation — Find the location of RREQs inside a network for a route request from a source (AODV).
- NL_R_AODVRTInit — Initiate the routing table of each node inside a network (AODV).
- NL_R_AODVRouteError — Adjust the routing table of a node after an Error discovery (AODV).
- NL_R_AODVRouteReply — Perform the AODV Route Reply from the destination node (or intermediate node knowing a path to the destination).
- NL_R_AODVRouteRequest — Perform the AODV Route Request from a source node.
- NL_R_AODVRouteRequestIn — Initialize the emission of RREQ packets from a source node inside a network (AODV).
- NL_R_AODVRouteRequestIt — Propagate RREQ packets emitted from a source node inside a network (AODV).
- NL_R_ARC — Compute the ARC algorithm on a graph.
- NL_R_ARCCongestionDetect — Computes the ARC index vector where congestion occurs (T>Tc).
- NL_R_ARCCongestionLR — Update an Arc matrix after the detection of a congestion on the direction d of the ith arc.
- NL_R_ARCCursor — Update the ARC matrix with the performance of each ARC cursor.
- NL_R_ARCFirstARC — Compute the first ARC of the ARC algorithm.
- NL_R_ARCFirstARC — Compute the first ARC of the ARC algorithm.
- NL_R_ARCForwardingNode — Compute the forwarding node of a current node.
- NL_R_ARCHighlightARC — Highlight the ith ARC generated by the ARC algorithm.
- NL_R_ARCHighlightARCs — Highlight all ARCs generated by the ARC algorithm.
- NL_R_ARCIndexOfNode — Compute the ARC index of a node.
- NL_R_ARCIndexOfNodes — Compute the ARC index of each node.
- NL_R_ARCMultiPath — Compute all paths between a destination and the root node from the ARC algorithm.
- NL_R_ARCMultiPathSort — Compute all paths between a destination and the root node from the ARC algorithm (Sort).
- NL_R_ARCNodeDirection — Compute the direction of the traffic of a node inside an ARC.
- NL_R_ARCRT — Computes the routing table for an ARC matrix.
- NL_R_ARCRTInit — Update the routing table of an ARC matrix with the initial direction for each cursor.
- NL_R_ARCRTInitPlot — Display the routing table of an ARC matrix with the initial direction for each cursor.
- NL_R_ARCRTPath — Compute the path between a node and the root.
- NL_R_ARCRootInit — Perform the initialization of the ARC algorithm from a source node.
- NL_R_ARCRootIter — Perform the propagation of the ARC algorithm from a source node.
- NL_R_ARCSubPaths — Divise an ARC into two paths from one of its node.
- NL_R_ARCSubRoot — Select the subroot where to start a new arc discovery from an ARC set.
- NL_R_ARCSubRootARC — Compute the new arc from a sub-root and a sub-heir.
- NL_R_ARCSubTreeFromNode — Perform the SubTree from a node in respect with the current configuration of an ARC matrix.
- NL_R_ARCSubTreePlot — Display the traffic distribution from a source node towards an ARC root.
- NL_R_ARCTrafficFlowNode — Compute the flow propagation for a connection between a node and omega.
- NL_R_ARCTrafficManager — Compute the update of an ARC matrix for a list of source nodes where traffic is generated.
- NL_R_ARCTrafficNode — Compute the flow propagation for a connection between a node and
(direct computation).
- NL_R_ARCTrafficPlot — Display the congestion state of an ARC graph.
- NL_R_AggregationTree — Perform the data aggregation on each node of a graph (Tree).
- NL_R_AggregationWCDS — Perform the data aggregation on each node of a graph (WCDS+tree).
- NL_R_BFS — Perform the Breadth First Search algorithm from a source node on a topology in respect the node index metric.
- NL_R_BFSPlot — Perform the Breadth First Search algorithm from a source node on a topology in respect the node index metric.
- NL_R_BFSSearchStart — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node index (BFS-Start).
- NL_R_BFSWSearchStart — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node index (Start).
- NL_R_BFSWeight — Perform the Breadth First Search algorithm from a source node on a topology in respect the node degree metric.
- NL_R_BFSWeightPlot — Perform the Breadth First Search algorithm from a source node on a topology in respect the node degree metric (plot).
- NL_R_BellmanFord — Perform the Bellman-Ford algorithm from a source node on a topology.
- NL_R_BellmanFordRT — Perform the routing table of a topology in respect with the Bellman-Ford algorithm.
- NL_R_CongestionMap — Perform the normalized congestion map of a network topology described by a routing table.
- NL_R_CongestionSinkFlood — Perform the congestion map and predecessor vectors between a sink and the remaining nodes of a graph.
- NL_R_DFS — Perform the Depth First Search algorithm from a source node on a topology in respect the node index metric.
- NL_R_DFSPlot — Perform the Depth First Search algorithm from a source node on a topology in respect the node index metric (plot).
- NL_R_DFSSearchEnd — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node index (End).
- NL_R_DFSWSearchEnd — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node degree (End).
- NL_R_DFSWeight — Perform the Depth First Search algorithm from a source node on a topology in respect the node degree metric.
- NL_R_DFSWeightPlot — Perform the Depth First Search algorithm from a source node on a topology in respect the node degree metric.
- NL_R_Dijkstra — Perform the Dijktra's algorithm from a source on a topology.
- NL_R_DijkstraHT — Perform the Dijkstra's algorithm on a network topology from a source node (shortest path to all remaining nodes).
- NL_R_DijkstraHTMultiPath — Perform the modified Dijkstra's algorithm on a network topology between two nodes in respect with given links weights.
- NL_R_DijkstraHTWeight — Perform the Dijkstra's algorithm on a network topology from a source node in respect with given links weights (shortest path to all remaining nodes).
- NL_R_DijkstraMap — Discover a topology in respect with successive routes extracted from a single source by the Dijkstra's algorithm.
- NL_R_DijkstraMapNoLeaf — Discover a topology in respect with successive routes extracted from a single source by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology.
- NL_R_DijkstraMapSources — Discover a topology in respect with successive routes extracted from multiple sources by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology.
- NL_R_DijkstraMapSourcesD — Discover a topology in respect with successive routes extracted from multiple sources by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology. The node degree is used in the normalization process.
- NL_R_DijkstraMapSourcesN — Discover a topology in respect with successive routes extracted from multiple sources by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology. The quantity of nodes is used in the normalization process.
- NL_R_DijkstraMultiPath — Perform five alternative routing tables of a network from successive applications of the Dijkstra's algorithm on a changing topology.
- NL_R_DijkstraNiNj — Perform the shortest path between two network nodes on a topology in respect with the Dijkstra's algorithm.
- NL_R_DijkstraRT — Perform the routing table of a topology in respect with the Dijkstra's algorithm.
- NL_R_Flood — Perform the shortest path between two network nodes in respect with the Flood algorithm.
- NL_R_FloodInitialization — Perform the initialization of the Flood algorithm.
- NL_R_FloodIteration — Perform the topology discovery propagation of the Flood algorithm.
- NL_R_FloodRT — Perform the routing table of a topology in respect with the Flood algorithm.
- NL_R_FloydWarshall — Perform the shortest paths between all pairs of vertices of a graph in respect with the Floyd-Warshall algorithm.
- NL_R_FloydWarshallPath — Extract the shortest path between two network nodes in respect with the Floyd-Warshall algorithm.
- NL_R_MultiPathERT — Extract 5 alternative connection paths between two network nodes from given enhanced routing tables.
- NL_R_PathERT — Extract the path between two network nodes from an enhanced routing table.
- NL_R_PathRT — Extract the path between two network nodes from a routing table.
- NL_R_PathWeightChange — Modify the weight of links belonging to a path inside a network graph.
- NL_R_PathsWithNi — Perform the indexes of all shortest paths where a node is present.
- NL_R_PredecessorRoute — Perform the shortest path between two network nodes in respect with the predecessor vector generated by the Bellman-Ford algorithm, the Dijkstra's algorithm, BFS, DFS or the Prim's algorithm.
- NL_R_Prim — Perform the Prim's algorithm from a source node on a topology.
- NL_R_PrimSearchDistance — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the minimal distance.
- NL_R_RPL — Build a RPL tree from a source node on a graph.
- NL_R_RPLCommonAncestor — Find the first ancestor betwen two network nodes in respect with the RPL algorithm.
- NL_R_RPLDIO — Propagate DIO messages from a node.
- NL_R_RPLInitialization — Initialize the RPL algorithm from a root node inside a graph.
- NL_R_RPLMultiPath — Perform a set of paths between a node and the DAG root in respect with the RPL algorithm.
- NL_R_RPLPath — Perform the path between a node and the DAG root in respect with the RPL algorithm.
- NL_R_RPLPlot — Highlight a DODAG tree generated by the RPL algorithm.
- NL_R_RPLRT — Perform the routing table of a topology in respect with the RPL algorithm.
- NL_R_RT2ERT — Generate the enhanced routing table of a graph from its routing table.
- NL_R_RTPathPresence — Perform the presence vector of paths stored inside a routing table.
- NL_R_RTReduction — Reduce the size of a routing table.
- NL_R_TreeExtraction — Extract a tree from a network topology.
- NL_R_TreePathN2N — Perform the path between two nodes of a tree.
- NL_R_TreePathN2R — Perform the path between a node and the root of a tree.