Embedding information flows into renewal traffic

Stefano Marano, Vincenzo Matta, Ting He, Lang Tong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

The secure networking problem of embedding information flows into cover traffic is addressed. When relayed packets must obey a causal delay constraint, this naturally remaps to a matching problem between point processes (here taken as arbitrary renewal processes). The best hiding policy is thus characterized in terms of the maximum fraction of matched points, which is accordingly referred to as embedding capacity. For a broad range of renewal models encountered in practice, we provide a simple analytical formula for the capacity, which depends only on the renewal function of the underlying processes, and further find conditions for capacity-ordering of different types of cover traffic. The results are also tested on real network traces, and a very good match is observed, especially for tight delay constraints.

Original languageEnglish (US)
Title of host publication2011 IEEE Information Theory Workshop, ITW 2011
Pages50-54
Number of pages5
DOIs
StatePublished - Dec 21 2011
Event2011 IEEE Information Theory Workshop, ITW 2011 - Paraty, Brazil
Duration: Oct 16 2011Oct 20 2011

Publication series

Name2011 IEEE Information Theory Workshop, ITW 2011

Other

Other2011 IEEE Information Theory Workshop, ITW 2011
CountryBrazil
CityParaty
Period10/16/1110/20/11

All Science Journal Classification (ASJC) codes

  • Information Systems

Cite this