Capacity of queues via point-process channels

Rajesh Sundaresan; Sergio Verdú

doi:10.1109/TIT.2005.862079

Capacity of queues via point-process channels

Rajesh Sundaresan, Sergio Verdú

Research output: Contribution to journal › Article › peer-review

28 Scopus citations

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	https://doi.org/10.1109/TIT.2005.862079
State	Published - Jun 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

Access to Document

10.1109/TIT.2005.862079

Fingerprint Dive into the research topics of 'Capacity of queues via point-process channels'. Together they form a unique fingerprint.

Cite this

@article{ca8cfaa49e8a42f9a0849d8244b5897f,

title = "Capacity of queues via point-process channels",

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.",

keywords = "Channels with feedback, Direct-detection photon channel, Intensity, Nonlinear filtering, Point process, Poisson channel, Queue, Rate, Timing channel",

author = "Rajesh Sundaresan and Sergio Verd{\'u}",

note = "Funding Information: Manuscript received February 15, 2005; revised September 28, 2005. This work was supported in part by the National Science Foundation under Grant NCR 9523805, in part by Qualcomm Inc., and in part by the Ministry of Human Resources and Development (MHRD, India) under Grant Part(2A) Tenth Plan (338/ECE). The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Sorrento, Italy, June 2000. R. Sundaresan is with the Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore 560 012, India. S. Verd{\'u} is with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA. Communicated by R. Srikant, Guest Editor. Digital Object Identifier 10.1109/TIT.2005.862079",

year = "2006",

month = jun,

doi = "10.1109/TIT.2005.862079",

language = "English (US)",

volume = "52",

pages = "2697--2709",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Capacity of queues via point-process channels

AU - Sundaresan, Rajesh

AU - Verdú, Sergio

N1 - Funding Information: Manuscript received February 15, 2005; revised September 28, 2005. This work was supported in part by the National Science Foundation under Grant NCR 9523805, in part by Qualcomm Inc., and in part by the Ministry of Human Resources and Development (MHRD, India) under Grant Part(2A) Tenth Plan (338/ECE). The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Sorrento, Italy, June 2000. R. Sundaresan is with the Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore 560 012, India. S. Verdú is with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA. Communicated by R. Srikant, Guest Editor. Digital Object Identifier 10.1109/TIT.2005.862079

PY - 2006/6

Y1 - 2006/6

N2 - 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.

AB - 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.

KW - Channels with feedback

KW - Direct-detection photon channel

KW - Intensity

KW - Nonlinear filtering

KW - Point process

KW - Poisson channel

KW - Queue

KW - Rate

KW - Timing channel

UR - http://www.scopus.com/inward/record.url?scp=33745130693&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745130693&partnerID=8YFLogxK

U2 - 10.1109/TIT.2005.862079

DO - 10.1109/TIT.2005.862079

M3 - Article

AN - SCOPUS:33745130693

VL - 52

SP - 2697

EP - 2709

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -