Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Resource Allocation in Multi-hop Wireless Networks
IZS '06 Proceedings of the 2006 International Zurich Seminar on Communications
Network Coding: An Introduction
Network Coding: An Introduction
IEEE Transactions on Information Theory
A framework for routing and congestion control for multicast information flows
IEEE Transactions on Information Theory
A scalable low-overhead rate control algorithm for multirate multicast sessions
IEEE Journal on Selected Areas in Communications
Stable maximum throughput broadcast in wireless fading channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
Single-rate multicasting may yield low utilization of the network resources when a subset of the receivers creates a bottleneck for the whole multicast group. Thus, practical multi-rate multicasting strategies are required to allow users with better channels to achieve maximum performance. While earlier studies have investigated such mechanisms using routing strategies over fixed trees, in this work we consider the possibility of using network coding without a given subgraph. Our scheme identifies the optimal routes and provides the utility maximizing rate allocation and coding solution. We also propose and investigate a nested multicasting method to reduce the complexity of the original scheme for practical implementation.