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

Masayoshi Nabeshima, Naoaki Yamanaka

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

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 languageEnglish
Title of host publicationIEEE ATM Workshop, Proceedings
PublisherIEEE
Pages25-30
Number of pages6
Publication statusPublished - 1999
Externally publishedYes
EventProceedings of the 1999 5th IEEE ATM Workshop 'Opening the New Horizons toward Global Multimedia Services' - Kochi, Jpn
Duration: 1999 May 241999 May 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

Fingerprint

Automatic teller machines
Time delay
Switches
Scheduling algorithms
Throughput

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Nabeshima, M., & Yamanaka, N. (1999). i-QOCF (iterative quasi-oldest-cell-first) algorithm for input-queued ATM switches. In IEEE ATM Workshop, Proceedings (pp. 25-30). IEEE.

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 proceedingChapter

Nabeshima, M & Yamanaka, N 1999, i-QOCF (iterative quasi-oldest-cell-first) algorithm for input-queued ATM switches. in IEEE ATM Workshop, Proceedings. IEEE, pp. 25-30, Proceedings of the 1999 5th IEEE ATM Workshop 'Opening the New Horizons toward Global Multimedia Services', Kochi, Jpn, 99/5/24.
Nabeshima M, Yamanaka N. i-QOCF (iterative quasi-oldest-cell-first) algorithm for input-queued ATM switches. In IEEE ATM Workshop, Proceedings. IEEE. 1999. p. 25-30
Nabeshima, Masayoshi ; Yamanaka, Naoaki. / i-QOCF (iterative quasi-oldest-cell-first) algorithm for input-queued ATM switches. IEEE ATM Workshop, Proceedings. IEEE, 1999. pp. 25-30
@inbook{8f22574155f348e9a43ba9afa2469334,
title = "i-QOCF (iterative quasi-oldest-cell-first) algorithm for input-queued ATM switches",
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.",
author = "Masayoshi Nabeshima and Naoaki Yamanaka",
year = "1999",
language = "English",
pages = "25--30",
booktitle = "IEEE ATM Workshop, Proceedings",
publisher = "IEEE",

}

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 -