Patent ID: 7006488
Filing Date: 2006-02-28
Classification: H04L

Abstract:
1. In a communication network comprising an ingress node, a plurality of core nodes connected by links to the ingress node, and an egress node connected by links to the ingress node via the core nodes, said ingress node receiving communication traffic of the network and said egress node delivering communication traffic of the network, an apparatus for designing a plurality of communication paths between said ingress node and said egress node, the apparatus comprising: means for defining an objective function for minimizing a number of candidate tree graphs for accommodating said communication paths; means for defining a first constraint equation for causing all of said candidate tree graphs to form a tree; means for defining a second constraint equation for accommodating said communication paths in one of said candidate tree graphs; means for defining a third constraint equation for determining whether each of said candidate tree graphs is used to accommodate said communication paths; and means for solving a mathematical programming problem formed by said objective function, and said first, second and third constraint equations to obtain a plurality of trees in which said communication paths can be accommodated.