| 摘要 |
<p>A method and scheduler (15) for scheduling data packets transported from input-nodes (11) to output-nodes (12) via a cross-connect fabric (13) having C channels, the data packets being associated with a set of N input-nodes each having a plurality of M queues each for queuing data packets for routing to a corresponding one of M output-nodes. A priority value is associated with each queue in each input-node, and a snapshot is taken of queue priorities. Sets of available input-nodes and available output-nodes are received which may initially contain all input-nodes and output-nodes, respectively, and a subset (ONS) of the set of available output-nodes is selected. For each input-node one request is submitted containing an identity of a requested output-node in the ONS and a corresponding priority value. Requests are grouped according to the identity of the requested output-node, and the output-node associated with each group is matched with the input-node having the highest priority request in the respective group. The matches are accumulated and matched input- and output-nodes are removed from the respective sets of available input- and output-nodes, the whole process being repeating as required.</p> |
