i-QOCF (iterative quasi-oldest-cell-first) algorithm for input-queued ATM switches

Masayoshi Nabeshima, Naoaki Yamanaka

研究成果: Paper査読

4 被引用数 (Scopus)

抄録

This paper proposes a new scheduling algorithm for input-queued ATM switch, called iterative quasi-oldest-cell-first (i-QOCF) algorithm. In i-QOCF, each input port and each output port maintains its own list. The length of the list can be N, 2×N, ..., B×N, where B is the size of the buffer that queues cells destined for an output port. The list maintained by an input port contains the identifiers of those output ports to which that input port will send a cell. The list maintained by an output port contains the identifiers of input ports which have a cell destined for that output port. We show the performance of i-QOCF and results in which we compare i-QOCF with i-OCF in terms of cell delay time. We find that an input-queued ATM switch with i-QOCF and virtual output queue (VOQ) can achieve 100% throughput for independent arrival processes. The 3-QOCF is enough to achieve convergence during one cell time. If we use a 3-QOCF in which the list length is 3×N, then its cell delay time performance is almost the same as that of a 4-OCF.

本文言語English
ページ25-30
ページ数6
出版ステータスPublished - 1999 1月 1
外部発表はい
イベントProceedings of the 1999 5th IEEE ATM Workshop 'Opening the New Horizons toward Global Multimedia Services' - Kochi, Jpn
継続期間: 1999 5月 241999 5月 27

Other

OtherProceedings of the 1999 5th IEEE ATM Workshop 'Opening the New Horizons toward Global Multimedia Services'
CityKochi, Jpn
Period99/5/2499/5/27

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「i-QOCF (iterative quasi-oldest-cell-first) algorithm for input-queued ATM switches」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル