Multiple description coding in networks with congestion problem

• Published in: IEEE transactions on information theory Vol. 47; no. 3; pp. 891 - 902
• Main Authors: Alasti, M., Sayrafian-Pour, K., Ephremides, A., Farvardin, N.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.03.2001; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Coding; Communication networks; Communications networks; Congestion; Cryptography; Distortion; Encoders; Encoding; Networks; Risk; Stochastic processes
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/18.915641

Suppose that the description of a stochastic process needs to be sent to a destination through a communication network. Also assume there is a risk that the description may be lost. A technique to reduce the risk of losing such descriptions is by sending two (or more) descriptions and hoping that in this way at least one of the descriptions will get through. This problem is referred to as multiple description coding (MDC) and was first introduced by Gersho, Witsenhausen, Wolf, Wyner, Ziv and Ozarow (1979). So far, the main focus of research on this subject has been on the achievable rate-distortion functions and the related structural design issues for such encoders and decoders. Little effort has focused on the performance of such coding schemes in simple communication networks and relation of the overall distortion with respect to some network parameter such as congestion. In this paper, a double description coding (DDC) system in a simple network represented by a set of parallel queues is studied. Comparison is made with a single description coding system and it is shown that DDC significantly improves the overall average end-to-end distortion at high network loading.