Supported by the National Natural Science Foundation of China (No.60472057).
This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adap...
A new approximation of fair queuing called Compensating Hound Robin (CRR) is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of th...
Supported by the National Natural Science Foundation of China, Project (NO. 969001405)and the National Key Lab. on ISN
This paper proposes a new high-performance switching element with the new shared-memory queuing policy, which is called blocked-cell shared-memory (BCSM) queuing. As the name means, instead of buffering all cells thro...