Using destination set grouping to improve the performance of window-controlled multipoint connections

In conventional multicast communication, the source carries a single conversation with all destination nodes. If a node on the path to any destination becomes congested, the throughput to all destinations is reduced, thus treating some destination nodes unfairly. We consider a window-controlled multipoint connection and study the use of destination set grouping, where the destination set can be split into disjoint subgroups with the source carrying independent conversations with each subgroup. We present a static grouping heuristic that can obtain near optimum grouping for static network environments and a dynamic grouping protocol which can adjust the grouping and the window sizes per group in response to changing network conditions. The performance of the static grouping heuristic and the dynamic grouping protocol are studied using simulation and compared with single-group multicasting.

[1]  Leonard Kleinrock,et al.  Power and deterministic rules of thumb for probabilistic problems in computer communications , 1979 .

[2]  D. Grillo,et al.  Flow Control in Local-Area Networks of Interconnected Token Rings , 1985 .

[3]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1988, SIGCOMM '88.

[4]  Raj Jain,et al.  A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks , 1989, CCRV.

[5]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

[6]  Mostafa H. Ammar,et al.  Equivalence Relations in Queueing Models of Fork/Join Networks with Blocking , 1989, Perform. Evaluation.

[7]  Raj Jain,et al.  Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part I: Concepts, Goals and Methodology , 1988, ArXiv.

[8]  Raj Jain,et al.  A Timeout-Based Congestion Control Scheme for Window Flow-Controlled Networks , 1986, IEEE J. Sel. Areas Commun..

[9]  Mostafa H. Ammar,et al.  Routing multipoint connections using virtual paths in an ATM network , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[10]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[11]  Mostafa H. Ammar,et al.  Improving the throughput of point-to-multipoint ARQ protocols through destination set splitting , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.