Abstract
A conceptually simple proof for the capacity formula of an exponential server timing channel is provided. The proof links the timing channel to the point-process channel with instantaneous noiseless feedback. This point-process approach enables a study of timing channels that arise in multiserver queues, queues in tandem, and other simple configurations. Although the capacities of such channels remain to be found, the paper provides some analytical bounds and highlights a method to find achievable rates via simulations.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2697-2709 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 52 |
| Issue number | 6 |
| DOIs | |
| State | Published - Jun 1 2006 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Keywords
- Channels with feedback
- Direct-detection photon channel
- Intensity
- Nonlinear filtering
- Point process
- Poisson channel
- Queue
- Rate
- Timing channel
Fingerprint Dive into the research topics of 'Capacity of queues via point-process channels'. Together they form a unique fingerprint.
Cite this
Sundaresan, R., & Verdú, S. (2006). Capacity of queues via point-process channels. IEEE Transactions on Information Theory, 52(6), 2697-2709. https://doi.org/10.1109/TIT.2005.862079