| 摘要 |
<p>A method of scheduling in a switch for transferring data by information units is provided where the scheduling decisions are performed from the destination node point of view, considering the demand of all the source nodes to reach this destination node. This algorithm also allows an improvement in performance, from a traffic point of view, of a rotator switch, since the algorithm is much more fair than the known source based scheduling algorithm in sharing the bandwidth amongst the contenting source nodes for a given destination node. Embodiments of the invention, are extended to support class of service, including minimum bandwidth guarantee. Further embodiments are provided that support age-group to further increase the performance of a rotator switch fabric with respect to traffic. In still further embodiments the algorithm is extended in a load-shared architecture to make it fault tolerant. <IMAGE></p> |
