Skip to content

Testing / debugging algorithms

Methods used in testing or debugging procedures

Interactions

Debug - Example algorithm with output form

This algorithm is an example with output form

Click to see more details

Form to complete:

  • Input Algorithm: Input for the algorithm.
  • Total IP traffic (Gbps): The total amount of IP traffic in Gbps, summing all the IP demands in the design. The traffic of all demands is scaled proportionally to fit this value.
  • Randomize traffic: If checked, the traffic of all demands is randomly changed, but keeping the total traffic constant.
  • Random seed: The seed to use in the random number generator.
  • Randomization factor [0,1]: Each traffic demand will be first multiplied by a factor randomly chosen between (1-k , 1+k), being k this value. If zero, no randomization os produced. After this randomization the final demand traffic is scaled to fit the total normalization value.

Form response:

  • Output Algorithm: Output for the algorithm.
  • Success: True if the algorithm ran successfully.
  • A message with the result of the algorithm.
  • Output: Output of the algorithm.
  • Number: A number.

Debug - Create design for Performance Testing

This algorithm creates a design to execute the performance testing.

Click to see more details

Form to complete:

  • Input Algorithm: Input for the algorithm.
  • Number of nodes: Number of nodes to create in the design.
  • Node distribution: Node distribution in the design. Options:
    • Europe: Europe.
    • Spain: Spain.
  • PoP size (km): Size of the PoP in km.
  • Create links: If checked, links are created in the design.
  • Link algorithm: Algorithm to create links in the design. Options:
    • All with all: All with all.
    • Ring: Ring.

Form response:

  • Output Algorithm: Output for the algorithm.
  • Number of nodes created: Number of nodes created in the design.
  • Number of links created: Number of links created in the design.
  • Number of PoPs created: Number of PoPs created in the design.

Debug - Create network using example designs

This algorithm uses the example designs to populate the current design

Click to see more details

Form to complete:

  • Input Algorithm: Input for the algorithm.
  • Class Name: Class name of the example design. Options:
    • CreateSerapisNetwork_ExcelOtnFromTbra: CreateSerapisNetwork_ExcelOtnFromTbra.
    • ExampleDesignKubernetes: ExampleDesignKubernetes.
    • ExampleWithPluggables: ExampleWithPluggables.
    • _0_CreateReferenceNetwork_5SitesMultilayer: _0_CreateReferenceNetwork_5SitesMultilayer.
    • _1_CreateMultilayerNetwork_Spain7nodes: _1_CreateMultilayerNetwork_Spain7nodes.
  • Overwrite current design: If checked, the current design is erased and the new design is created from scratch.

Form response:

  • Output Algorithm: Output for the algorithm.
  • Success: True if the algorithm ran successfully.
  • A message with the result of the algorithm.

Node rendering algorithm

Select over different algorithms that permit creating friendly renderings (positionings) of the nodes in the design, to ease its visualization.

Click to see more details

Form to complete:

  • Layout: The layout where the initial position of the nodes will be taken, and where the final positions will be saved. It cannot be the geographical layout.
  • Node layout method: The type of node layout algorithm to consider. Options:
    • Circle: Plots the node in a circle.
    • Force-directed: Implements the Fruchterman-Reingold force-directed algorithm for node layout. See "Fruchterman and Reingold, 'Graph Drawing by Force-directed Placement'".
    • Kamada-Kawai layout: Implements the Kamada-Kawai algorithm for node layout. See Tomihisa Kamada and Satoru Kawai: An algorithm for drawing general indirect graphs. Information Processing Letters 31(1):7-15, 1989.
    • Self-organizing layout: Implements a self-organizing map layout algorithm, based on Meyer's self-organizing graph methods.
    • Spring-based: Applies a spring-embedder model to layout nodes. Uses attractive and repulsive forces to position nodes based on the forces acting on them. .
  • Link information: The node layout algorithm will consider the links of this type as an input information when deciding the new node positions. Options:
    • IP-level links: The elements to consider are the IP links.
    • Physical-level links: The elements to consider are the physical links, including Ethernet, optical fibers or virtual transport links.
  • Apply to sites: If checked, the plotting is not applied to nodes, but to sites. Then, the nodes in the sites keep their relative positions within the site, and the full site is relocated by the algorithm.
  • Height (pixels): The maximum height of the graph in the new layout .
  • Width (pixels): The maximum width of the graph in the new layout .
  • Options Force Directed Algorithm: Specific options to configure in order to modify the force directed algorithm.
  • Options Spring Algorithm: Specific options for the Spring Algorithm.
  • Options for Kamada-Kawai Algorithm: Specific options for the Kamada-Kawai Algorithm.
  • Options Circle Algorithm: Specific options for the Circle Algorithm.

Testing algorithm. Do not use in production

Click to see more details

Form to complete:

  • Makes nothing during all this time.