MTRMCC: A Congestion Control Mechanism for Many-to-Many Tree-Based Reliable Multicast Protocols

Kyungran KANG; Dongman LEE; Je-young YOU

MTRMCC: A Congestion Control Mechanism for Many-to-Many Tree-Based Reliable Multicast Protocols

Kyungran KANG, Dongman LEE, Je-young YOU

Full Text Views

0

Share
Cite this

Summary :

As the Internet proliferates, there has been a growing interest in supporting multiparty collaborative applications. It has led to the emergence of many-to-ma ny reliable multicast. Congestion control is a key task in reliable multicast along with error control. However, existing tree-based congestion control schemes such as TRAMCC and MTCP are designed for one-to-many reliable multicast and have some drawbacks when they are used for many-to-many reliable multicast. We propose an efficient congestion control mechanism, MTRMCC, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network traffic changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly. The performance of the proposed scheme is evaluated using network simulator ns-2. The simulation results show that the proposed scheme outperforms TRAMCC in terms of intra-session fairness and supports responsiveness, TCP-friendliness, and scalability.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.6 pp.1601-1609

Publication Date: 2004/06/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Internet

Cite this

Copy

Kyungran KANG, Dongman LEE, Je-young YOU, "MTRMCC: A Congestion Control Mechanism for Many-to-Many Tree-Based Reliable Multicast Protocols" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 6, pp. 1601-1609, June 2004, doi: .
Abstract: As the Internet proliferates, there has been a growing interest in supporting multiparty collaborative applications. It has led to the emergence of many-to-ma ny reliable multicast. Congestion control is a key task in reliable multicast along with error control. However, existing tree-based congestion control schemes such as TRAMCC and MTCP are designed for one-to-many reliable multicast and have some drawbacks when they are used for many-to-many reliable multicast. We propose an efficient congestion control mechanism, MTRMCC, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network traffic changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly. The performance of the proposed scheme is evaluated using network simulator ns-2. The simulation results show that the proposed scheme outperforms TRAMCC in terms of intra-session fairness and supports responsiveness, TCP-friendliness, and scalability.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e87-b_6_1601/_p

Copy

@ARTICLE{e87-b_6_1601,
author={Kyungran KANG, Dongman LEE, Je-young YOU, },
journal={IEICE TRANSACTIONS on Communications},
title={MTRMCC: A Congestion Control Mechanism for Many-to-Many Tree-Based Reliable Multicast Protocols},
year={2004},
volume={E87-B},
number={6},
pages={1601-1609},
abstract={As the Internet proliferates, there has been a growing interest in supporting multiparty collaborative applications. It has led to the emergence of many-to-ma ny reliable multicast. Congestion control is a key task in reliable multicast along with error control. However, existing tree-based congestion control schemes such as TRAMCC and MTCP are designed for one-to-many reliable multicast and have some drawbacks when they are used for many-to-many reliable multicast. We propose an efficient congestion control mechanism, MTRMCC, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network traffic changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly. The performance of the proposed scheme is evaluated using network simulator ns-2. The simulation results show that the proposed scheme outperforms TRAMCC in terms of intra-session fairness and supports responsiveness, TCP-friendliness, and scalability.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - MTRMCC: A Congestion Control Mechanism for Many-to-Many Tree-Based Reliable Multicast Protocols
T2 - IEICE TRANSACTIONS on Communications
SP - 1601
EP - 1609
AU - Kyungran KANG
AU - Dongman LEE
AU - Je-young YOU
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2004
AB - As the Internet proliferates, there has been a growing interest in supporting multiparty collaborative applications. It has led to the emergence of many-to-ma ny reliable multicast. Congestion control is a key task in reliable multicast along with error control. However, existing tree-based congestion control schemes such as TRAMCC and MTCP are designed for one-to-many reliable multicast and have some drawbacks when they are used for many-to-many reliable multicast. We propose an efficient congestion control mechanism, MTRMCC, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network traffic changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly. The performance of the proposed scheme is evaluated using network simulator ns-2. The simulation results show that the proposed scheme outperforms TRAMCC in terms of intra-session fairness and supports responsiveness, TCP-friendliness, and scalability.
ER -