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 artigo, propomos um esquema de controle de congestionamento para comunicação multicast confiável que permite a imparcialidade do TCP e evita um problema de queda para zero. O esquema de controle de congestionamento proposto é baseado em taxas, baseado em NAKs dos receptores e trabalha cooperativamente com um esquema de controle de fluxo. O esquema de controle de congestionamento consiste em dois componentes: um controlador baseado em taxa e um mecanismo de seleção de um representante. O controlador baseado em taxa funciona entre o remetente e o representante e atinge a imparcialidade do TCP e uma resposta rápida às perdas no representante. O mecanismo de seleção do representante permite ao remetente selecionar o representante de forma escalável, em que o remetente utiliza NAKs dos destinatários para selecioná-lo. No artigo, também propomos o mecanismo de switchover dos esquemas de controle de fluxo e congestionamento que permite ao remetente utilizar qualquer um deles de forma adaptativa com base nas situações da rede. Quando a rede está congestionada, o esquema de controle de congestionamento funciona para compartilhar os recursos da rede de forma justa com os fluxos TCP concorrentes. Caso contrário, o esquema de controle de fluxo funciona para adaptar a taxa de transmissão ao receptor mais lento. Verificamos o desempenho de nossos esquemas propostos usando simulação computacional.
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
Kazunori YAMAMOTO, Miki YAMAMOTO, Hiromasa IKEDA, "Congestion Control for Reliable Multicast Achieving TCP Fairness" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 1, pp. 183-190, January 2002, doi: .
Abstract: In the paper, we propose a congestion control scheme for reliable multicast communication which enables TCP fairness and prevents a drop-to-zero problem. The proposed congestion control scheme is rate-based one based on NAKs from receivers and cooperatively works with a flow control scheme. The congestion control scheme consists of two components of a rate-based controller and a selection mechanism of a representative. The rate-based controller runs between the sender and the representative and achieves TCP fairness and fast response to losses at the representative. The selection mechanism of the representative allows the sender to select the representative in a scalable manner, in which the sender makes use of NAKs from receivers to select it. In the paper, we also propose the switchover mechanism of the flow and congestion control schemes which enables the sender to use either of them adaptively based on network situations. When the network is congested, the congestion control scheme works to share network resources fairly with competing TCP flows. Otherwise, the flow control scheme works to adapt the transmission rate to the slowest receiver. We verify the performance of our proposed schemes by using computer simulation.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_1_183/_p
Copiar
@ARTICLE{e85-b_1_183,
author={Kazunori YAMAMOTO, Miki YAMAMOTO, Hiromasa IKEDA, },
journal={IEICE TRANSACTIONS on Communications},
title={Congestion Control for Reliable Multicast Achieving TCP Fairness},
year={2002},
volume={E85-B},
number={1},
pages={183-190},
abstract={In the paper, we propose a congestion control scheme for reliable multicast communication which enables TCP fairness and prevents a drop-to-zero problem. The proposed congestion control scheme is rate-based one based on NAKs from receivers and cooperatively works with a flow control scheme. The congestion control scheme consists of two components of a rate-based controller and a selection mechanism of a representative. The rate-based controller runs between the sender and the representative and achieves TCP fairness and fast response to losses at the representative. The selection mechanism of the representative allows the sender to select the representative in a scalable manner, in which the sender makes use of NAKs from receivers to select it. In the paper, we also propose the switchover mechanism of the flow and congestion control schemes which enables the sender to use either of them adaptively based on network situations. When the network is congested, the congestion control scheme works to share network resources fairly with competing TCP flows. Otherwise, the flow control scheme works to adapt the transmission rate to the slowest receiver. We verify the performance of our proposed schemes by using computer simulation.},
keywords={},
doi={},
ISSN={},
month={January},}
Copiar
TY - JOUR
TI - Congestion Control for Reliable Multicast Achieving TCP Fairness
T2 - IEICE TRANSACTIONS on Communications
SP - 183
EP - 190
AU - Kazunori YAMAMOTO
AU - Miki YAMAMOTO
AU - Hiromasa IKEDA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2002
AB - In the paper, we propose a congestion control scheme for reliable multicast communication which enables TCP fairness and prevents a drop-to-zero problem. The proposed congestion control scheme is rate-based one based on NAKs from receivers and cooperatively works with a flow control scheme. The congestion control scheme consists of two components of a rate-based controller and a selection mechanism of a representative. The rate-based controller runs between the sender and the representative and achieves TCP fairness and fast response to losses at the representative. The selection mechanism of the representative allows the sender to select the representative in a scalable manner, in which the sender makes use of NAKs from receivers to select it. In the paper, we also propose the switchover mechanism of the flow and congestion control schemes which enables the sender to use either of them adaptively based on network situations. When the network is congested, the congestion control scheme works to share network resources fairly with competing TCP flows. Otherwise, the flow control scheme works to adapt the transmission rate to the slowest receiver. We verify the performance of our proposed schemes by using computer simulation.
ER -