Router route reconfiguration planning
AssigneeTT Government Solutions, Inc.
InventorsSanjai Narain, Gary Levin
Life of this patent
Estimating the term…
Abstract
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.
Claims3
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]=<t then init [v] else final [v];
- forming a reconstruction plan by finding values of the time variables time [v1], . . . , time [vk] so that Invariant holds immediately after each time in [1, k];
- and
- computing by first deriving a constraint on the time variables for the Invariant to hold after a generic time t and for each t in [1, . . . , k], the constraint is instantiated.
Dependencies are inferred from the claim text.