Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | IEEE ATM Workshop, Proceedings |
| Publisher | IEEE |
| Pages | 25-30 |
| Number of pages | 6 |
| Publication status | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 5th IEEE ATM Workshop 'Opening the New Horizons toward Global Multimedia Services' - Kochi, Jpn Duration: 1999 May 24 → 1999 May 27 |
Other
| Other | Proceedings of the 1999 5th IEEE ATM Workshop 'Opening the New Horizons toward Global Multimedia Services' |
|---|---|
| City | Kochi, Jpn |
| Period | 99/5/24 → 99/5/27 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
i-QOCF (iterative quasi-oldest-cell-first) algorithm for input-queued ATM switches. / Nabeshima, Masayoshi; Yamanaka, Naoaki.
IEEE ATM Workshop, Proceedings. IEEE, 1999. p. 25-30.Research output: Chapter in Book/Report/Conference proceeding › Chapter
}
TY - CHAP
T1 - i-QOCF (iterative quasi-oldest-cell-first) algorithm for input-queued ATM switches
AU - Nabeshima, Masayoshi
AU - Yamanaka, Naoaki
PY - 1999
Y1 - 1999
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0032633168&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032633168&partnerID=8YFLogxK
M3 - Chapter
AN - SCOPUS:0032633168
SP - 25
EP - 30
BT - IEEE ATM Workshop, Proceedings
PB - IEEE
ER -