A game theory based classification for distributed downloading of multiple description coded video
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Network coding for multi-resolution multicast
INFOCOM'10 Proceedings of the 29th conference on Information communications
Improving quality-of-experience for multiple description video transmission in peer-to-peer networks
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
Multirate multicasting with intralayer network coding
IEEE/ACM Transactions on Networking (TON)
Meta-heuristic algorithms for optimized network flow wavelet-based image coding
Applied Soft Computing
| Hi-index | 754.84 |
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of a multiple description (MD) source from multiple servers to multiple sinks. We aim at maximizing a collective metric of the quality of source reconstruction at all sinks, by optimally routing the MD source streams from the server nodes to the sinks. This problem turns out to be very different from conventional maximum network flow. The objective function involves not only the flow volume but also the diversity of the flow contents (i.e., distinction of descriptions), hence, the term rainbow network flow (RNF). For a general network topology, a general fidelity function, and an arbitrary distribution of MDC descriptions on the servers, we prove the RNF problem to be Max-SNP-hard. However, the problem becomes tractable in many practical scenarios, such as when MDC is balanced with descriptions of the same length and importance, when all source nodes have the complete set of MDC descriptions, and when the network topology is a tree or has only one sink. Polynomial-time RNF algorithms are developed for these cases.