Network Topology Generator
- Network Topology Generator
- AleaInitFin — Generate a random integer value between 1 and a defined threshold (different from a defined value).
- AleaNombre — Generate a random integer value between 1 and a defined threshold.
- AleaVec — Extract randomly a component of a vector (without replacement).
- BriteToSci — Import a graph generated by the BRITE topology generator into the Scilab environment.
- CirclePlace — Connect new neighbor nodes around a central node.
- Delet — Remove a value from a vector.
- DiffVectors — Analyse the difference between two vectors.
- DisplayGraph — Display a network graph in respect with a defined metric per node.
- Distance — Perform the Euclidian distance between two network nodes of a graph.
- EUProject — EFIPSANS.
- EdgeLength — Weight a network graph.
- EnhancedRoutingTable — Generate the enhanced routing table of a graph.
- GraphConnex — Extract the largest connex component of a network graph.
- GraphDegDist — Perform and display the node degree distribution of a graph.
- GraphDegDistWD — Perform the node degree distribution of a graph.
- JDD — Perform the Joint Degree Distribution of a graph.
- LayerPlacement — Place a hierarchical network layer.
- LongueurArc — Perform the length of each network edge.
- MobilityDijkstra — Perform the Dijkstra's algorithm on a network topology from a source node.
- MobilityDijkstraMP — Perform the modified Dijkstra's algorithm on a network topology between two nodes in respect with given links weights.
- MobilityDijkstraWeight — Perform the Dijkstra's algorithm on a network topology from a source node in respect with given links weights.
- MobilityDistanceNPoi — Perform the Euclidean distance between the current position of a node and its destination (Point of Interest).
- MobilityGraph2Plot — Display a moving graph on a normal figure.
- MobilityLocality — Perform the attribution of links for a topology in respect with the Locality approach.
- MobilityMode1N2AllAP — MANET simulation: connection between 1 node towards all reachable Access Points.
- MobilityMode1N2CAP — MANET simulation: connection between 1 node towards the close Access Point.
- MobilityMode1N2CAPMP — MANET simulation: connection between 1 node to the close Access Point in respect with multiple paths.
- MobilityModeVANETRect — VANET simulation: connection between 1 vehicle to the close Access Point.
- MobilityNeighborhood — Perform the 1-hop neighborhood of a network node.
- MobilityNeighborhoodN — Perform the 1-hop neighborhood of a network node with extended outputs.
- MobilityNodeRWP — Generate the displacement of a node towards a Point of Interest.
- MobilityNodeRWPoint — Generate the displacement of a node to a Point of Interest for a VANET around a rectangle.
- MobilityRandom_i_j_nf — Generate two distinct random integer values between (nf+1) and (nf+n).
- MobilityXYExtraction — Extract the coordinates of network nodes from a graphic window when n moving nodes are defined after nf fixed nodes.
- MobilityXYExtractionB — Extract the coordinates of network nodes from a graphic window when n moving nodes are defined after nf fixed nodes for a VANET.
- Ntg — Generate a random hierarchic network based on successive layers generated by the Waxman algorithm.
- NtgBarabasiAlbert — Generate a random topology in respect with the Barabasi-Albert model.
- NtgHierWaxmanConnex — Generate a random hierarchic network topologies in respect with the Waxman algorithm.
- NtgHierWaxmanConnexDist — Generate a random hierarchic network topology of nodes linearly distributed into layers in respect with the Waxman model.
- NtgLocality — Generate a random network topology in respect with the Locality method.
- NtgLocalityConnex — Generate a random connex network topology in respect with the Locality method.
- NtgWaxman — Generate a random network topology in respect with the Waxman algorithm.
- NtgWaxmanConnex — Generate a random connex network topology in respect with the Waxman model.
- RVector — Reverse a vector.
- RandDist — Generate a random value in respect with a given distribution.
- RandWtRepl — Pick up a value from a vector without replacement.
- Random — Generate a random integer value bounded by a threshold.
- Random_i_j — Generate a couple of two distinct integer values bounded by a threshold.
- Remov — Remove a value from a vector if it is only present a single time.
- RoutingBFS — Perform the Breadth First Search algorithm from a source node on a topology in respect the node index metric.
- RoutingBFSWeight — Perform the enhanced Breadth First Search algorithm from a source node on a topology in respect the node degree metric.
- RoutingBellmanFord — Perform the Bellman-Ford algorithm from a source node on a topology.
- RoutingCongestionMap — Perform the normalized congestion map of a network topology described by a routing table.
- RoutingConnNeighbor — Perform the neighborhood of the shortest path between two network nodes of a graph in respect with a routing table.
- RoutingDFS — Perform the Depth First Search algorithm from a source node on a topology in respect the node index metric.
- RoutingDFSWeight — Perform the enhanced Depth First Search algorithm from a source node on a topology in respect with the node degree metric.
- RoutingDijkstra — Perform the shortest path between two network nodes in respect with the Dijkstra's algorithm (Scilab).
- RoutingDijkstra0 — Perform the Dijktra's algorithm from a source on a topology.
- RoutingFlood — Perform the shortest path between two network nodes in respect with the Flood algorithm.
- RoutingFloodInit — Perform the initialization of the Flood algorithm.
- RoutingFloodIteration — Perform the topology discovery propagation of the Flood algorithm.
- RoutingFloydWarshall — Perform all shortest paths between all pairs of vertices of a graph in respect with the Floyd-Warshall algorithm.
- RoutingFloydWarshallPath — Extract the shortest path between two network nodes in respect with the Floyd-Warshall algorithm performance.
- RoutingMPathDijkstra — Perform five alternative routing tables of a network from successive applications of the Dijkstra's algorithm on a changing topology.
- RoutingMPathERT — Extract 5 alternative connection paths between two network nodes from given enhanced routing tables.
- RoutingPathERT — Extract the connection path between two network nodes from an enhanced routing table.
- RoutingPathRT — Extract the connection path between two network nodes from a routing table.
- RoutingPathWeightMod — Modify the weight of links belonging to a path inside a network graph.
- RoutingPredRoute — 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.
- RoutingPrim — Perform the Prim's algorithm from a source node on a topology.
- RoutingRTPathPresence — Perform the presence vector of paths stored inside a routing table.
- RoutingSearchDistance — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the minimal distance.
- RoutingSearchEnd — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node index (End).
- RoutingSearchEndWeight — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node degree (End).
- RoutingSearchStart — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node index (Start).
- RoutingSearchStartWeight — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node degree (Start).
- RoutingShortestRT — Reduce the size of a routing table.
- RoutingShowPath — Display and emphasize a path on a graph.
- RoutingTableBellmanFord — Perform the routing table of a topology in respect with the Bellman-Ford algorithm.
- RoutingTableDijkstra — Perform the routing table of a topology in respect with the Dijkstra's algorithm.
- RoutingTableFlood — Perform the routing table of a topology in respect with the Flood algorithm.
- TopologyRecDijkstra — Discover a topology in respect with successive routes extracted from a single source by the Dijkstra's algorithm.
- TopologyRecDijkstra0 — 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.
- TopologyRecDijkstraMM — 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.
- TopologyRecDijkstraMS — 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.
- TopologyRecDijkstraNS — 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.
- UCoordinates — Perform the coordinates of network nodes in respect with a uniform distribution.
- Unity — Remove each duplicate value inside a vector.
- WCirclePlace — Connect a Waxman subnetwork around a node.
- WaxmanConnex — Generate a random connex network topology in respect with the Waxman model.
- XYRand — Generate a vector of random values inferior to a threshold.