EFFICIENT SHARED RISK GROUP REPRESENTATION AS A BIT VECTOR

摘要

Systems and methods of path computation using an efficient shared risk group representation include representing a plurality of network risks in a network with a bit vector where each network risk is represented as a single bit in the bit vector; computing a pair of paths through the network; and determining diversity of the pair of paths based on a comparison of associated bit vectors for each of the pair of paths. The bit vector can include M-bits with an N-bit Group Identifier and P-bits with each of the P-bits representing a unique risk of the plurality of network risks, wherein M, N, and P are integers and N+P=M.