Acta Metallurgica Sinica(English letters) ›› 2009, Vol. 16 ›› Issue (3): 71-83.doi: 10.1016/S1005-8885(08)60230-7

• Networks • 上一篇    下一篇

Optimal choice of Teed-Solomon codes to protect against queuing losses in wireless networks

Claus Bauer   

  1. Dolby Laboratories, 100 Potrero Avenue, San Francisco, CA 94103, USA
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-06-30
  • 通讯作者: Claus Bauer

Optimal choice of reed Solomon codes to protect against queuing losses in wireless networks

Claus Bauer   

  1. Dolby Laboratories, 100 Potrero Avenue, San Francisco, CA 94103, USA
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-06-30
  • Contact: Claus Bauer

摘要:

This article proposes algorithms to determine an optimal choice of the reed Solomon forward error correction (FEC) code parameters (n,k) to mitigate the effects of packet loss on multimedia traffic caused by buffer overflow at a wireless base station. A network model is developed that takes into account traffic arrival rates, channel loss characteristics, the capacity of the buffer at the base station, and FEC parameters. For Poisson distributed traffic, the theory of recurrent linear equations is applied to develop a new closed form solution of low complexity of the Markov model for the buffer occupancy. For constant bit rate (CBR) traffic, an iterative procedure is developed to compute the packet loss probabilities after FEC recovery.

关键词:

FEC,;packet;loss,;buffer;occupancy,;Markov;model

Abstract:

This article proposes algorithms to determine an optimal choice of the reed Solomon forward error correction (FEC) code parameters (n,k) to mitigate the effects of packet loss on multimedia traffic caused by buffer overflow at a wireless base station. A network model is developed that takes into account traffic arrival rates, channel loss characteristics, the capacity of the buffer at the base station, and FEC parameters. For Poisson distributed traffic, the theory of recurrent linear equations is applied to develop a new closed form solution of low complexity of the Markov model for the buffer occupancy. For constant bit rate (CBR) traffic, an iterative procedure is developed to compute the packet loss probabilities after FEC recovery.

Key words:

FEC;packet loss;buffer occupancy;Markov model