The Embedding Capacity of Information Flows Under Renewal Traffic

Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching rule is that of a maximum causal delay, and the problem is related to embedding a flow of packets in cover traffic such that no traffic analysis can detect it. The authors study the best undetectable embedding policy and the corresponding maximum flow rate - that they call the embedding capacity - under the assumption that the cover traffic can be modeled as arbitrary renewal processes.

Provided by: Cornell University Topic: Hardware Date Added: Mar 2011 Format: PDF

Find By Topic