Optimal code length for bursty sources with deadlines

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 deadlin...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE International Symposium on Information Theory pp. 2694 - 2698
Main Authors Javidi, T., Swamy, R.N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2009
Subjects
Block codes
Channel capacity
Decoding
Delay effects
Information theory
Memoryless systems
Queueing analysis
Reliability theory
Traffic control
Transmitters
Online AccessGet full text
ISBN9781424443123
1424443121
ISSN2157-8095
DOI10.1109/ISIT.2009.5205883

Cover

More Information
Summary: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.
ISBN:9781424443123
1424443121
ISSN:2157-8095
DOI:10.1109/ISIT.2009.5205883