Iterative Round-Robin Matching for Input and Output Buffered Switches
スポンサーリンク
概要
- 論文の詳細を見る
We present iterative round-robin matching for an input and output buffered switch with multiple switching planes. The suggested algorithm is based on isLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is altered in the suggested algorithm to enhance the switch performance. Simulation results under Bernoulli traffic show the suggested algorithm is more appropriate than iSLIP for cell scheduling of input and output buffered switches.
- 社団法人電子情報通信学会の論文
- 2001-12-01
著者
関連論文
- 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