Congestion Control for Reliable Multicast Achieving TCP Fairness

Kazunori YAMAMOTO; Miki YAMAMOTO; Hiromasa IKEDA

Congestion Control for Reliable Multicast Achieving TCP Fairness

Kazunori YAMAMOTO, Miki YAMAMOTO, Hiromasa IKEDA

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E85-B No.1 pp.183-190

Publication Date: 2002/01/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Internet Technology II -- Traffic Control and Performance Evaluation in the Internet)

Category

Cite this

Copy

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

Copy

@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},}

Copy

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 -