We consider a streaming communication system where the source packets must be played back sequentially at the destination and study the associated average playback delay. We assume that all the source packets are available before the start of transmission at the transmitter and consider the case of an i.i.d. erasure channel with perfect feedback. We first consider the case when the receiver buffer can be arbitrarily large, and show that the average playback delay remains bounded in the length of the stream provided that the channel bandwidth is greater than a critical threshold. Our analysis involves the application of martingale theory to study the transient behaviour of a one dimensional random walk with drift. Conversely when the channel bandwidth is smaller than the above threshold, the average playback delay increases linearly with the stream length. We also consider the finite buffer case and analyse the playback delay of a greedy dynamic bandwidth scheme. We further show through simulations that the achievable delay with a finite receiver buffer is close to the infinite buffer case for moderately large buffer values.
[1]
Gregory W. Wornell,et al.
A Multi-Burst Transmission Strategy for Streaming Over Blockage Channels with Long Feedback Delay
,
2011,
IEEE Journal on Selected Areas in Communications.
[2]
Gregory W. Wornell,et al.
On playback delay in streaming communication
,
2012,
2012 IEEE International Symposium on Information Theory Proceedings.
[3]
Gregory W. Wornell,et al.
Throughput-smoothness trade-offs in multicasting of an ordered packet stream
,
2014,
2014 International Symposium on Network Coding (NetCod).
[4]
Emin Martinian,et al.
Dynamic information and constraints in source and channel coding
,
2004
.
[5]
R. Durrett.
Probability: Theory and Examples
,
1993
.
[6]
Robert G. Gallager,et al.
Discrete Stochastic Processes
,
1995
.