System for optimizing a network plan and method of operation
First Claim
Patent Images
1. A computer-implemented system for solving a network planning problem, the system comprising:
- a memory operable to store information specifying a network plan, a plurality of constraints, and a plurality of interaction coefficients, each interaction coefficient corresponding to particular constraint, and at least one goal; and
a processor coupled to the memory, the processor operable to model said network, said constraints, and said at least one goal as a constraint satisfaction problem, to initialize said interaction coefficients for each solution to said problem, and to provide said solution by iteratively repeating the following steps;
to determine whether a proposed network plan violates any of the constraints, if so, to update an interaction coefficient corresponding to each violated constraint, said coefficient reflecting an impact upon said at least one goal caused by the resolution of a violation, to select a constraint violation to be resolved on the basis of said interaction coefficient, and to generate a new plan in accordance with resolution of a selected constraint violation;
said processor further operable to provide data representing a display pertaining to said solution.
16 Assignments
0 Petitions
Accused Products
Abstract
A system is provided for optimizing a network plan. The system includes a memory which stores information specifying a network plan, a plurality of constraints, and a plurality of interaction coefficients. Each interaction coefficient corresponds to particular constraint. A processor is coupled to the memory. The processor is operable to determine whether the network plan violates any of the constraints, modify the network plan in order to resolve a violation of any constraint, and update a corresponding interaction coefficient in order to reflect an impact upon the network plan caused by the resolution of a violation.
-
Citations
20 Claims
-
1. A computer-implemented system for solving a network planning problem, the system comprising:
-
a memory operable to store information specifying a network plan, a plurality of constraints, and a plurality of interaction coefficients, each interaction coefficient corresponding to particular constraint, and at least one goal; and a processor coupled to the memory, the processor operable to model said network, said constraints, and said at least one goal as a constraint satisfaction problem, to initialize said interaction coefficients for each solution to said problem, and to provide said solution by iteratively repeating the following steps;
to determine whether a proposed network plan violates any of the constraints, if so, to update an interaction coefficient corresponding to each violated constraint, said coefficient reflecting an impact upon said at least one goal caused by the resolution of a violation, to select a constraint violation to be resolved on the basis of said interaction coefficient, and to generate a new plan in accordance with resolution of a selected constraint violation;said processor further operable to provide data representing a display pertaining to said solution. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer-implemented system for solving a network planning problem, the system comprising:
-
a memory operable to store information specifying a network plan, a plurality of constraints, and a plurality of interaction coefficients, each interaction coefficient corresponding to particular constraint, and at least one goal; a constraint checker module operable to access the memory, the constraint checker module operable to determine whether the network plan violates any of the constraints; and a resolver module operable to communicate with the constraint checker module, the resolver module operable to initialize said intereaction coefficients for each solution to said problem, and to provide said solution by iteratively repeating the following steps;
to update an interaction coefficient corresponding to each violated constraint, said coefficient reflecting an impact upon the at least one goal caused by the resolution of a violation, to select a constraint violation to be resolved on the basis of said interaction coefficient, to generate a new plan in accordance with resolution of a selected constraint violation;a network plan memory operable to provide data representing a display pertaining to said solution. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
15. A computer-implemented method for solving a network planning problem, the method comprising the steps of:
-
receiving information specifying a network plan, a plurality of constraints, and a plurality of interaction coefficients, each interaction coefficient corresponding to particular constraint and at least one goal; determining whether the network plan violates any of the constraints; if one or more constraints is violated, to initialize said interaction coefficients for each solution to said problem, and to provide said solution by iteratively repeating the following steps;
updating an interaction coefficient corresponding to each violated constraint, said coefficient reflecting an impact upon the at least one goal caused by the resolution of a violation, selecting a constraint violation to be resolved on the basis of said interaction coefficient, and generating a new plan in accordance with resolution of a selected constraint violation; andproviding data representing a display pertaining to said solution. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification