Dynamic Algorithms for Multicast With Intra-Session Network Coding
- 6 February 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 55 (2) , 797-815
- https://doi.org/10.1109/tit.2008.2009809
Abstract
The problem of multiple multicast sessions with intra-session network coding in time-varying networks is considered. The network-layer capacity region of input rates that can be stably supported is established. Dynamic algorithms for multicast routing, network coding, power allocation, session scheduling, and rate allocation across correlated sources, which achieve stability for rates within the capacity region, are presented. This work builds on the back-pressure approach introduced by Tassiulas , extending it to network coding and correlated sources. In the proposed algorithms, decisions on routing, network coding, and scheduling between different sessions at a node are made locally at each node based on virtual queues for different sinks. For correlated sources, the sinks locally determine and control transmission rates across the sources. The proposed approach yields a completely distributed algorithm for wired networks. In the wireless case, power control among different transmitters is centralized while routing, network coding, and scheduling between different sessions at a given node are distributed.Keywords
This publication has 22 references indexed in Scilit:
- Dynamic Algorithms for Multicast With Intra-Session Network CodingIEEE Transactions on Information Theory, 2009
- Correlated data gathering in wireless sensor networks based on distributed source codingInternational Journal of Sensor Networks, 2008
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- The impact of imperfect scheduling on cross-Layer congestion control in wireless networksIEEE/ACM Transactions on Networking, 2006
- Throughput-range tradeoff of wireless mesh backhaul networksIEEE Journal on Selected Areas in Communications, 2006
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- The benefits of coding over routing in a randomized settingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Power control for multihop wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Throughput and delay optimal resource allocation in multiaccess fading channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995