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
No passado, vários algoritmos de escalonamento que se aproximam do GPS, como o WFQ, foram propostos e receberam muita atenção. Esta classe de algoritmos fornece garantias de QoS por fluxo em termos de atraso limitado e garantia de largura de banda mínima. No entanto, com O(registro N) custo computacional para cada novo agendamento de chegada, onde N é o número de fluxos em atraso, a implementação desses algoritmos é cara (por exemplo, em termos de escalabilidade). Além disso, nenhum deles aborda as questões de distribuição de atraso e jitter. Neste artigo, propomos uma nova disciplina de escalonamento de tráfego chamada Enfileiramento baseado em quadro de controle de jitter (JCFQ) que fornece um limite superior para jitter de atraso no caso de conexões com taxa controlada, como fluxos de vídeo em pacotes e telefonia IP, ao mesmo tempo que garante atraso limitado e imparcialidade ponderada no pior caso, como no WF2Q algoritmo, mas com O(1) complexidade na seleção do próximo pacote a ser servido, assumindo que o número de fluxos seja fixo. São propostos três algoritmos diferentes para atribuição de slots ou ordens de serviço entre fluxos: Earliest Jitter Deadline First (EJDF), Rate Monotonic (RM) e Maximum Jitter First (MJF). Nestes algoritmos, o jitter de atraso é formulado no cálculo do tempo de término virtual. Comparamos o desempenho de justiça, atraso e jitter do JCFQ com o do algoritmo MJF com WF2Q através de simulação. Os resultados mostram que com a escolha adequada do tamanho do slot, o JCFQ pode alcançar melhor isolamento de fluxo na distribuição de atraso do que WF2Q.
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
Yeali S. SUN, Yung-Cheng TU, Wei-Kuan SHIH, "Frame-Based Worst-Case Weighted Fair Queueing with Jitter Control" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 8, pp. 2266-2278, August 2001, doi: .
Abstract: In the past, a number of scheduling algorithms that approximate GPS, such as WFQ, have been proposed and have received much attention. This class of algorithms provides per-flow QoS guarantees in terms of the bounded delay and minimum bandwidth guarantee. However, with O(log N) computational cost for each new arrival scheduling, where N is the number of backlogged flows, these algorithms are expensive to implement (e.g., in terms of scalability). Moreover, none of them addresses the issues of delay distribution and jitter. In this paper, we propose a new traffic scheduling discipline called Jitter Control Frame-based Queueing (JCFQ) that provides an upper bound for delay jitter in the case of rate-controlled connections, such as packet video streams and IP telephony, while guaranteeing bounded delay and worst-case fair weighted fairness, such as in the WF2Q algorithm, but with O(1) complexity in selecting the next packet to serve, assuming that the number of flows is fixed. Three different algorithms for slot or service order assignment between flows are proposed: Earliest Jitter Deadline First (EJDF), Rate Monotonic (RM) and Maximum Jitter First (MJF). In these algorithms, delay jitter is formulated into the virtual finish time calculation. We compare the fairness, delay and jitter performance of the JCFQ with that of the MJF algorithm with WF2Q via simulation. The results show that with proper choice of the slot size, JCFQ can achieve better flow isolation in delay distribution than can WF2Q.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_8_2266/_p
Copiar
@ARTICLE{e84-b_8_2266,
author={Yeali S. SUN, Yung-Cheng TU, Wei-Kuan SHIH, },
journal={IEICE TRANSACTIONS on Communications},
title={Frame-Based Worst-Case Weighted Fair Queueing with Jitter Control},
year={2001},
volume={E84-B},
number={8},
pages={2266-2278},
abstract={In the past, a number of scheduling algorithms that approximate GPS, such as WFQ, have been proposed and have received much attention. This class of algorithms provides per-flow QoS guarantees in terms of the bounded delay and minimum bandwidth guarantee. However, with O(log N) computational cost for each new arrival scheduling, where N is the number of backlogged flows, these algorithms are expensive to implement (e.g., in terms of scalability). Moreover, none of them addresses the issues of delay distribution and jitter. In this paper, we propose a new traffic scheduling discipline called Jitter Control Frame-based Queueing (JCFQ) that provides an upper bound for delay jitter in the case of rate-controlled connections, such as packet video streams and IP telephony, while guaranteeing bounded delay and worst-case fair weighted fairness, such as in the WF2Q algorithm, but with O(1) complexity in selecting the next packet to serve, assuming that the number of flows is fixed. Three different algorithms for slot or service order assignment between flows are proposed: Earliest Jitter Deadline First (EJDF), Rate Monotonic (RM) and Maximum Jitter First (MJF). In these algorithms, delay jitter is formulated into the virtual finish time calculation. We compare the fairness, delay and jitter performance of the JCFQ with that of the MJF algorithm with WF2Q via simulation. The results show that with proper choice of the slot size, JCFQ can achieve better flow isolation in delay distribution than can WF2Q.},
keywords={},
doi={},
ISSN={},
month={August},}
Copiar
TY - JOUR
TI - Frame-Based Worst-Case Weighted Fair Queueing with Jitter Control
T2 - IEICE TRANSACTIONS on Communications
SP - 2266
EP - 2278
AU - Yeali S. SUN
AU - Yung-Cheng TU
AU - Wei-Kuan SHIH
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2001
AB - In the past, a number of scheduling algorithms that approximate GPS, such as WFQ, have been proposed and have received much attention. This class of algorithms provides per-flow QoS guarantees in terms of the bounded delay and minimum bandwidth guarantee. However, with O(log N) computational cost for each new arrival scheduling, where N is the number of backlogged flows, these algorithms are expensive to implement (e.g., in terms of scalability). Moreover, none of them addresses the issues of delay distribution and jitter. In this paper, we propose a new traffic scheduling discipline called Jitter Control Frame-based Queueing (JCFQ) that provides an upper bound for delay jitter in the case of rate-controlled connections, such as packet video streams and IP telephony, while guaranteeing bounded delay and worst-case fair weighted fairness, such as in the WF2Q algorithm, but with O(1) complexity in selecting the next packet to serve, assuming that the number of flows is fixed. Three different algorithms for slot or service order assignment between flows are proposed: Earliest Jitter Deadline First (EJDF), Rate Monotonic (RM) and Maximum Jitter First (MJF). In these algorithms, delay jitter is formulated into the virtual finish time calculation. We compare the fairness, delay and jitter performance of the JCFQ with that of the MJF algorithm with WF2Q via simulation. The results show that with proper choice of the slot size, JCFQ can achieve better flow isolation in delay distribution than can WF2Q.
ER -