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
본 논문에서는 TCP 공정성을 구현하고 drop-to-zero 문제를 방지하는 안정적인 멀티캐스트 통신을 위한 혼잡 제어 방식을 제안합니다. 제안된 혼잡 제어 기법은 수신기의 NAK를 기반으로 하는 속도 기반 혼잡 제어 기법이며 흐름 제어 기법과 협력적으로 작동한다. 혼잡 제어 방식은 속도 기반 컨트롤러와 대표 선택 메커니즘의 두 가지 구성 요소로 구성됩니다. 속도 기반 컨트롤러는 송신자와 대표자 사이에서 실행되며 TCP 공정성을 달성하고 대표자의 손실에 대한 빠른 응답을 달성합니다. 대표자의 선택 메커니즘을 통해 발신자는 수신자의 NAK를 사용하여 이를 선택하는 확장 가능한 방식으로 대표를 선택할 수 있습니다. 본 논문에서는 송신자가 네트워크 상황에 따라 적응적으로 둘 중 하나를 사용할 수 있도록 하는 흐름 및 혼잡 제어 방식의 전환 메커니즘을 제안합니다. 네트워크가 혼잡할 때 혼잡 제어 체계는 경쟁하는 TCP 흐름과 공정하게 네트워크 리소스를 공유하도록 작동합니다. 그렇지 않으면 흐름 제어 방식이 가장 느린 수신기에 전송 속도를 적용합니다. 우리는 컴퓨터 시뮬레이션을 사용하여 제안된 방식의 성능을 검증합니다.
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.
부
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
부
@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},}
부
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 -