| 摘要 |
<p>A data network using a maximal flow algorithm uses all available paths between a source and a destination, providing a more efficient use of the network than the shortest path networks. To facilitate the exchange of network status information, particularly in a maximal flow context, a plurality of parallel paths formed of one or more nodes 2001... 2017 and node links 3001 ... 3020, are formed into groups 4001 ... 4003 connected by group links 5001, 5002. The paths within a group between the group links are notionally reduced to a single equivalent, 6001 ... 6003, path with the aggregate dynamic capacity of the individual paths. In this way the network can be reduced to a serial connection of links between source and destination. Preferably a node in each group 4001 ... 4003 provides group status information to the other groups to enable each group to determine the overall traffic status of the network. <IMAGE></p> |
