Router Reconfiguration Planning via Constraint Satisfaction

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing reconfiguration planning methods fail to determine the optimal order for changing configuration parameters without falsifying given invariants during transition, especially when no reconfiguration plan exists for a final configuration, and require only initial and final values, not intermediate values.

Innovation Solution

A method that transforms the invariant preservation requirement into constraints on configuration parameter change times, allowing for the computation of reconfiguration plans and enabling parameters to take on intermediate values, using a constraint satisfaction approach to ensure the final configuration is reachable.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If configuration parameters are changed concurrently to their new values, then reconfiguration time is reduced, but system invariants may be falsified during transition

Engineering Contradiction:

Improvereconfiguration timeVSAvoidinvariant preservation

Core Design Contradiction:

Loss of timeVSReliability

Solution Approach 1:

The system performs preliminary analysis to determine a safe reconfiguration sequence before executing parameter changes. By pre-computing the ordering of parameter changes that maintains invariant satisfaction, the system avoids runtime invariant violations while still achieving efficient reconfiguration without unnecessary delays.

Inventive Principle:

Principle #10Preliminary action

2Reliability

If a strict reconfiguration plan is enforced to preserve invariants, then system reliability is improved, but reconfiguration flexibility is reduced

Engineering Contradiction:

Improveinvariant preservationVSAvoidreconfiguration flexibility

Core Design Contradiction:

ReliabilityVSAdaptability or versatility

Solution Approach 1:

The system dynamically determines reconfiguration sequences based on the specific invariant constraints and current system state. Rather than enforcing a fixed rigid plan, the method adapts the parameter change ordering to satisfy invariant requirements while still allowing reconfiguration to proceed. The approach provides flexibility within the bounds of invariant preservation by computing feasible sequences rather than prohibiting changes.

Inventive Principle:

Principle #15Dynamics

3Ease of manufacture

If intermediate parameter values are allowed, then reconfiguration plan feasibility is improved, but configuration complexity increases

Engineering Contradiction:

Improvereconfiguration plan feasibilityVSAvoidconfiguration complexity

Core Design Contradiction:

Ease of manufactureVSDevice complexity

Solution Approach 1:

The system introduces intermediate parameter values as temporary states during reconfiguration transitions. These intermediate values act as mediators that allow the system to pass through safe states that satisfy invariant constraints while transitioning from initial to final configuration. By allowing parameters to take on intermediate values, the method finds feasible reconfiguration paths that would otherwise be blocked by invariant violations at intermediate steps.

Inventive Principle:

Principle #24Intermediary (Mediator)

Data Source

PatentUS8805770B2Router route reconfiguration planning

Publication Date: 2014.08.12 PERSPECTA LABS INC

AI summary

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.