An interesting question is whether or not a set of desired routing patterns can be used in an OSPF network. We investigate this problem; and find new necessary conditions for the existence of weights making the desired patterns shortest. A polynomial algorithm that for most cases verifies the non-existence of compatible weights is presented. The algorithm also indicates which parts of the traffic patterns that are in conflict. Some computational tests of the algorithm are reported.
Keywords: Telecommunication networks; Internet protocol; OSPF; routing; compatible weights