Information Theory and Reliable Communication
Information Theory and Reliable Communication
High-SNR analysis of outage-limited communications with bursty and delay-limited information
IEEE Transactions on Information Theory
Random linear network coding for time-division duplexing: queueing analysis
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Communication over fading channels with delay constraints
IEEE Transactions on Information Theory
Delay-bounded packet scheduling of bursty traffic over wireless channels
IEEE Transactions on Information Theory
Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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 block-coding 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.