A reliable multicast framework for light-weight sessions and application level framing
IEEE/ACM Transactions on Networking (TON)
Sharing the “cost” of multicast trees: an axiomatic analysis
IEEE/ACM Transactions on Networking (TON)
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
The impact of multicast layering on network fairness
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Fully reliable multicast in heterogeneous environments
PfHSN '96 Proceedings of the TC6 WG6.1/6.4 Fifth International Workshop on Protocols for High-Speed Networks V
TRAM: A Tree-based Reliable Multicast Protocol
TRAM: A Tree-based Reliable Multicast Protocol
Some Observations on Fairness of Bandwidth Sharing
Some Observations on Fairness of Bandwidth Sharing
RMTP: a reliable multicast transport protocol
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
Cross-Layer QoS Scheduling for Layered Multicast Streaming in OFDMA Wireless Networks
Wireless Personal Communications: An International Journal
Reliable multicast protocol adopting hierarchical tree-based repair mechanism
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
| Hi-index | 0.00 |
Multicast flow (congestion) control establishes a data rate for a multicast session based on prevailing bandwidth availability given other network traffic. This rate is dictated by the sender's path to the slowest receiver. This level of performance, however, may not be in the best interest for the multicast group as a whole. A pruning algorithm is then used to identify and remove some slow members so that the performance is acceptable for the whole group. This paper discusses the conceptual issues with pruning, and proposes practical algorithms for pruning. The crux of the problem is to achieve a balance between speed and accuracy, because increased accuracy tends to require monitoring for a longer time and using more global information. We evaluate and compare different strategies using both simulation and measurement of real implementations.