Analysis and evaluation of adaptive LDPC AL-FEC codes for content download services

This paper proposes the use of adaptive low density parity check (LDPC) application layer-forward error correction (AL-FEC) codes for content download services over erasure channels. In adaptive LDPC codes, clients inform the content download server of the losses they are experiencing. Using this in...

Descripción completa

Detalles Bibliográficos
Autores: De Fez Lava, Ismael, Fraile Gil, Francisco|||0000-0002-3275-7740, Belda Ortega, Román|||0000-0003-2244-2371, Guerri Cebollada, Juan Carlos|||0000-0002-5807-1923
Tipo de recurso: artículo
Fecha de publicación:2012
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/56257
Acceso en línea:https://riunet.upv.es/handle/10251/56257
Access Level:acceso abierto
Palabra clave:Adaptive codes
Application layer forward error correction (AL-FEC)
File delivery over unidirectional transport (FLUTE)
Low density parity check (LDPC)
INGENIERIA TELEMATICA
Descripción
Sumario:This paper proposes the use of adaptive low density parity check (LDPC) application layer-forward error correction (AL-FEC) codes for content download services over erasure channels. In adaptive LDPC codes, clients inform the content download server of the losses they are experiencing. Using this information, the server makes forward error correction (FEC) parity symbols available to the client at an optimum code rate. This paper presents an analytical model of the proposed adaptive LDPC codes. The model is validated through measurements realized with an application prototype. In addition, results show the performance of these codes in different scenarios, compared to the performance of nonadaptive AL-FEC, optimum LDPC AL-FEC codes, and an almost ideal rateless code. Adaptive LDPC AL-FEC codes achieve download times similar to almost ideal rateless codes with less coding complexity, at the expense of an interaction channel between server and clients.