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)
On the use of destination set grouping to improve fairness in multicast video distribution
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
| Hi-index | 0.00 |
Abstract: 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 same 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 dynamic grouping protocol which can adjust the grouping and the window sizes per group in response to changing network conditions. The performance of the protocol is studied using simulation and compared with single-group multicasting.