Patent ID: 11929909
Assignee: ECI TELECOM LTD.
Field: Digital communication (Electrical engineering)
Classification: CPC H | IPC H

Claim 22:
23. A network management system comprising:
at least one processor; and
a computer-readable medium containing instructions that, when executed by the at least one processor cause the network management system to perform operations comprising:
obtaining a representation of a communication network, the representation including:
a network graph that includes:
edge e12 that connects vertices v1 and v2; and
edge e23 that connects vertices v2 and v3;

an ordered list of resources r12, associated with edge e12, for i from 1 to 2 n;
an ordered list of resources r23j associated with edge e23, for j from 1 to 2 n;
an ordered list of paths pk for k from 1 to 2 n, the paths corresponding to demands on the communication network, wherein:
for odd values of k, path pk connects v1 to v3 and uses resource ria on edge e12 and resource r23k on edge e23;
for even values of k, path pk connects v2 to v3 and uses resource r23k on edge e23;

updating the ordered list of paths, the updating comprising:
selecting a first path subset of the ordered list of paths including x pairs of paths, each pair including a path p2n−1+1 and a path pl for the first x even values of l;
updating the paths in the first path subset, the updating:
satisfying a total change condition that specifies a number of resource swaps x between paths in each pair of paths;
reducing a Shannon entropy of the network graph; and
limited to unused edge and resource combinations or edge and resource combinations used by paths in the first path subset;

wherein the updated set of paths has a Shannon entropy of, (
    
     
      H
      
       2
       ⁢
       n
      
     
     ⁢
     log
     ⁢
     2
     ⁢
     n
    
    )
   
   +
   
    
     
      n
      -
      H
     
     
      2
      ⁢
      n
     
    
    ⁢
    log
    ⁢
    
     
      2
      ⁢
      n
     
     
      n
      -
      H
     
    
   
  
  ,, where H is max (0,n−(2x+1)); and

configuring the communication network to satisfy the demands using routes corresponding to the updated set of paths.