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
Embora as informações nas redes ATM sejam tratadas como pacotes (células) de tamanho fixo, o agendamento baseado em pacotes ainda é necessário nas redes ATM. Esta carta propõe um mecanismo de agendamento baseado em pacotes que se baseia na comparação entre uma fila baseada em pacotes e uma fila virtual que representa o comprimento da fila fornecido por um mecanismo de agendamento baseado em células. Os resultados da simulação mostraram que o escalonamento proposto aloca a largura de banda de forma justa para cada conexão.
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, "Packet-Based Scheduling for ATM Networks Based on Comparing a Packet-Based Queue and a Virtual Queue" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 6, pp. 958-961, June 1999, doi: .
Abstract: Even though information in ATM networks is handled as fixed-sized packets (cells), packet-based scheduling is still needed in ATM networks. This letter proposes a packet-based scheduling mechanism that is based on comparison between a packet-based queue and a virtual queue that represents the queue length provided by a cell-based scheduling mechanism. Simulation results showed that this proposed scheduling allocates the bandwidth fairly to each connection.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_6_958/_p
Copiar
@ARTICLE{e82-b_6_958,
author={Masayoshi NABESHIMA, },
journal={IEICE TRANSACTIONS on Communications},
title={Packet-Based Scheduling for ATM Networks Based on Comparing a Packet-Based Queue and a Virtual Queue},
year={1999},
volume={E82-B},
number={6},
pages={958-961},
abstract={Even though information in ATM networks is handled as fixed-sized packets (cells), packet-based scheduling is still needed in ATM networks. This letter proposes a packet-based scheduling mechanism that is based on comparison between a packet-based queue and a virtual queue that represents the queue length provided by a cell-based scheduling mechanism. Simulation results showed that this proposed scheduling allocates the bandwidth fairly to each connection.},
keywords={},
doi={},
ISSN={},
month={June},}
Copiar
TY - JOUR
TI - Packet-Based Scheduling for ATM Networks Based on Comparing a Packet-Based Queue and a Virtual Queue
T2 - IEICE TRANSACTIONS on Communications
SP - 958
EP - 961
AU - Masayoshi NABESHIMA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 1999
AB - Even though information in ATM networks is handled as fixed-sized packets (cells), packet-based scheduling is still needed in ATM networks. This letter proposes a packet-based scheduling mechanism that is based on comparison between a packet-based queue and a virtual queue that represents the queue length provided by a cell-based scheduling mechanism. Simulation results showed that this proposed scheduling allocates the bandwidth fairly to each connection.
ER -