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
Linear-speed interior-path algorithms for distributed control of information networks
Performance Evaluation
LION: Layered Overlay Multicast With Network Coding
IEEE Transactions on Multimedia
IEEE Transactions on Information Theory
A framework for routing and congestion control for multicast information flows
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Rainbow Network Flow of Multiple Description Codes
IEEE Transactions on Information Theory
A scalable low-overhead rate control algorithm for multirate multicast sessions
IEEE Journal on Selected Areas in Communications
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Multirate multicasting is a generalization of single-rate multicasting to prevent destinations with good connections from being limited by the capacity of bottleneck connections. While multirate multicasting has been traditionally performed over fixed trees, advances in network coding theory have enabled higher throughput and have helped us move beyond the restriction of tree structures for routing the multicast data. In this paper, we address the questions of optimal rate allocation and low-complexity network coding solutions to the problem of multirate multicasting in general multihop networks. Our work considers intralayer network coding capabilities, where the session is conceptually divided into layers optimally and coding is performed across packets belonging to the same layer. Our approach differs from earlier works in this domain in its separation of the problem into rate allocation and content distribution items, which allows a number of optimization and graphical techniques in their solution. Noting the complexities involved in the optimal rate allocation and content distribution solutions, we then propose and investigate two novel approaches for reducing the complexity of the original scheme for more practical implementation based on a layered multicasting mechanism and nested optimization approach. We demonstrate the implementation advantages of these low-complexity schemes via extensive numerical studies.