A comparative study of forward error correction and frame accumulation for VoIP over congested networks
(2007) 20th International Teletraffic Congress (ITC 20), 2007 4516. p.374-385- Abstract
- We compare Forward Error Correction (FEC) and frame AC-Cumulation (ACC) to see which of the two schemes most effectively reduce frame loss rate for an aggregate of VoIP flows, sharing a network bottleneck. We model this bottleneck by a M/M/1/K queue and we analytically show that given certain assumptions, FEC is the best choice for low initial load at the bottleneck. Then, as the initial load increases, a crossing point is reached after which applying ACC is the better choice. We study this crossing point through numerical examples. Furthermore, we present numerical examples indicating that ACC is better than FEC in bandwidth limited network scenarios, while performance is more equal for packet processing limited scenarios, with FEC being... (More)
- We compare Forward Error Correction (FEC) and frame AC-Cumulation (ACC) to see which of the two schemes most effectively reduce frame loss rate for an aggregate of VoIP flows, sharing a network bottleneck. We model this bottleneck by a M/M/1/K queue and we analytically show that given certain assumptions, FEC is the best choice for low initial load at the bottleneck. Then, as the initial load increases, a crossing point is reached after which applying ACC is the better choice. We study this crossing point through numerical examples. Furthermore, we present numerical examples indicating that ACC is better than FEC in bandwidth limited network scenarios, while performance is more equal for packet processing limited scenarios, with FEC being the slightly better choice. Finally, we introduce more general queue models, e.g. the MMPP/M/1/K queue, to model traffic scenarios like the aggregate of ON/OFF VoIP traffic. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/4092506
- author
- Praestholm, Steffen ; Schwefel, Hans-Peter and Andersen, Sören Vang LU
- publishing date
- 2007
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Managing Traffic Performance in Converged Networks
- volume
- 4516
- pages
- 374 - 385
- publisher
- Springer
- conference name
- 20th International Teletraffic Congress (ITC 20), 2007
- conference location
- Ottawa, Canada
- conference dates
- 2007-06-17 - 2007-06-21
- external identifiers
-
- wos:000247853600035
- scopus:38149042716
- ISSN
- 1611-3349
- 0302-9743
- language
- English
- LU publication?
- no
- id
- be53a557-d113-45a3-b4b9-58ec6c633878 (old id 4092506)
- date added to LUP
- 2016-04-01 11:51:18
- date last changed
- 2024-01-07 23:04:00
@inproceedings{be53a557-d113-45a3-b4b9-58ec6c633878, abstract = {{We compare Forward Error Correction (FEC) and frame AC-Cumulation (ACC) to see which of the two schemes most effectively reduce frame loss rate for an aggregate of VoIP flows, sharing a network bottleneck. We model this bottleneck by a M/M/1/K queue and we analytically show that given certain assumptions, FEC is the best choice for low initial load at the bottleneck. Then, as the initial load increases, a crossing point is reached after which applying ACC is the better choice. We study this crossing point through numerical examples. Furthermore, we present numerical examples indicating that ACC is better than FEC in bandwidth limited network scenarios, while performance is more equal for packet processing limited scenarios, with FEC being the slightly better choice. Finally, we introduce more general queue models, e.g. the MMPP/M/1/K queue, to model traffic scenarios like the aggregate of ON/OFF VoIP traffic.}}, author = {{Praestholm, Steffen and Schwefel, Hans-Peter and Andersen, Sören Vang}}, booktitle = {{Managing Traffic Performance in Converged Networks}}, issn = {{1611-3349}}, language = {{eng}}, pages = {{374--385}}, publisher = {{Springer}}, title = {{A comparative study of forward error correction and frame accumulation for VoIP over congested networks}}, volume = {{4516}}, year = {{2007}}, }