Pipelined Simple Matching for Input Buffered Switches(Regular Section)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2002-11-01

著者

• Han Man-soo

  Network Core Technology Dept. Electronics And Telecommunications Research Institute (etri)

• Kim Bongtae

  Network Core Technology Dept. Etri

• Kim Bongtae

  Network Core Technology Dept. Electronics And Telecommunications Research Institute (etri)

関連論文

• Pipelined Simple Matching for Input Buffered Switches(Regular Section)
• Desynchronized Input Buffered Switch with Buffered Crossbar(Switching)

スポンサーリンク