Sporadic information sources

摘要

Message arrivals encountered in digital transmission over mostreal communication channels are not independent but appear in clusters.We propose a model of such a bursty K-ary source using a Markov chainwith two states. It is shown that the protocol information of thissporadic source can be drastically reduced on the one hand by notencoding intermessage information (e.g., the starting point of a packet)and on the other hand by buffering and reordering messages. Trade-offsbetween reduced protocol information and message delays are alsoconsidered