Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Introduction to algorithms
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Communications of the ACM
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
A quantitative comparison of graph-based models for Internet topology
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
Scaling of multicast trees: comments on the Chuang-Sirbu scaling law
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
IP multicast channels: EXPRESS support for large-scale single-source applications
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
PLM: fast convergence for cumulative layered multicast transmisson schemes
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
IEEE Communications Magazine
Beyond best effort: router architectures for the differentiated services of tomorrow's Internet
IEEE Communications Magazine
Reliable multicast transport protocol (RMTP)
IEEE Journal on Selected Areas in Communications
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
Fairness of a Single-Rate Multicast Congestion Control Scheme
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
Performance Enhancement Techniques for InfiniBand" Architecture
HPCA '03 Proceedings of the 9th International Symposium on High-Performance Computer Architecture
Fair Bandwidth Allocation for Multicasting in Networks with Discrete Feasible Set
IEEE Transactions on Computers
Content-adaptive wireless streaming of instructional videos
Multimedia Tools and Applications
Exploring IBA Design Space for Improved Performance
IEEE Transactions on Parallel and Distributed Systems
Configurable active multicast congestion control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fair bandwidth sharing between unicast and multicast flows in best-effort networks
Computer Communications
Scalable coding and wireless streaming of lecture videos for mobile learning
Advanced Technology for Learning
SBQ: a simple scheduler for fair bandwidth sharing between unicast and multicast flows
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Robust and fair Multicast Congestion Control (M2C)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Using multicast delivery to multiple receivers reduces the aggregate bandwidth required from the network compared to using unicast delivery to each receiver. However, multicast is not yet widely deployed in the Internet. One reason is the lack of incentive to use multicast delivery. To encourage the use of multicast delivery, we define a new bandwidth-allocation policy, called LogRD, taking into account the number of downstream receivers. This policy gives more bandwidth to a multicast flow as compared to a unicast flow that shares the same bottleneck, without starving the unicast flows, however. The LogRD policy also provides an answer to the question on how to treat a multicast flow compared to a unicast flow sharing the same bottleneck. We investigate three bandwidth-allocation policies for multicast flows and evaluate their impact on both receiver satisfaction and fairness using a simple analytical study and a comprehensive set of simulations. The policy that allocates the available bandwidth as a logarithmic function of the number of receivers downstream of the bottleneck achieves the best tradeoff between receiver satisfaction and fairness.