A Pipelined Maximal-Sized Matching Scheme for High-Speed Input-Buffered Switches

Eiji OKI  Roberto ROJAS-CESSA  H. Jonathan CHAO  

IEICE TRANSACTIONS on Communications   Vol.E85-B   No.7   pp.1302-1311
Publication Date: 2002/07/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Switching
scheduling,  pipeline,  input buffered switch,  maximal-sized matching,  

Full Text: PDF(1.3MB)>>
Buy this Article

This paper proposes an innovative Pipeline-based Maximal-sized Matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the limitation of a single time slot for completing a maximal matching into any number of time slots. In the PMM approach, arbitration is operated in a pipelined manner, where K subschedulers are used. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of the subschedulers provides the matching result. We adopt an extended version of Dual Round-Robin Matching (DRRM), called iterative DRRM (iDRRM), as a maximal matching algorithm in a subscheduler. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for the number of iterations. We show that PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic of the non-pipelined adopted algorithm, while ensuring that cells from the same virtual output queue (VOQ) are transmitted in sequence. In addition, we confirm that the delay performance of PMM is not significantly degraded by increasing the pipeline degree, or the number of subschedulers, when the number of outstanding requests for each subscheduler from a VOQ is limited to 1.