Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
ACM SIGCOMM Computer Communication Review
A binary feedback scheme for congestion avoidance in computer networks
ACM Transactions on Computer Systems (TOCS)
Equivalence relations in queueing models of fork/join networks with blocking
Performance Evaluation - Queueing networks with finite capacity queues
Improving the throughput of point-to-multipoint ARQ protocols through destination set splitting
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
A Timeout-Based Congestion Control Scheme for Window Flow-Controlled Networks
IEEE Journal on Selected Areas in Communications
Inter-receiver fairness: a novel performance measure for multicast ABR sessions
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A third-party value-added network service approach to reliable multicast
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Robustness to inflated subscription in multicast congestion control
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Design of multicast protocols robust against inflated subscription
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.24 |
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.