Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Multilevel diversity coding with distortion
IEEE Transactions on Information Theory
A tutorial on decomposition methods for network utility maximization
IEEE Journal on Selected Areas in Communications
Distributed utility maximization for network coding based multicasting: a shortest path approach
IEEE Journal on Selected Areas in Communications
Cross-layer designs in coded wireless fading networks with multicast
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In this work we consider the rate control issue for network coding based multicast among multiple sessions, which can be formulated as a network utility maximization problem. To solve the problem we propose a distributed optimization decomposition approach, which is different from the previous work in the literature in that (1) it is a hierarchical decomposition approach where the primal problem is decomposed recursively, until an independent rate control module is obtained and the decomposed subproblems can be solved by the distributed max-flow algorithm and we emphasize the layered functionality allocation of decomposed subproblems following the framework of "Layering as Optimization Decompositions"; (2) we first separate the primal problem by relaxing the capacity constraint among sessions; (3) to implement end-to-end control, we separate the independent rate control module at end node from the operation in the interior of the network. In this work we intend to propose not only a rate control algorithm but also a possible choice of network architecture for network coding based communication with rate control capability.