Router route reconfiguration planning

摘要

A method for solving the reconfiguration planning problem transforms the requirement that an invariant is always preserved into a constraint on the times at which the configuration parameters change. The method then solves this constraint to obtain the required reconfiguration plan. When this constraint is strengthened with a synthesis constraint, it is ensured that any final configuration that is computed is also reachable. An extension of the method allows parameters to take on multiple intermediate values.

主权项

1. A method of creating reconfiguration plans for changing variables from an initial value to a final value in a system while preserving constraints, comprising:
a processor for performing computer instructions for: assigning configuration values v1, . . . , vk for each variable in a the system where k is a number of variables in the system; assigning time [v] to be a positive, integer-valued time at which the value of configuration variable v is changed from init [v] to final [v], where time [v] is a one-to-one mapping between the set of configuration variables and the integers in the interval [1, k]; encoding a reconfiguration sequence where the value of a configuration variable v immediately after time t is defined as follows: If time [v]=