Layered coding with good allocation outperforms multiple description coding over multiple paths
Vu Nguyen, Ee‐Chien Chang, Wei Tsang Ooi
Abstract
Vu Nguyen, Ee‐Chien Chang, Wei Tsang Ooi
Abstract
Packet loss is a serious problem that severely affects the quality of multimedia streaming over error-prone networks. To reduce the variability of packet loss and delay, packets can be transmitted over different network paths (path diversity), after being coded by error-concealment source coding methods like multiple description coding (MDC) or layered coding (LC). Researches in this area lead to a common belief that MDC is better than LC when the network conditions (packet loss rate, bandwidth) are grave. However, We show that the decision of which packets to send over which paths can greatly affect the performance of LC and MDC, therefore the quality of the streams received. Particularly, using our analytical framework and polynomial algorithms for finding optimal packet allocations, we show that LC outperforms MDC under various critical network conditions.
OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Packet loss is a serious problem that severely affects the quality of multimedia streaming over error-prone networks. To reduce the variability of packet loss and delay, packets can be transmitted over different network paths (path diversity), after being coded by error-concealment source coding methods like multiple description coding (MDC) or layered coding (LC). Researches in this area lead to a common belief that MDC is better than LC when the network conditions (packet loss rate, bandwidth) are grave. However, We show that the decision of which packets to send over which paths can greatly affect the performance of LC and MDC, therefore the quality of the streams received. Particularly, using our analytical framework and polynomial algorithms for finding optimal packet allocations, we show that LC outperforms MDC under various critical network conditions.
Key concepts: Multiple description coding, Computer science, Packet loss, Linear network coding, Network packet, Coding (social sciences), Computer network, End-to-end delay