Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/231330
Title: Delay Minimization in Real-Time Communications With Joint Buffering and Coding
Authors: Jesper H. S&x00F8;rensen;Petar Popovski;Jan &x00D8;stergaard
Year: 2017
Publisher: IEEE
Abstract: We present a closed-form expression for the minimal delay that is achievable in a setting that combines a buffer and an erasure code, used to mitigate the packet delay variance. The erasure code is modeled according to the recent information-theoretic results on finite block length codes. Evaluations reveal that accurate knowledge of the network parameters is essential for optimal operation. Moreover, it is shown that, when the network packet delay variance is large, the buffer delay becomes negligible. Therefore, in this case, the delay budget should be spent mainly on the erasure code.
URI: http://localhost/handle/Hannan/231330
volume: 21
issue: 1
More Information: 52,
55
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7585023.pdf455.76 kBAdobe PDF
Title: Delay Minimization in Real-Time Communications With Joint Buffering and Coding
Authors: Jesper H. S&x00F8;rensen;Petar Popovski;Jan &x00D8;stergaard
Year: 2017
Publisher: IEEE
Abstract: We present a closed-form expression for the minimal delay that is achievable in a setting that combines a buffer and an erasure code, used to mitigate the packet delay variance. The erasure code is modeled according to the recent information-theoretic results on finite block length codes. Evaluations reveal that accurate knowledge of the network parameters is essential for optimal operation. Moreover, it is shown that, when the network packet delay variance is large, the buffer delay becomes negligible. Therefore, in this case, the delay budget should be spent mainly on the erasure code.
URI: http://localhost/handle/Hannan/231330
volume: 21
issue: 1
More Information: 52,
55
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7585023.pdf455.76 kBAdobe PDF
Title: Delay Minimization in Real-Time Communications With Joint Buffering and Coding
Authors: Jesper H. S&x00F8;rensen;Petar Popovski;Jan &x00D8;stergaard
Year: 2017
Publisher: IEEE
Abstract: We present a closed-form expression for the minimal delay that is achievable in a setting that combines a buffer and an erasure code, used to mitigate the packet delay variance. The erasure code is modeled according to the recent information-theoretic results on finite block length codes. Evaluations reveal that accurate knowledge of the network parameters is essential for optimal operation. Moreover, it is shown that, when the network packet delay variance is large, the buffer delay becomes negligible. Therefore, in this case, the delay budget should be spent mainly on the erasure code.
URI: http://localhost/handle/Hannan/231330
volume: 21
issue: 1
More Information: 52,
55
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7585023.pdf455.76 kBAdobe PDF