Simple Matching Algorithm for Input Buffered Switch with Service Class Priority

スポンサーリンク

概要

• 論文の詳細を見る

• We present a simple cell scheduling algorithm for an input buffered switch. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is simplified in the suggested algorithm. By virtue of the new update scheme, the performance of the suggested algorithm is better of iSLIP with one iteration. Using computer simulations under a uniform traffic, we show the suggested algorithm is more appropriate than iSLIP for scheduling of an input buffered switch with multiple service classes.

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

著者

• Han M‐s

  Mokpo National Univ. Chonnam Kor

• Han Man-soo

  The Department Of Switching Technology Switching & Transmission Technology Laboratory Electronic

• LEE Woo-Seob

  the Department of Switching Technology, Switching and Transmission Technology Laboratory, Electronic

• PARK Kwon-Cheol

  the Department of Switching Technology, Switching and Transmission Technology Laboratory, Electronic

• Lee W‐s

  Nortel Networks Uk Ltd. Essex Gbr

• Park Kwon-cheol

  The Department Of Switching Technology Switching And Transmission Technology Laboratory Electronics

関連論文

• Iterative Round-Robin Matching for Input and Output Buffered Switches
• Simple Matching Algorithm for Input Buffered Switch with Service Class Priority
• Efficient Scheduling Algorithm with Utilization of Unused Resources for EPON

スポンサーリンク