Patent Document ID: 20120331115
Application ID: 13532376
Patent Flag: 0

Claim One:
1. A method of changing network configuration modeled as a set of equations of the form x 1 =c 1 ,. .. , xk=ck where each xi is a configuration variable of a network component and ci is its current value to restore compliance to all requirements where a requirement is a conjunction of constraints F 1 ,. .. , Fm where Fi is a Boolean function of the form R(x 1 ,. .. , xk) of configuration variables x 1 ,. .. , xk at a minimum cost, comprising the steps of: specifying each requirement Fi has infinite change cost; specifying the weight of each constraint xi=ci is equal to its change cost; and submitting the constraint (xi=ci &. .. & xk=ck) & (F 1 &. .. & Fk) to a MaxSAT solver; whereby the MaxSAT solver returns a solution that satisfies F 1 &. .. & Fk and finds values of x 1 ,. .. , xk with minimum incurred change cost.