The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article propose la méthode itérative quasi-ancienne-cellule-d'abord (i-QOCF), un nouvel algorithme de planification pour les commutateurs ATM avec file d'attente d'entrée avec file d'attente de sortie virtuelle (VOQ). Dans le i-Algorithme de planification QOCF, chaque port d'entrée et chaque port de sortie maintient sa propre liste. La longueur de la liste peut être N2
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Masayoshi NABESHIMA, Naoaki YAMANAKA, "The i-QOCF (Iterative Quasi-Oldest-Cell-First) Scheduling Algorithm for Input-Queued ATM Switches" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 2, pp. 182-189, February 2000, doi: .
Abstract: This paper proposes the iterative quasi-oldest-cell-first (i-QOCF) scheduling algorithm, a new scheduling algorithm for input-queued ATM switches with virtual output queuing (VOQ). In the i-QOCF scheduling algorithm, each input port and each output port maintains its own list. The length of the list can be N, 2
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_2_182/_p
Copier
@ARTICLE{e83-b_2_182,
author={Masayoshi NABESHIMA, Naoaki YAMANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={The i-QOCF (Iterative Quasi-Oldest-Cell-First) Scheduling Algorithm for Input-Queued ATM Switches},
year={2000},
volume={E83-B},
number={2},
pages={182-189},
abstract={This paper proposes the iterative quasi-oldest-cell-first (i-QOCF) scheduling algorithm, a new scheduling algorithm for input-queued ATM switches with virtual output queuing (VOQ). In the i-QOCF scheduling algorithm, each input port and each output port maintains its own list. The length of the list can be N, 2
keywords={},
doi={},
ISSN={},
month={February},}
Copier
TY - JOUR
TI - The i-QOCF (Iterative Quasi-Oldest-Cell-First) Scheduling Algorithm for Input-Queued ATM Switches
T2 - IEICE TRANSACTIONS on Communications
SP - 182
EP - 189
AU - Masayoshi NABESHIMA
AU - Naoaki YAMANAKA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2000
AB - This paper proposes the iterative quasi-oldest-cell-first (i-QOCF) scheduling algorithm, a new scheduling algorithm for input-queued ATM switches with virtual output queuing (VOQ). In the i-QOCF scheduling algorithm, each input port and each output port maintains its own list. The length of the list can be N, 2
ER -