Pipelined Simple Matching for Input Buffered Switches

Man-Soo HAN  Bongtae KIM  

IEICE TRANSACTIONS on Communications   Vol.E85-B   No.11   pp.2539-2543
Publication Date: 2002/11/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Antenna and Propagation
input buffered switch,  pipeline,  cell scheduling,  matching algorithm,  

Full Text: PDF(371.5KB)>>
Buy this Article

We present pipelined simple matching, called PSM, for an input buffered switch to relax the scheduling timing constraint by modifying pipelined maximal-sized matching (PMM). Like the pipelined manner of PMM, to produce the matching results in every time slot, PSM employs multiple subschedulers which take more than one time slot to complete matching. Using only head-of-line information of input buffers, PSM successively sends each request to all subschedulers to provide a better matching opportunity. To obtain better performance, PSM uses unique starting points of scheduling pointers in which the difference between the starting points is equal for any two adjacent subschedulers for a same output. Using computer simulations under a uniform traffic, we show PSM is more appropriate than PMM for pipelined scheduling of an input buffered switch.