Optimal code length for bursty sources with deadlines

Abstract

Data transmission over a discrete memoryless channel is considered when the arrival of data is bursty and is subject to a delay deadline. An exponential decay of the probability of delay violation with respect to a large delay deadline is proved when the block length scales linearly with the deadline. When considered in conjunction with Gallager's error exponents, the first natural consequence of this result is a separation principle: a separated scheme of buffering traffic and blockcoding transmissions achieves arbitrarily high reliability for an asymptotically large delay budget. Furthermore, the exponential decay nature of the result provides some insight as how to budget the delay limit between the coding time and the waiting time in the queue.

Energy-delay considerations in coded packet flows

“…In our work, we address both online and batch-to-batch approaches and provide a queueing-theoretic analysis, where average delay and average energy consumption as a function of the link erasure probabilities and the arrival rates at each node are analyzed. We then assume that all terminals cannot send and receive at the same time, which is an extension of the results for the point-to-point case [11], [12] to multihop networks. We show that there is an optimal number of coded data packets at each node, for example in terms of average completion time or energy, to be sent before stopping to listen, and devise an efficient algorithm to find these values.…”