| US 7,606,262 B1 | ||
| Universal edge node | ||
| Maged E. Beshai, Stittsville (Canada); Harold G. Edwards, Sterling, Va. (US); and Paul F. Daspit, San Diego, Calif. (US) | ||
| Assigned to Nortel Networks Limited, St. Laurent, Quebec (Canada) | ||
| Filed on Jun. 06, 2006, as Appl. No. 11/447,030. | ||
| Application 11/447030 is a division of application No. 10/025982, filed on Dec. 26, 2001, granted, now 7,082,132. | ||
| Int. Cl. H04L 12/28 (2006.01); H04Q 11/00 (2006.01) | ||
| U.S. Cl. 370—468 [370/231; 370/235; 370/386] | 20 Claims |
| 12. A method of scheduling transfer of data segments from a plurality of input ports of a switching fabric to a plurality
of output ports of said switching fabric comprising:
dividing a scheduling time frame into a plurality of time windows by a switching fabric device;
dividing said plurality of input ports into input-port groups;
forming a plurality of non-intersecting scheduling domains, where, in each scheduling domain of said plurality of scheduling
domains, one of said input-port groups is associated with one of said plurality of time windows;
concurrently executing scheduling processes for at least two of said non-intersecting scheduling domains, each said scheduling
process determining a schedule that indicates, for a given scheduling domain among said plurality of scheduling domains, a
timing for a transfer of selected ones of said data segments to selected ones of said plurality of output ports; and
where said executing does not use all said time windows during said scheduling time frame, repeating said executing for an
unused time window.
|