TCP-friendly window congestion control with dynamic grouping for reliable multicast

Shuming Chang, H. Jonathan Chao, Xiaolei Guo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Congestion control for reliable multicast for large multicast groups has been a challenging issue for widespread deployment of reliable multicast services. In this paper, we propose a receiver-driven window congestion control scheme with dynamic grouping for reliable multicast. The main objective is to improve multicast throughput performance and to solve the well-known `drop-to-zero' problem, i.e., to prevent a slow receiver from slowing down faster receivers in the same multicast group. For this purpose, we modify the window scheme and combine it with a new dynamic grouping scheme for local recovery to achieve high-throughput performance. The basic idea is two-fold. First, the sender can tune its window size according to the fastest receiver in a virtual group instead of the slowest receiver by taking advantage of the local recovery. Second, the sender can explicitly ask a worst-case group (WCG), which can be recorded in a simple list in cache or memory, to merge with others or unsubscribe from the multicast group. The proposed strategy is shown to be still TCP-friendly and scalable while eliminating the `drop-to-zero' problem. Some key related issues are also discussed.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
PublisherIEEE
Pages538-547
Number of pages10
Volume1
StatePublished - 2000

Fingerprint

congestion
Throughput
Recovery
fold
Data storage equipment
services

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Chang, S., Chao, H. J., & Guo, X. (2000). TCP-friendly window congestion control with dynamic grouping for reliable multicast. In Conference Record / IEEE Global Telecommunications Conference (Vol. 1, pp. 538-547). IEEE.

TCP-friendly window congestion control with dynamic grouping for reliable multicast. / Chang, Shuming; Chao, H. Jonathan; Guo, Xiaolei.

Conference Record / IEEE Global Telecommunications Conference. Vol. 1 IEEE, 2000. p. 538-547.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chang, S, Chao, HJ & Guo, X 2000, TCP-friendly window congestion control with dynamic grouping for reliable multicast. in Conference Record / IEEE Global Telecommunications Conference. vol. 1, IEEE, pp. 538-547.
Chang S, Chao HJ, Guo X. TCP-friendly window congestion control with dynamic grouping for reliable multicast. In Conference Record / IEEE Global Telecommunications Conference. Vol. 1. IEEE. 2000. p. 538-547
Chang, Shuming ; Chao, H. Jonathan ; Guo, Xiaolei. / TCP-friendly window congestion control with dynamic grouping for reliable multicast. Conference Record / IEEE Global Telecommunications Conference. Vol. 1 IEEE, 2000. pp. 538-547
@inproceedings{8e515f0a17354dfda162e99a513823db,
title = "TCP-friendly window congestion control with dynamic grouping for reliable multicast",
abstract = "Congestion control for reliable multicast for large multicast groups has been a challenging issue for widespread deployment of reliable multicast services. In this paper, we propose a receiver-driven window congestion control scheme with dynamic grouping for reliable multicast. The main objective is to improve multicast throughput performance and to solve the well-known `drop-to-zero' problem, i.e., to prevent a slow receiver from slowing down faster receivers in the same multicast group. For this purpose, we modify the window scheme and combine it with a new dynamic grouping scheme for local recovery to achieve high-throughput performance. The basic idea is two-fold. First, the sender can tune its window size according to the fastest receiver in a virtual group instead of the slowest receiver by taking advantage of the local recovery. Second, the sender can explicitly ask a worst-case group (WCG), which can be recorded in a simple list in cache or memory, to merge with others or unsubscribe from the multicast group. The proposed strategy is shown to be still TCP-friendly and scalable while eliminating the `drop-to-zero' problem. Some key related issues are also discussed.",
author = "Shuming Chang and Chao, {H. Jonathan} and Xiaolei Guo",
year = "2000",
language = "English (US)",
volume = "1",
pages = "538--547",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - TCP-friendly window congestion control with dynamic grouping for reliable multicast

AU - Chang, Shuming

AU - Chao, H. Jonathan

AU - Guo, Xiaolei

PY - 2000

Y1 - 2000

N2 - Congestion control for reliable multicast for large multicast groups has been a challenging issue for widespread deployment of reliable multicast services. In this paper, we propose a receiver-driven window congestion control scheme with dynamic grouping for reliable multicast. The main objective is to improve multicast throughput performance and to solve the well-known `drop-to-zero' problem, i.e., to prevent a slow receiver from slowing down faster receivers in the same multicast group. For this purpose, we modify the window scheme and combine it with a new dynamic grouping scheme for local recovery to achieve high-throughput performance. The basic idea is two-fold. First, the sender can tune its window size according to the fastest receiver in a virtual group instead of the slowest receiver by taking advantage of the local recovery. Second, the sender can explicitly ask a worst-case group (WCG), which can be recorded in a simple list in cache or memory, to merge with others or unsubscribe from the multicast group. The proposed strategy is shown to be still TCP-friendly and scalable while eliminating the `drop-to-zero' problem. Some key related issues are also discussed.

AB - Congestion control for reliable multicast for large multicast groups has been a challenging issue for widespread deployment of reliable multicast services. In this paper, we propose a receiver-driven window congestion control scheme with dynamic grouping for reliable multicast. The main objective is to improve multicast throughput performance and to solve the well-known `drop-to-zero' problem, i.e., to prevent a slow receiver from slowing down faster receivers in the same multicast group. For this purpose, we modify the window scheme and combine it with a new dynamic grouping scheme for local recovery to achieve high-throughput performance. The basic idea is two-fold. First, the sender can tune its window size according to the fastest receiver in a virtual group instead of the slowest receiver by taking advantage of the local recovery. Second, the sender can explicitly ask a worst-case group (WCG), which can be recorded in a simple list in cache or memory, to merge with others or unsubscribe from the multicast group. The proposed strategy is shown to be still TCP-friendly and scalable while eliminating the `drop-to-zero' problem. Some key related issues are also discussed.

UR - http://www.scopus.com/inward/record.url?scp=0034478305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034478305&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0034478305

VL - 1

SP - 538

EP - 547

BT - Conference Record / IEEE Global Telecommunications Conference

PB - IEEE

ER -