Data networks (2nd ed.)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Optimal flow control and routing in multi-path networks
Performance Evaluation - Special issue: Internet performance and control of network systems
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Congestion control for fair resource allocation in networks with multicast flows
IEEE/ACM Transactions on Networking (TON)
Optimal distributed multicast routing using network coding: theory and applications
ACM SIGMETRICS Performance Evaluation Review
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
An information-theoretic view of network management
IEEE Transactions on Information Theory
Distributed interference compensation for wireless networks
IEEE Journal on Selected Areas in Communications
Minimum Cost Routing with a Lifetime Guarantee in Wireless Sensor Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Cross-layer designs in coded wireless fading networks with multicast
IEEE/ACM Transactions on Networking (TON)
Minimum cost multiple multicast network coding with quantized rates
Computer Networks: The International Journal of Computer and Telecommunications Networking
Context-aware nanoscale modeling of multicast multihop cellular networks
IEEE/ACM Transactions on Networking (TON)
Optimal self-adaptive QoS resource management in interference-affected multicast wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Network coding techniques are used to find the minimum-cost transmission scheme for multicast sessions with or without elastic rate demand. It is shown that in wireline networks, solving for the optimal coding subgraphs in network coding is equivalent to finding the optimal routing scheme in a multicommodity flow problem. A set of node-based distributed gradient projection algorithms are designed to jointly implement congestion control/routing at the source node and "virtual" routing at intermediate nodes. The analytical framework and distributed algorithms are further extended to interference-limited wireless networks where link capacities are functions of the signal-to-interference-plus-noise ratio (SINR). To achieve minimum-cost multicast in this setting, the transmission powers of links must be jointly optimized with coding subgraphs and multicast input rates. Node-based power allocation and power control algorithms are developed for the power optimization. The power algorithms, when iterated in conjunction with the congestion control and routing algorithms, converge to the jointly optimal multicast configuration. The scaling matrices required in the gradient projection algorithms are explicitly derived and are shown to guarantee fast convergence to the optimum from any initial condition.