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
Uma versão estendida do algoritmo de escalonamento round robin ponderado para pacotes de comprimento variável é discutida. Isso pode servir cada fluxo de maneira justa, mesmo que o comprimento dos pacotes varie. Além disso, um algoritmo de escalonamento adaptativo para tráfego em rajadas é adicionado para melhor tratar as fontes multimídia. Neste artigo, uma visão geral do algoritmo é descrita. Posteriormente, o rendimento, a latência, a complexidade do trabalho e a elasticidade do algoritmo são sistematicamente definidos e analisados. Esses resultados mostram vantagens do algoritmo em comparação com um algoritmo round robin ponderado normal ou baseado em pacotes.
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
Hidetoshi YOKOTA, Mattias FORSBERG, Tohru ASAMI, "Extension to Weighted Round Robin Packet Scheduling for Variable-length Packet Networks" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 3, pp. 668-676, March 1999, doi: .
Abstract: An extended version of weighted round robin scheduling algorithm for variable length packets is discussed. This can serve each flow fairly even if the length of packets varies. Further, an adaptive scheduling algorithm for bursty traffic is added to better treat multimedia sources. In this paper, an overview of the algorithm is described. Subsequently the throughput, latency, work complexity and elasticity for the algorithm are systematically defined and analyzed. These results show advantages of the algorithm compared with a normal or packet-based weighted round robin algorithm.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_3_668/_p
Copiar
@ARTICLE{e82-d_3_668,
author={Hidetoshi YOKOTA, Mattias FORSBERG, Tohru ASAMI, },
journal={IEICE TRANSACTIONS on Information},
title={Extension to Weighted Round Robin Packet Scheduling for Variable-length Packet Networks},
year={1999},
volume={E82-D},
number={3},
pages={668-676},
abstract={An extended version of weighted round robin scheduling algorithm for variable length packets is discussed. This can serve each flow fairly even if the length of packets varies. Further, an adaptive scheduling algorithm for bursty traffic is added to better treat multimedia sources. In this paper, an overview of the algorithm is described. Subsequently the throughput, latency, work complexity and elasticity for the algorithm are systematically defined and analyzed. These results show advantages of the algorithm compared with a normal or packet-based weighted round robin algorithm.},
keywords={},
doi={},
ISSN={},
month={March},}
Copiar
TY - JOUR
TI - Extension to Weighted Round Robin Packet Scheduling for Variable-length Packet Networks
T2 - IEICE TRANSACTIONS on Information
SP - 668
EP - 676
AU - Hidetoshi YOKOTA
AU - Mattias FORSBERG
AU - Tohru ASAMI
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1999
AB - An extended version of weighted round robin scheduling algorithm for variable length packets is discussed. This can serve each flow fairly even if the length of packets varies. Further, an adaptive scheduling algorithm for bursty traffic is added to better treat multimedia sources. In this paper, an overview of the algorithm is described. Subsequently the throughput, latency, work complexity and elasticity for the algorithm are systematically defined and analyzed. These results show advantages of the algorithm compared with a normal or packet-based weighted round robin algorithm.
ER -