| 摘要 |
A plurality of equal cost paths through a network from a source node 305 to a destination node 310 are determined. A maximum bandwidth capacity for each link 345a-345g of each of the plurality of equal cost paths is determined, and a smallest capacity link for each of the plurality of equal cost paths is determined from the maximum capacity bandwidths for each link. An aggregated maximum bandwidth from the source node to the destination node is determined by aggregating the smallest capacity links for each of the plurality of equal cost paths. Traffic is sent from the source node 305 along each of the plurality of equal cost paths according to a value of a capacity for the smallest capacity link for each of the plurality of equal cost paths, wherein a total of the sent traffic does not exceed the aggregated maximum bandwidth, and traffic sent along each of the plurality of equal cost paths does not exceed the smallest maximum bandwidth for respective equal cost paths. Preferably, traffic is split between a first of the plurality of equal cost paths and a second of the plurality of equal cost paths according to a ratio of a maximum bandwidth capacity for a smallest capacity link of the first of the plurality of equal cost paths to a maximum bandwidth capacity for a smallest capacity link of the second of the plurality of equal cost paths. Preferably, equal cost paths are determined by a linear programming process or a Ford & Fulkerson process on an initial three-dimensional flow matrix representing network links, nodes and bandwidth capacities. |
