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
Este artigo propõe a abordagem iterativa quase-célula mais antiga primeiro (i-QOCF), um novo algoritmo de agendamento para switches ATM em fila de entrada com fila de saída virtual (VOQ). No i-Algoritmo de agendamento QOCF, cada porta de entrada e cada porta de saída mantém sua própria lista. O comprimento da lista pode ser N, 2
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.
Copiar
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
Copiar
@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},}
Copiar
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 -