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
Na Internet do futuro, vários tipos de serviços aumentarão rapidamente o seu volume e exigirão qualidades diferentes. Assim, é o principal problema técnico garantir vários QoS para cada conexão. No entanto, nas atuais redes IP, onde a maioria das aplicações utiliza TCP como protocolo de transporte, o esquema mais típico de descarte de pacotes, RED (Random Early Detection), causa injustiças, como a diferença de compartilhamento de largura de banda entre os fluxos que atravessam o mesmo roteador. Para resolver este problema, consideramos que dois pontos de vista são importantes associados à justiça baseada no fluxo. Uma é a condição de fluxo instantâneo e a outra é a condição de fluxo histórico. Neste artigo, propomos o esquema de descarte de pacotes considerando o uso instantâneo e histórico dos recursos da rede com o propósito de dissolver a injustiça de cada fluxo e melhorar a QoS da base do fluxo. Chamamos esse método de proposta de "Descarte antecipado aleatório com métricas de justiça dupla (DRED)." O DRED pode melhorar todo o rendimento e o tempo de conclusão da transferência de informações, como um arquivo, etc.
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
Norio YAMAGAKI, Katsuya MINAMI, Hideki TODE, Koso MURAKAMI, "Packet Discarding Scheme Considering Both Instantaneous and Historical Use of Network Resources" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 8, pp. 2115-2123, August 2001, doi: .
Abstract: In the future Internet, various kinds of services will rapidly increase its volume and require different qualities. Thus, it is main technical problem to guarantee various QoS to each connection. However, in the current IP networks where most applications use TCP as transport protocol, most typical packet discarding scheme, RED (Random Early Detection), causes unfairness such as the difference of bandwidth sharing among flows traversing the same router. To dissolve this problem, we consider that two viewpoints are important associated with flow-base fairness. One is instantaneous flow condition and the other is historical flow condition. In this paper, we propose the packet discarding scheme considering both instantaneous and historical use of network resources for the purpose of dissolving unfairness of each flow and improving the flow-base QoS. We call this proposal method "Random Early Drop with Dual-fairness metrics (DRED). " DRED can improve whole throughput and transfer completion time of information such as a file, etc.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_8_2115/_p
Copiar
@ARTICLE{e84-b_8_2115,
author={Norio YAMAGAKI, Katsuya MINAMI, Hideki TODE, Koso MURAKAMI, },
journal={IEICE TRANSACTIONS on Communications},
title={Packet Discarding Scheme Considering Both Instantaneous and Historical Use of Network Resources},
year={2001},
volume={E84-B},
number={8},
pages={2115-2123},
abstract={In the future Internet, various kinds of services will rapidly increase its volume and require different qualities. Thus, it is main technical problem to guarantee various QoS to each connection. However, in the current IP networks where most applications use TCP as transport protocol, most typical packet discarding scheme, RED (Random Early Detection), causes unfairness such as the difference of bandwidth sharing among flows traversing the same router. To dissolve this problem, we consider that two viewpoints are important associated with flow-base fairness. One is instantaneous flow condition and the other is historical flow condition. In this paper, we propose the packet discarding scheme considering both instantaneous and historical use of network resources for the purpose of dissolving unfairness of each flow and improving the flow-base QoS. We call this proposal method "Random Early Drop with Dual-fairness metrics (DRED). " DRED can improve whole throughput and transfer completion time of information such as a file, etc.},
keywords={},
doi={},
ISSN={},
month={August},}
Copiar
TY - JOUR
TI - Packet Discarding Scheme Considering Both Instantaneous and Historical Use of Network Resources
T2 - IEICE TRANSACTIONS on Communications
SP - 2115
EP - 2123
AU - Norio YAMAGAKI
AU - Katsuya MINAMI
AU - Hideki TODE
AU - Koso MURAKAMI
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 future Internet, various kinds of services will rapidly increase its volume and require different qualities. Thus, it is main technical problem to guarantee various QoS to each connection. However, in the current IP networks where most applications use TCP as transport protocol, most typical packet discarding scheme, RED (Random Early Detection), causes unfairness such as the difference of bandwidth sharing among flows traversing the same router. To dissolve this problem, we consider that two viewpoints are important associated with flow-base fairness. One is instantaneous flow condition and the other is historical flow condition. In this paper, we propose the packet discarding scheme considering both instantaneous and historical use of network resources for the purpose of dissolving unfairness of each flow and improving the flow-base QoS. We call this proposal method "Random Early Drop with Dual-fairness metrics (DRED). " DRED can improve whole throughput and transfer completion time of information such as a file, etc.
ER -