Information Theoretic Approaches for Utilizing Packet Timings in Networks

SPEAKER: Todd P. Coleman
University of Illinois at Urbana-ChampaignAbstract: The use of network services and distributed applications is becoming more and more prevalent as time progresses. This motivates the desire to use advanced communication, control, and prediction strategies to enable these distributed applications - without perturbing the normal operation of networks. Recently, researchers and practitioners have begun espousing the use of the timing modality to afford new degrees of freedom. Here we discuss utilizing packet timings in networks in order to gather and convey information. We specifically speak to: (a) the development of sparse graph codes combined for communicating with packet timings across queuing timing channels that enables efficient reliable decoding at rates approaching fundamental limits, and (b) closed-form characterization of the rate-distortion function of a Poisson process with a queuing distortion measure. If time permits, we will show how the technique used in (b) enables a simple memoryless proof to the capacity of the celebrated "Bits through queues" channel model of Anantharam and Verdu and enables new converses to multiterminal timing channel information theoretic problems.

Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248

Audiences: Everyone Is Invited

Contact: Gerrielyn Ramos